A semantic overlapping community detecting algorithm in social networks based on random walk

被引：0

作者：

Xin, Yu ^{[1
]}

Yang, Jing ^{[1
]}

Xie, Zhiqiang ^{[2
]}

机构：

[1] College of Computer Science and Technology, Harbin Engineering University, Harbin

[2] College of Computer Science and Technology, Harbin University of Science and Technology, Harbin

来源：

Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2015年 / 52卷 / 02期

关键词：

Community detection; Latent Dirichlet allocation; Random walk; Semantic modularity; Semantic social network;

D O I：

10.7544/issn1000-1239.2015.20131246

中图分类号：

学科分类号：

摘要：

Since the semantic social networks (SSN) is a new kind of complex networks, the community detection is a new investigation relevant to the traditional community detection research. To solve this problem, an overlapping community structure detecting method in semantic social network is proposed based on the random walk strategy. The algorithm establishes the semantic space using latent Dirichlet allocation (LDA) method. Firstly, the quantization mapping is completed by which semantic information in nodes can be changed into the semantic space. Secondly, the semantic influence model and weighed adjacent matrix of SSN are established, with the entropy of nodes in SSN as the semantic information proportion, the distribution ratio of nodes as the weight of adjacent. Thirdly, an improved random walk strategy of community structure detecting in overlapping-SSN is proposed, with the distribution ratio of nodes as parameter, and a semantic modularity model is proposed by which the community structure of SSN can be measured. Finally, the efficiency and feasibility of the proposed algorithm and the semantic modularity are verified by experimental analysis. ©, 2015, Science Press. All right reserved.

引用

页码：499 / 511

页数：12

共 25 条

[1]

Girvan M., Newman M.E.J., Community structure in social and biological networks, Proceedings of National Academy of Science, 9, 12, pp. 7826-7921, (2002)

[2]

Newman M.E.J., Fast algorithm for detecting community structure in networks, Physical Review E, 69, 6, pp. 1-8, (2004)

[3]

Palla G., Derenyi I., Farkas I., Et al., Uncovering the overlapping community structures of complex networks in nature and society, Nature, 435, 7043, pp. 814-818, (2005)

[4]

Shen H., Cheng X., Cai K., Et al., Detect overlapping and hierarchical community structure in networks, Physica A, 388, 8, pp. 1706-1712, (2009)

[5]

Lancichinetti A., Fortunato S., Kertesz J., Detecting the overlapping and hierarchical community structure in complex networks, New Journal of Physics, 11, 3, pp. 1-8, (2009)

[6]

Gregory S., Finding overlapping communities in networks by label propagation, New Journal of Physics, 12, 10, pp. 1-9, (2010)

[7]

Jin D., Yang B., Baquero C., Et al., A Markov random walk under constraint for discovering overlapping communities in complex networks, Journal of Statistical Mechanics: Theory and Experiment, 8, 5, pp. 1-11, (2011)

[8]

Blei D.M., Ng A.Y., Jordan M.I., Latent Dirichlet allocation, Journal of Machine Learning Research, 21, 3, pp. 993-1022, (2003)

[9]

Zhang H., Qiu B., Giles C.L., Et al., An LDA-based community structure discovery approach for large-scale social networks, Proc of the 7th Conf on Intelligence and Security Informatics, pp. 200-207, (2007)

[10]

Kemp C., Tenenbaum J.B., Griffiths T.L., Et al., Learning systems of concepts with an infinite relational model, Proc of the 21st Association for the Advancement of Artificial Intelligence, pp. 5-13, (2006)

← 1 2 3 →