Abstract
Community detection is a significant but challenging task in the field of social network analysis. Many effective methods have been proposed to solve this problem. However, most of them are mainly based on the topological structure or node attributes. In this paper, based on SPAEM [1], we propose a joint probabilistic model to detect community which combines node attributes and topological structure. In our model, we create a novel feature-based weighted network, within which each edge weight is represented by the node feature similarity between two nodes at the end of the edge. Then we fuse the original network and the created network with a parameter and employ expectation-maximization algorithm (EM) to identify a community. Experiments on a diverse set of data, collected from Facebook and Twitter, demonstrate that our algorithm has achieved promising results compared with other algorithms.
This is a preview of subscription content, log in via an institution to check access.
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
Ren, W., et al.: Simple probabilistic algorithm for detecting community structure. Physical Review E 79(3), 036111 (2009)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Pothen, A., Simon, H.D., Liou, K.-P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 11(3), 430–452 (1990)
Newman, M.E.J., Leicht, E.A.: Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Science 104(23), 9564–9569 (2007)
Airoldi, E.M., et al.: Mixed membership stochastic blockmodels. Advances in Neural Information Processing Systems (2009)
Fortunato, S.: Community detection in graphs. Physics Reports 486(3), 75–174 (2010)
Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Computing Surveys (CSUR)Â 45(4), 43 (2013)
Zhu, S., et al.: Combining content and link for classification using matrix factorization. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information retrieval. ACM (2007)
Hofmann, D.C.T.: The missing link-a probabilistic model of document content and hypertext connectivity. In: Proceedings of the 2000 Conference on Advances in Neural Information Processing Systems, The MIT Press (2001)
Deerwester, S.C., et al.: Indexing by latent semantic analysis. JASIS 41(6), 391–407 (1990)
Hofmann, T.: Probabilistic latent semantic indexing. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM (1999)
Cohn, D., Chang, H.: Learning to Probabilistically Identify Authoritative Documents. In: ICML (2000)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)
Erosheva, E., Fienberg, S., Lafferty, J.: Mixed-membership models of scientific publications. Proceedings of the National Academy of Sciences of the United States of America 101(Suppl. 1), 5220–5227 (2004)
Nallapati, R.M., et al.: Joint latent topic models for text and citations. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2008)
Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. The Journal of Machine Learning Research 3, 993–1022 (2003)
Qi, G.-J., Aggarwal, C.C., Huang, T.: Community detection with edge content in social media networks. In: 2012 IEEE 28th International Conference on Data Engineering (ICDE). IEEE (2012)
Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: Proceedings of the 22nd International Conference on World Wide Web. International World Wide Web Conferences Steering Committee (2013)
Leskovec, J., Mcauley, J.J.: Learning to discover social circles in ego networks. Advances in Neural Information Processing Systems (2012)
Ramasco, J.J., Mungan, M.: Inversion method for content-based networks. Physical Review E 77(3), 036122 (2008)
Vazquez, A.: Population stratification using a statistical model on hypergraphs. Physical Review EÂ 77(6), 066106 (2008)
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 1–38 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, F., Li, J., Li, F., Xu, M., Xu, R., He, X. (2015). Community Detection Based on Links and Node Features in Social Networks. In: He, X., Luo, S., Tao, D., Xu, C., Yang, J., Hasan, M.A. (eds) MultiMedia Modeling. MMM 2015. Lecture Notes in Computer Science, vol 8935. Springer, Cham. https://doi.org/10.1007/978-3-319-14445-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-14445-0_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14444-3
Online ISBN: 978-3-319-14445-0
eBook Packages: Computer ScienceComputer Science (R0)