Abstract
Team formation in social networks is a fundamental problem in many database or web applications, such as community-based question answering and the collaborative development of software. It is also well-recognized that forming the right team in social networks is non-trivial. Although many algorithms have been proposed for resolving this problem, most of them are based on very different criteria, concerns and performance metrics, and their performance has not been empirically compared. In this paper, we first compare and contrast all the state-of-the-art team formation algorithms. Next, we propose a benchmark that enables fair comparison amongst these algorithms. We then implement these algorithms using a common platform and evaluate their performance using several real datasets. We also present our insights arising from the results of the comparison and uncover interesting issues for further research. Our experiments are repeatable, with the code and all the datasets publicly accessible in our website at the following url address: www.cse.ust.hk/~xwangau/TF.html.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Power in unity: forming teams in large-scale community systems. In: CIKM, pp. 599–608. ACM (2010)
Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Online team formation in social networks. In: WWW, pp. 839–848. ACM (2012)
Arkiny, E.M., Hassinz, R.: Minimum diameter covering problems. Networks 36(3), 147–155 (2000)
Benz, D., Hotho, A., Jäschke, R., Krause, B., Mitzlaff, F., Schmitz, C., Stumme, G.: The social bookmark and publication management system bibsonomy. VLDBJ 19(6), 849–875 (2010)
Bhowmik, A., Borkar, V.S., Garg, D., Pallan, M.: Submodularity in team formation problem. In: Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, April 24–26, 2014, pp. 893–901 (2014)
Kargar, M., An, A.: Discovering top-k teams of experts with/without a leader in social networks. In: CIKM, pp. 985–994. ACM (2011)
Kargar, M., An, A., Zihayat, M.: Efficient bi-objective team formation in social networks. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012, Part II. LNCS, vol. 7524, pp. 483–498. Springer, Heidelberg (2012)
Kargar, M., Zihayat, M., An, A.: Finding affordable and collaborative teams from a network of experts. In: SDM, pp. 587–595. SIAM (2013)
Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: SIGKDD, pp. 467–476. ACM (2009)
Majumder, A., Datta, S., Naidu, K.: Capacitated team formation problem on social networks. In: SIGKDD, pp. 1005–1013. ACM (2012)
Rangapuram, S.S., Bühler, T., Hein, M.: Towards realistic team formation in social networks based on densest subgraphs. In: WWW, pp. 1077–1088. ACM (2013)
Xinyu, W., Zhou, Z., Wilfred, N.: Appendix: Implementation and experiments details. http://www.cse.ust.hk/~xwangau/appen.pdf
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, X., Zhao, Z., Ng, W. (2015). A Comparative Study of Team Formation in Social Networks. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9049. Springer, Cham. https://doi.org/10.1007/978-3-319-18120-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-18120-2_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18119-6
Online ISBN: 978-3-319-18120-2
eBook Packages: Computer ScienceComputer Science (R0)