会议专题

An Improved Spectral Clustering Algorithm for Community Discovery

For discovering communities in social network, an improved spectral clustering method is presented in this paper. To make full use of the network feature, the core members are used in this method for mining communities. This goal has been achieved through the Page Rank method, which is common in directed graphs, for the reason that an undirected graph can be treated as the special case of the corresponding directed one. Following that, they can be used for initialization in the spectral clustering to avoid the sensitivity to the initial centroids. Applied to four datasets, the improved method turns out to be better than the traditional spectral clustering methods, whether in time or in accuracy aspect.

community discovery spectral clustering core member Page Rank

Shuzi Niu Daling Wang Shi Feng Ge Yu

School of Information Science and Engineering, Northeastern University Shenyang, P.R.China Key Laboratory of Medical Image Computing (Northeastern University), Ministry of Education Shenyang,

国际会议

2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)

沈阳

英文

1-6

2009-08-12(万方平台首次上网日期,不代表论文的发表时间)