Abstract
Community and cluster detection is a popular field of social network analysis. Most algorithms focus on static graphs or series of snapshots.
In this paper we present an algorithm, which detects communities in dynamic graphs. The method is based on the shortest paths to high-connected nodes, so called hubs. Due to local message passing, we can update the clustering results with low computational effort.
The presented algorithm is compared with the Louvain method on large-scale real-world datasets with given community structure. The detected community structure is compared to the given with NMI scores. The advantage of the algorithm is the good performance in dynamic scenarios.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barabási, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 272, 173–187 (1999)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)
Donath, W.E., Hoffman, A.J.: Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17(5), 420–425 (1973)
Falkowski, T., Barth, A., Spiliopoulou, M.: DENGRAPH: a density-based community detection algorithm. In: IEEE/WIC/ACM International Conference of Web Intell, pp. 112–115. IEEE (November 2007)
Falkowski, T., Barth, A., Spiliopoulou, M.: Studying community dynamics with an incremental graph mining algorithm. Am., 1–11 (2008)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Ganti, V., Gehrke, J., Ramakrishnan, R.: DEMON: mining and monitoring evolving data. IEEE Trans. Knowl. Data Eng. 13(1), 50–63 (2001)
Gehrke, J., Ganti, V., Gehrke, J., Ramakrishnan, R.: A framework for measuring changes in data characteristics. Focus (Madison) 578, 126–137 (1999)
Held, P., Dockhorn, A., Kruse, R.: Generating events for dynamic social network simulations. In: Laurent, A., Strauss, O., Bouchon-Meunier, B., Yager, R.R. (eds.) IPMU 2014, Part II. CCIS, vol. 443, pp. 46–55. Springer, Heidelberg (2014)
Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E: Stat., Nonlin, Soft Matter Phys. 65, 2–5 (2002)
Höppner, F., Klawonn, F., Kruse, R., Runkler, T.: Fuzzy Clustering. Wiley, Chichester (1999)
Kruse, R., Borgelt, C., Klawonn, F., Moewes, C., Steinbrecher, M., Held, P.: Computational Intelligence: A Methodological Introduction. Texts in Computer Science. Springer, New York (2013)
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: can geographic isolation explain this unique trait? Behav. Ecol. Sociobiol. 54, 396–405 (2003)
MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of Fifth Berkeley Symposium on Mathematical Statistical and Probability, vol. 1, pp. 281–297, Oakland, CA, USA (1967)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E: Stat., Nonlin, Soft Matter Phys. 69, 1–15 (2004)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On Spectral Clustering: Analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2, 849–856 (2002)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., Schult, R.: MONIC - Modeling and Monitoring Cluster Transitions. In: Proceedings of KDD-06, pp. 706–711 (2006)
Strehl, A., Ghosh, J.: Cluster ensembles a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583–617 (2002)
Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst., pp. 1–33 (2013)
Yu, S., Shi, J.: Multiclass spectral clustering. In: Proceedings of Ninth IEEE International Conference on Computer Vision, vol. 1 (2003)
Zachary, W.: An information flow modelfor conflict and fission in small groups1. J. Anthropol. Res. 33(4), 452–473 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Held, P., Kruse, R. (2016). Online Fuzzy Community Detection by Using Nearest Hubs. In: Carvalho, J., Lesot, MJ., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R. (eds) Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2016. Communications in Computer and Information Science, vol 611. Springer, Cham. https://doi.org/10.1007/978-3-319-40581-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-40581-0_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40580-3
Online ISBN: 978-3-319-40581-0
eBook Packages: Computer ScienceComputer Science (R0)