Radin Hamidi Rad
Divesh Srivastava
ABSTRACT
Team mining is concerned with the identification of a group of experts that are able to collaborate with each other in order to collectively cover a set of required skills. This problem has mainly been addressed either through graph search, which looks for subgraphs that satisfy the skill requirements or through neural architectures that learn a mapping from the skill space to the expert space. An exact graph-based solution to this problem is intractable and its heuristic variants are only able to identify sub-optimal solutions. On the other hand, neural architecture-based solutions are prone to overfitting and simplistically reduce the problem of team formation to one of expert ranking. Our work in this paper proposes an unsupervised heterogeneous skip-gram-based subgraph mining approach that can learn representations for subgraphs in a collaboration network. Unlike previous work, the subgraph representations allow our method to mine teams that have past collaborative history and collectively cover the requested desirable skills. Through our experiments, we demonstrate that our proposed approach is able to outperform a host of state-of-the-art team mining techniques from both quantitative and qualitative perspectives.
Supplemental Material
- Yoshua Bengio, Aaron Courville, and Pascal Vincent. 2013. Representation learning: A review and new perspectives. IEEE transactions on pattern analysis and machine intelligence 35, 8(2013), 1798–1828.Google Scholar
Digital Library
- Spencer Bryson, Heidar Davoudi, Lukasz Golab, Mehdi Kargar, Yuliya Lytvyn, Piotr Mierzejewski, Jaroslaw Szlichta, and Morteza Zihayat. 2020. Robust keyword search in large attributed graphs. Inf. Retr. J. 23, 5 (2020), 502–524. https://doi.org/10.1007/s10791-020-09379-9Google ScholarDigital Library
- Lu Chen, Chengfei Liu, Xiaochun Yang, Bin Wang, Jianxin Li, and Rui Zhou. 2016. Efficient Batch Processing for Multiple Keyword Queries on Graph Data. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, October 24-28, 2016, Snehasis Mukhopadhyay, ChengXiang Zhai, Elisa Bertino, Fabio Crestani, Javed Mostafa, Jie Tang, Luo Si, Xiaofang Zhou, Yi Chang, Yunyao Li, and Parikshit Sondhi (Eds.). ACM, 1261–1270. https://doi.org/10.1145/2983323.2983806Google ScholarDigital Library
- Lu Chen, Chengfei Liu, Rui Zhou, Jiajie Xu, Jeffrey Xu Yu, and Jianxin Li. 2020. Finding Effective Geo-social Group for Impromptu Activities with Diverse Demands. In KDD ’20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23-27, 2020, Rajesh Gupta, Yan Liu, Jiliang Tang, and B. Aditya Prakash (Eds.). ACM, 698–708. https://doi.org/10.1145/3394486.3403114Google ScholarDigital Library
- Yuxiao Dong, Nitesh V Chawla, and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 135–144.Google ScholarDigital Library
- Yulu Du, Xiangwu Meng, Yujie Zhang, and Pengtao Lv. 2020. GERF: A Group Event Recommendation Framework Based on Learning-to-Rank. IEEE Trans. Knowl. Data Eng. 32, 4 (2020), 674–687. https://doi.org/10.1109/TKDE.2019.2893361Google ScholarCross Ref
- Amin Milani Fard, Ebrahim Bagheri, and Ke Wang. 2019. Relationship Prediction in Dynamic Heterogeneous Information Networks. In Advances in Information Retrieval - 41st European Conference on IR Research, ECIR 2019, Cologne, Germany, April 14-18, 2019, Proceedings, Part I(Lecture Notes in Computer Science, Vol. 11437), Leif Azzopardi, Benno Stein, Norbert Fuhr, Philipp Mayr, Claudia Hauff, and Djoerd Hiemstra (Eds.). Springer, 19–34. https://doi.org/10.1007/978-3-030-15712-8_2Google ScholarDigital Library
- Mehdi Kargar, Lukasz Golab, Divesh Srivastava, Jaroslaw Szlichta, and Morteza Zihayat. 2020. Effective Keyword Search over Weighted Graphs. IEEE Transactions on Knowledge and Data Engineering early access (2020). https://doi.org/10.1109/TKDE.2020.2985376Google ScholarDigital Library
- M. Kargar, M. Zihayat, and A. An. 2013. Finding Affordable and Collaborative Teams from a Network of Experts. In SDM. 587–595.Google Scholar
- Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Proceedings of a symposium on the Complexity of Computer Computations. Plenum Press, New York, 85–103.Google ScholarCross Ref
- Yehuda Koren. 2009. Collaborative filtering with temporal dynamics. In KDD.Google Scholar
- T. Lappas, L. Liu, and E. Terzi. 2009. Finding a Team of Experts in Social Networks. In KDD. 467–476.Google Scholar
- T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality. In NIPS. 3111–3119.Google Scholar
- Radin Hamidi Rad, Ebrahim Bagheri, Mehdi Kargar, Divesh Srivastava, and Jaroslaw Szlichta. 2021. Retrieving Skill-Based Teams from Collaboration Networks. In SIGIR ’21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual Event, Canada, July 11-15, 2021, Fernando Diaz, Chirag Shah, Torsten Suel, Pablo Castells, Rosie Jones, and Tetsuya Sakai (Eds.). ACM, 2015–2019. https://doi.org/10.1145/3404835.3463105Google ScholarDigital Library
- A. Sapienza, P. Goyal, and E. Ferrara. 2019. Deep Neural Networks for Optimal Team Composition. Frontiers in Big Data 2, 1 (2019), 1–13.Google ScholarCross Ref
- Fabian Schliski, Jörg Schlötterer, and Michael Granitzer. 2020. Influence of Random Walk Parametrization on Graph Embeddings. In Advances in Information Retrieval - 42nd European Conference on IR Research, ECIR 2020, Lisbon, Portugal, April 14-17, 2020, Proceedings, Part II(Lecture Notes in Computer Science, Vol. 12036), Joemon M. Jose, Emine Yilmaz, João Magalhães, Pablo Castells, Nicola Ferro, Mário J. Silva, and Flávio Martins (Eds.). Springer, 58–65. https://doi.org/10.1007/978-3-030-45442-5_8Google ScholarDigital Library
- Yizhou Sun and Jiawei Han. 2012. Mining Heterogeneous Information Networks: Principles and Methodologies. Morgan & Claypool Publishers. https://doi.org/10.2200/S00433ED1V01Y201207DMK005Google ScholarCross Ref
- Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. 2011. PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks. Proc. VLDB Endow. 4, 11 (2011), 992–1003. http://www.vldb.org/pvldb/vol4/p992-sun.pdfGoogle ScholarDigital Library
- Yahui Sun, Xiaokui Xiao, Bin Cui, Saman K. Halgamuge, Theodoros Lappas, and Jun Luo. 2021. Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights. Proc. VLDB Endow. 14, 7 (2021), 1137–1149. http://www.vldb.org/pvldb/vol14/p1137-sun.pdfGoogle ScholarDigital Library
- Chao-Yuan Wu, Amr Ahmed, Alex Beutel, Alexander J Smola, and How Jing. 2017. Recurrent recommender networks. In WSDM. 495–503.Google Scholar
Index Terms
- Subgraph Representation Learning for Team Mining
Recommendations
Retrieving Skill-Based Teams from Collaboration Networks
SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information RetrievalGiven a set of required skills, the objective of the team formation problem is to form a team of experts that cover the required skills. Most existing approaches are based on graph methods, such as minimum-cost spanning trees. These approaches, due to ...
Learning to Form Skill-based Teams of Experts
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge ManagementWe focus on the composition of teams of experts that collectively cover a set of required skills based on their historical collaboration network and expertise. Prior works are primarily based on the shortest path between experts on the expert ...
Neural Architectures for Searching Subgraph Structures
SIGIR '23: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information RetrievalWith the development of new neural network architectures for graph learning in recent years, the use of graphs to store, represent and process data become more trendy. Nowadays, graphs as a rich structured form of data representation are used in many ...
Comments