A Graph Clustering Algorithm Based on Shared Neighbors and Connectivity

被引：0

作者：

Zhang Huijuan ^{[1
]}

Sun Shixuan ^{[1
]}

机构：

[1] Tongji Univ, Sch Software Engn, Shanghai 200092, Peoples R China

来源：

PROCEEDINGS OF THE 2013 8TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION (ICCSE 2013) | 2013年

关键词：

Graph Clustering; Clusters; Shared Neighbors; Connectivity;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Graph Clustering algorithm is useful to detect clusters in a graph. However, the existing algorithms are mainly focus on connectivity or attributes of vertices. In this paper, we propose a new algorithm called SNGC that both consider shared neighbors and connectivity between vertices. Furthermore, we implement this algorithm and test it in several experiments. The results show that the performance of SNGC algorithm is pretty well.

引用

页码：761 / 764

页数：4

共 11 条

[1]

[Anonymous], 2003, Internet Mathematics, DOI [10.1080/15427951.2004.10129093, DOI 10.1080/15427951.2004.10129093]

[2]

[Anonymous], 1999, Small Worlds

[3]

[Anonymous], DATA MINING

[4]

[Anonymous], 2000, GRAPH CLUSTERING FLO

[5]

Brandes U, 2003, LECT NOTES COMPUT SC, V2832, P568

[6]

Edachery J, 1999, LECT NOTES COMPUT SC, V1731, P98

[7] A clustering algorithm based on graph connectivity [J].

Hartuv, E ;

Shamir, R .

INFORMATION PROCESSING LETTERS, 2000, 76 (4-6) :175-181

[8] Detecting community structure in networks [J].

Newman, MEJ .

EUROPEAN PHYSICAL JOURNAL B, 2004, 38 (02) :321-330

[9] Graph clustering [J].

Schaeffer, Satu Elisa .

COMPUTER SCIENCE REVIEW, 2007, 1 (01) :27-64

[10]

Schaeffer SE, 2005, LECT NOTES ARTIF INT, V3518, P354

← 1 2 →