Distributed Inference of Overlapping Communities
نویسندگان
چکیده
Overlapping community detection plays a key role in statistical network modeling. Despite the importance, popular models such as mixed membership stochastic blockmodels (MMSB) [2] are often not applicable to real world massive networks due to limited speed and memory of a single computing node. In this project, we develop distributed inference for models that can discover overlapping communities in real networks. Specifically, we address three key challenges in distributed network inference: 1) reduce O(N) pairwise parameters to O(N) by choosing constrained variational formulation described in [7]; 2) minimize communication cost between processes using a vertex-cut algorithm to partition the network; 3) synchronize global states between processes via a protocol designed for continuous aggregation and synchronization. Experimental results demonstrate our ability to tackle large scale network inference tasks.
منابع مشابه
Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملIdentifying overlapping communities using multi-agent collective intelligence
The proposed algorithm in this research is based on the multi-agent particle swarm optimization as a collective intelligence due to the connection between several simple components which enables them to regulate their behavior and relationships with the rest of the group according to certain rules. As a result, self-organizing in collective activities can be seen. Community structure is crucial...
متن کاملScalable Inference of Overlapping Communities
We develop a scalable algorithm for posterior inference of overlapping communities in large networks. Our algorithm is based on stochastic variational inference in the mixed-membership stochastic blockmodel (MMSB). It naturally interleaves subsampling the network with estimating its community structure. We apply our algorithm on ten large, real-world networks with up to 60,000 nodes. It converg...
متن کامل