期刊
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
卷 27, 期 6, 页码 1261-1268出版社
SCIENCE PRESS
DOI: 10.1007/s11390-012-1302-4
关键词
social network analysis; community detection; link similarity
资金
- National Natural Science Foundation of China [61170193]
- Ministry of Education of China [20090172120035]
- Natural Science Foundation of Guangdong Province of China [S2012010010613]
- Fundamental Research Funds for the Central Universities of South China University of Technology of China [2012ZM0087]
- Pearl River Science & Technology Start Project of China [2012J2200007]
Exploring local community structure is an appealing problem that has drawn much recent attention in the area of social network analysis. As the complete information of network is often difficult to obtain, such as networks of web pages, research papers and Facebook users, people can only detect community structure from a certain source vertex with limited knowledge of the entire graph. The existing approaches do well in measuring the community quality, but they are largely dependent on source vertex and putting too strict policy in agglomerating new vertices. Moreover, they have predefined parameters which are difficult to obtain. This paper proposes a method to find local community structure by analyzing link similarity between the community and the vertex. Inspired by the fact that elements in the same community are more likely to share common links, we explore community structure heuristically by giving priority to vertices which have a high link similarity with the community. A three-phase process is also used for the sake of improving quality of community structure. Experimental results prove that our method performs effectively not only in computer-generated graphs but also in real-world graphs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据