A Heuristic Algorithm for Bipartite Community Detection in Social Networks

Analysis on topological characteristics of the network, such as the vertex degree distribution, centrality and community structure, provides valuable insight into the structure and function of the interacting data entities. Community detection is one of the key problems in the field of social network analysis. In the paper, the authors mainly focus on the two-part division problem for network, i.e., community (or graph) partitioning. Based on the in-depth analysis on the community features of some known partitioning results, a three-stage heuristic algorithm named 3SHP is proposed.

Provided by: Academy Publisher Topic: Security Date Added: Jan 2012 Format: PDF

Find By Topic