Rough Spectral Clustering Algorithm Applied to Overlapping Network Communities Discovery
Nanfeng Xiao · Journal of Chinese Computer Systems · 2012
Given the fact that the vast majority of Algorithms for communities discovery assume that one network node belongs to only one community,spectral graph theory and rough set theory are introduced into analysis of community structures in complex networks,an algorithm RSC,which is used in discovering overlapping communities,is proposed.The basic idea of RSC is to describe communities membership of network nodes with lower and upper approximation,describe the network nodes shared by different communities with boundary,and to mine overlapping network communities by optimizing overlapping community modularity.Experimental results on 3 real networks from different domains indicated feasibility and validity of our approach.