Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering

Abstract

We propose a new algorithm to detect the community structure in a network that utilizes both the network structure and vertex attribute data. Suppose we have the network structure together with the vertex attribute data, that is, the information assigned to each vertex associated with the community to which it belongs. The problem addressed this paper is the detection of the community structure from the information of both the network structure and the vertex attribute data. Our approach is based on the Bayesian approach that models the posterior probability distribution of the community labels. The detection of the community structure in our method is achieved by using belief propagation and an EM algorithm. We numerically verified the performance of our method using computer-generated networks and real-world networks.

arXiv comment23 pages, 9 figures

References in corpus (17)

• Emergence of scaling in random networks
• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Finding community structure in very large networks
• Fast algorithm for detecting community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• Statistical Mechanics of Community Detection
• Stochastic blockmodels and community structure in networks
• Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
• Detecting fuzzy community structures in complex networks with a Potts model
• Community Detection in Networks with Node Attributes
• Phase transition in the detection of modules in sparse networks
• Community Detection as an Inference Problem
• Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models
• Model Selection for Degree-corrected Block Models