A vertex similarity probability model for finding network community structure

Kan Li*, Yin Pang

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

7 引用 (Scopus)

摘要

Most methods for finding community structure are based on the prior knowledge of network structure type. These methods grouped the communities only when known network is unipartite or bipartite. This paper presents a vertex similarity probability (VSP) model which can find community structure without priori knowledge of network structure type. Vertex similarity, which assumes that, for any type of network structures, vertices in the same community have similar properties. In the VSP model, "Common neighbor index" is used to measure the vertex similarity probability, as it has been proved to be an effective index for vertex similarity. We apply the algorithm to real-world network data. The results show that the VSP model is uniform for both unipartite networks and bipartite networks, and it is able to find the community structure successfully without the use of the network structure type.

源语言英语
主期刊名Advances in Knowledge Discovery and Data Mining - 16th Pacific-Asia Conference, PAKDD 2012, Proceedings
456-467
页数12
版本PART 1
DOI
出版状态已出版 - 2012
活动16th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2012 - Kuala Lumpur, 马来西亚
期限: 29 5月 20121 6月 2012

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
编号PART 1
7301 LNAI
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议16th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2012
国家/地区马来西亚
Kuala Lumpur
时期29/05/121/06/12

指纹

探究 'A vertex similarity probability model for finding network community structure' 的科研主题。它们共同构成独一无二的指纹。

引用此