Abstract
In this paper we present an original approach for community detection in complex networks. The approach belongs to the family of seed-centric algorithms. However, instead of expanding communities around selected seeds as most of existing approaches do, we explore here applying an ensemble clustering approach to different network partitions derived from ego-centered communities computed for each selected seed. Ego-centered communities are themselves computed applying a recently proposed ensemble ranking based approach that allow to efficiently combine various local modularities used to guide a greedy optimization process. Results of first experiments on real world networks for which a ground truth decomposition into communities are known, argue for the validity of our approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arrow, K.: Social choice and individual values, 2nd edn. Cowles Foundation, New Haven (1963)
Bagrow, J.P., Bollt, E.M.: A local method for detecting communities. Phys. Rev. E 72, 046108 (2005)
Blondel, V.D., Guillaume, J.L., Lefebvre, E.: Fast unfolding of communities in large networks, pp. 1–12 (2008)
Chen, J., Zaïane, O.R., Goebel, R.: Local community identification in social networks. In: Memon, N., Alhajj, R. (eds.) ASONAM, pp. 237–242. IEEE Computer Society (2009)
Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51–69. Springer, Heidelberg (2007)
Clauset, A.: Finding local community structure in networks. Physical Review E (2005)
Cordasco, G., Gargano, L., Capocelli, A.R.M.: Community detection via semi-synchronous label propagation algorithms. Informatica (2010)
Cupertino, T.H., Huertas, J., Zhao, L.: Data clustering using controlled consensus in complex networks. Neurocomputing (2013), http://www.sciencedirect.com/science/article/pii/S0925231213003160
Dahlin, J., Svenson, P.: Ensemble approaches for improving community detection methods. CoRR abs/1309.0242 (2013)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: WWW, pp. 613–622 (2001)
Fern, X.Z., Brodley, C.E.: Solving cluster ensemble problems by bipartite graph partitioning. In: Brodley, C.E. (ed.) ICML. ACM International Conference Proceeding Series, vol. 69, ACM (2004)
Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)
Good, B.H., de Montjoye, Y.A., Clauset, A.: The performance of modularity maximization in practical contexts. Physical Review E(81), 046106 (2010)
Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Communications of the ACM 16(6), 372–378 (1973)
Kanawati, R.: Licod: Leaders identification for community detection in complex networks. In: SocialCom/PASSAT, pp. 577–582 (2011)
Kanawati, R.: Empirical evaluation of applying ensemble ranking to ego-centered communities identification in complex networks. In: Zaz, Y. (ed.) 4th International Conference on Multimedia Computing and Systems. IEEE, Marrakech (2014)
Khorasgani, R.R., Chen, J., Zaiane, O.R.: Top leaders community detection approach in information networks. In: 4th SNA-KDD Workshop on Social Network Mining and Analysis, Washington D.C (2010)
Krebs, V.: Political books network, http://www.orgnet.com/
Lancichinetti, A., Fortunato, S.: Limits of modularity maximization in community detection. CoRR abs/1107.1 (2011)
Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6(1), 29–123 (2009)
Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. Web Intelligence and Agent Systems 6(4), 387–400 (2008)
Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54, 396–405 (2003)
Rosvall, M., Axelsson, D., Bergstrom, C.T.: The map equation. Eur. Phys. J. Special Topics 13, 178 (2009)
Meilă, M.: Comparing clusterings by the variation of information. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT/Kernel 2003. LNCS (LNAI), vol. 2777, pp. 173–187. Springer, Heidelberg (2003)
de Oliveira, T.B.S., Zhao, L., Faceli, K., de Carvalho, A.C.P.L.F.: Data clustering based on complex network community detection. In: IEEE Congress on Evolutionary Computation, pp. 2121–2126. IEEE (2008)
Palla, G., Derônyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping modular structure of protein interaction networks. FEBS Journal 272, 434 (2005)
Pan, L., Dai, C., Chongjun, W., Junyuan, X., Liu, M.: Overlapping community detection via leaders based local expnsion in social networks. In: Proceddings of the 24th IEEE Conferenceon Tools with Artficial Intelligence, ICTA 2012 (2012)
Papadopoulos, S., Kompatsiaris, Y., Vakali, A.: A graph-based clustering scheme for identifying related tags in folksonomies. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol. 6263, pp. 65–76. Springer, Heidelberg (2010)
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media - performance and application considerations. Data Min. Knowl. Discov. 24(3), 515–554 (2012)
Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191–218 (2006)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76, 1–12 (2007)
Shah, D., Zaman, T.: Community Detection in Networks: The Leader-Follower Algorithm. In: Workshop on Networks Across Disciplines in Theory and Applications, NIPS (2010)
Strehl, A., Ghosh, J.: Cluster ensembles: a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research 3, 583–617 (2003)
Subbian, K., Melville, P.: Supervised rank aggregation for predicting influencers in twitter. In: SocialCom/PASSAT, pp. 661–665. IEEE (2011)
Tang, L., Liu, H.: Community Detection and Mining in Social Media. Synthesis Lectures on Data Mining and Knowledge Discovery. Morgan & Claypool Publishers (2010)
Wei, F., Qian, W., Fei, Z., Zhou, A.: Identifying community structures in networks with seed expansion. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 627–634. Springer, Heidelberg (2010)
Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv. 45(4), 43 (2013)
Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kanawati, R. (2014). YASCA: An Ensemble-Based Approach for Community Detection in Complex Networks. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-08783-2_57
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08782-5
Online ISBN: 978-3-319-08783-2
eBook Packages: Computer ScienceComputer Science (R0)