The interest community mining method of social network based on the weak association rules

The development of Internet and the appearance of the Web2.0 have dramatically changed the communication habits of the people. The network communications based on social relationships and interests are more and more popular. It has great significance for dissemination and utilization of information to research the community structure formed by the user group who uses these communication modes. In this paper, we use a method based on the improvement of the association rules to divide the interest community on the community structure. The experimental results show that the algorithm has high accuracy and can provide the technical foundation for the better use of the social network.

[1]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Shi Jin-long,et al.  New Progress on Community Detection in Complex Networks , 2011 .

[3]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[4]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..