Community Discovery Algorithm Based on Laplacian Matrix in Social Networks

Web media is generally acknowledged as "the fourth media" after the newspaper,broadcast and TV.And as Web 2.0 prevails over the internet,the web media has a form called "self-media",which means that every individual is a receiver,also it is a publisher and a forwarder at the same time.Therefore,online social networks have been formed.It has been shown that most of these networks exhibit strong modular nature(or community structure).In this paper,a community discovery algorithm is proposed based on Laplacian matrix,this algorithm convert a social network structure into Laplacian matrix,calculate its spectral and using the properties to discover the community structure from the social network.A lot of experiments have been done on real word dataset,and the experimental results show that the algorithm can discover the community structure effectively.