Partitioning Breaks Communities

@article{Reid2011PartitioningBC,
  title={Partitioning Breaks Communities},
  author={Fergal Reid and Aaron F. McDaid and Neil J. Hurley},
  journal={2011 International Conference on Advances in Social Networks Analysis and Mining},
  year={2011},
  pages={102-109}
}
Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping communities. We show that on a wide range of empirical networks, from different domains, significant numbers of cliques are split across separate partitions, as produced by such algorithms. We examine the largest connected component of the sub graph formed by… 

Figures and Tables from this paper

Percolation Computation in Complex Networks

Improvements are presented to this algorithm, which allow it to perform k-clique percolation on much larger empirical datasets, and perform much better than existing algorithms on networks exhibiting pervasively overlapping community structure.

Novel Clique enumeration heuristic for detecting overlapping clusters

The analyses showed that the novel heuristic is competitive with other known methods regarding solution quality and the CPM is more scalable, making its use impractical in large real-world networks and applications.

A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection

A maximal clique based multiobjective evolutionary algorithm (MOEA) for overlapping community detection that could detect overlapping community structure with higher partition accuracy and lower computational cost when compared with the existing ones is proposed.

Engineering Overlapping Community Detection based on the Ego-Splitting Framework

The improved version of the ego-splitting framework is able to detect communities of high quality in overlapping networks, and outperforms the state-of-the-art algorithms OSLOM and MOSES in both quality and running time.

Improving PageRank for Local Community Detection

This paper proposes some simple yet efficient versions of the PageRank algorithm as well as a novel algorithm, called WalkSCAN, that is able to detect multiple communities, possibly overlapping, and provides insights into the performance of these algorithms through the theoretical analysis of a toy network.

A Multilevel Approach for Overlapping Community Detection

The goal is to analyze the time impact and the quality of solution of the multilevel strategy regarding to traditional algorithms and show that the proposal consistently produces good performance compared to single-level algorithms and in less time.

Multiple Communities of Ego in Social Networks

This work proposes a new algorithm merging multiple communities around each ego nodes designed for detecting highly overlapping communities at small size and shows that it overcomes previous issues of overlapping community detection.

Multiple Local Community Detection

This paper introduces a new algorithm for detecting multiple local communities, possibly overlapping, by expanding the initial seed set, and shows that it provides more information than existing algorithms to recover the complex graph structure that appears locally.

Novel Approaches to the Clustering of Large Graphs. (Nouvelles approches pour le partitionnement de grands graphes)

Alternative approaches and novel algorithms to address different problems of graph clustering are studied, inspired by variants of modularity, a classic measure that accesses the quality of a node partition, and by random walks, stochastic processes whose properties are closely related to the graph structure.

References

SHOWING 1-10 OF 37 REFERENCES

Detecting highly overlapping community structure by greedy clique expansion

GCE is the only algorithm to perform well on these synthetic graphs, in which every node belongs to multiple communities, and when put to the task of identifying functional modules in protein interaction data, and college dorm assignments in Facebook friendship data, the algorithm performs competitively.

Line graphs, link partitions, and overlapping communities.

  • T. EvansR. Lambiotte
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
The role of the degree heterogeneity is discussed and a weighted version of the line graph is proposed in order to account for this and it is shown that any algorithm that produces a partition of nodes can be used to produce a partitions of links.

Clique graphs and overlapping communities

A benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail, and how a clique graph may be exploited.

Finding Statistically Significant Communities in Networks

OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented.

Statistical properties of community structure in large social and information networks

It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined.

Detecting community structure in networks

A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.

Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.

The basic ideas behind the previous benchmark are extended to generate directed and weighted networks with built-in community structure, and the possibility that nodes belong to more communities is considered, a feature occurring in real systems, such as social networks.

Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion

  • Aaron F. McDaidN. Hurley
  • Computer Science
    2010 International Conference on Advances in Social Networks Analysis and Mining
  • 2010
This paper presents a scalable algorithm, MOSES, based on a statistical model of community structure, which is capable of detecting highly overlappingcommunity structure, especially when there is variance in the number of communities each node is in.

Link communities reveal multiscale complexity in networks

It is implied that link communities are fundamental building blocks that reveal overlap and hierarchical organization in networks to be two aspects of the same phenomenon.