Abstract
Community detection in temporal networks is an active field of research, which can be leveraged for several strategic decisions, including enhanced group-recommendation, user behavior prediction, and evolution of user interaction patterns in relation to real-world events. Recent research has shown that combinatorial multi-armed bandit (CMAB) is a suitable methodology to address the problem of dynamic consensus community detection (DCCD), i.e., to compute a single community structure that is conceived to be representative of the knowledge available from community structures observed at the different time steps.
In this paper, we propose a CMAB-based method, called CreDENCE, to solve the DCCD problem. Unlike existing approaches, our algorithm is designed to provide a solution, i.e., dynamic consensus community structure, that embeds both long-term changes in the community formation and newly observed community structures. Experimental evaluation based on publicly available real-world and ground-truth-oriented synthetic networks, with different structure and evolution rate, has confirmed the meaningfulness and key benefits of the proposed method, also against competitors based on evolutionary or consensus approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Experiments were carried out on a Linux (Mint 18) machine with 2.6 GHz Intel Core i7-4720HQ processor and 16 GB ram.
References
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. 10, P10008 (2008)
Brandes, U., Kenis, P., Lerner, J., van Raaij, D.: Network analysis of collaboration structure in Wikipedia. In: Proceedings of the ACM WWW, pp. 731–740 (2009)
Brodka, P., Saganowski, S., Kazienko, P.: GED: the method for group evolution discovery in social networks. Social Netw. Analys. Mining 3(1), 1–14 (2013)
Chen, W., Wang, Y., Yuan, Y.: Combinatorial multi-armed bandit: general framework and applications. In: Proceedings of the ICML, pp. 151–159 (2013)
Dakiche, N., Tayeb, F.B.-S., Slimani, Y., Benatchba, K.: Tracking community evolution in social networks: a survey. Inf. Process. Manag. 56(3), 1084–1102 (2019)
La Fond, T., Sanders, G., Klymko, C., Van Emden, H.: An ensemble framework for detecting community changes in dynamic networks. In: Proceedings of the IEEE HPEC, pp. 1–6 (2017)
Gai, Y., Krishnamachari, B., Jain, R.: Combinatorial network optimization with unknown variables: multi-armed bandits with linear rewards and individual observations. IEEE/ACM Trans. Netw. 20(5), 1466–1478 (2012)
Gao, W., Luo, W., Bu, C.: Adapting the TopLeaders algorithm for dynamic social networks. J. Supercomput. 23 (2017)
Gur, Y., Zeevi, A.J., Besbes, O.: Stochastic multi-armed-bandit problem with non-stationary rewards. In: Proceedings of the NIPS, pp. 199–207 (2014)
He, J., Chen, D.: A fast algorithm for community detection in temporal network. Physica A Stat. Mech. Appl. 429, 87–94 (2015)
Wagenseller, P., Wang, F., Wu, W.: Size matters: a comparative analysis of community detection algorithms. IEEE Trans. Comput. Soc. Syst. 5, 951–960 (2018)
Jiao, P., Wang, W., Jin, D.: Constrained common cluster based model for community detection in temporal and multiplex networks. Neurocomputing 275, 768–780 (2018)
Katehakis, M.N., Veinott Jr., A.F.: Multi-armed bandit problem: decomposition and computation. Math. Oper. Res. 12, 262–268 (1987)
Lancichinetti, A., Fortunato, S.: Consensus clustering in complex networks. Sci. Rep. 2, 336 (2012)
Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Governance in social media: a case study of the Wikipedia promotion process. In: Proceedings of the ICWSM (2010)
Mandaglio, D., Amelio, A., Tagarelli, A.: Consensus community detection in multilayer networks using parameter-free graph pruning. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 193–205. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93040-4_16
Mandaglio, D., Tagarelli, A.: Dynamic consensus community detection and combinatorial multi-armed bandit. In: Proceedings of the IEEE/ACM ASONAM (2019). https://doi.org/10.1145/3341161.3342910
Massa, P., Avesani, P.: Controversial users demand local trust metrics: an experimental study on epinions.com community. In: Proceedings of the AAAI, pp. 121–126 (2005)
Mislove, A.E.: Online social networks: measurement, analysis, and applications to distributed information systems. Ph.D. thesis, Rice University (2009)
Rossetti, G.: RDyn: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893–912 (2017)
Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, vol. 135. MIT press, Cambridge (1998)
Tagarelli, A., Amelio, A., Gullo, F.: Ensemble-based community detection in multilayer networks. Data Min. Knowl. Discov. 31(5), 1506–1543 (2017)
Viswanath, B., Mislove, A., Cha, M., Krishna Gummadi, P.: On the evolution of user interaction in Facebook. In: Proceedings of the ACM WOSN, pp. 37–42 (2009)
Wang, Z., Li, Z., Yuan, G., Sun, Y., Rui, X., Xiang, X.: Tracking the evolution of overlapping communities in dynamic social networks. Knowl. Based Syst. 157, 81–97 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mandaglio, D., Tagarelli, A. (2019). A Combinatorial Multi-Armed Bandit Based Method for Dynamic Consensus Community Detection in Temporal Networks. In: Kralj Novak, P., Šmuc, T., Džeroski, S. (eds) Discovery Science. DS 2019. Lecture Notes in Computer Science(), vol 11828. Springer, Cham. https://doi.org/10.1007/978-3-030-33778-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-33778-0_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33777-3
Online ISBN: 978-3-030-33778-0
eBook Packages: Computer ScienceComputer Science (R0)