Link-Prediction Enhanced Consensus Clustering for Complex Networks

@article{Burgess2016LinkPredictionEC,
  title={Link-Prediction Enhanced Consensus Clustering for Complex Networks},
  author={Matthew Burgess and Eytan Adar and Michael J. Cafarella},
  journal={PLoS ONE},
  year={2016},
  volume={11}
}
Many real networks that are collected or inferred from data are incomplete due to missing edges. Missing edges can be inherent to the dataset (Facebook friend links will never be complete) or the result of sampling (one may only have access to a portion of the data). The consequence is that downstream analyses that “consume” the network will often yield less accurate results than if the edges were complete. Community detection algorithms, in particular, often suffer when critical intra… 
Improving Network Community Structure with Link Prediction Ranking
TLDR
Experimental results show that applying the approach to different networks can significantly refine community structure and observe that performance of link prediction ranking is correlated with certain network properties, such as the network size or average node degree.
A joint optimization framework for better community detection based on link prediction in social networks
TLDR
A joint optimization framework, Communities detected on Predicted Edges, is proposed to improve the quality of community detection through learning the probabilities of unseen links and the probability of community affiliation of nodes simultaneously.
Improving the Accuracy of Link Prediction Using Consensus Clustering
  • Tao Liu, Lintao Yang, Shouyin Liu
  • Computer Science
    2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
  • 2017
TLDR
This paper uses the clustering ensemble to improve the accuracy of link prediction in complex network based on the assumption that the more nodes grouped together by community detection algorithms, the more similar they are.
Enriching networks with edge insertion to improve community detection
TLDR
This work proposes a set of link prediction heuristics using different network properties to estimate a more complete version of the network and improve the community detection algorithms.
Extracting Community Structure in Multi-relational Network via DeepWalk and Consensus Clustering
TLDR
A novel approach to extract the communities in a multi-relational network using DeepWalk network embedding technique and Consensus clustering is proposed and it is found that the proposed model performs significantly better than some of the baseline approaches based on spectral clustering algorithm, modularity maximization, block clustering and non-negative matrix factorization.
Edge Proposal Sets for Link Prediction
TLDR
It is demonstrated how simply adding a set of edges, which is called a proposal set, to the graph as a pre-processing step can improve the performance of several link prediction algorithms.
Ensemble-based community detection in multilayer networks
TLDR
A novel modularity-driven ensemble-based approach to multilayer community detection that finds consensus community structures that not only capture prototypical community memberships of nodes, but also preserve the multilayers topology information and optimize the edge connectivity in the consensus via modularity analysis is proposed.
Community detection by enhancing community structure in bipartite networks
TLDR
In this paper, a community detection algorithm, called ECD, is proposed that enhances community structure in bipartite networks by reducing unnecessary edges that are connected to neighboring low-weight communities.
A new community detection algorithm based on adding and deleting links
TLDR
A non-overlapping algorithm based on link prediction to add and delete the network links automatically (ADL) is proposed in this paper and exhibits stable and efficient features.
...
1
2
3
4
...

References

SHOWING 1-10 OF 67 REFERENCES
Similarity index based on local paths for link prediction of complex networks.
TLDR
A local path index to estimate the likelihood of the existence of a link between two nodes, and a network model with controllable density and noise strength in generating links, as well as collect data of six real networks.
Link Prediction in Complex Networks: A Survey
Significant Communities in Large Sparse Networks
TLDR
This work proposes a simple method to perturb sparse networks and assess the significance of their communities, and uses its significance analysis to draw a map of the ECJ case law network that reveals the relations between the areas of law.
Consensus clustering in complex networks
TLDR
It is shown that consensus clustering can be combined with any existing method in a self-consistent way, enhancing considerably both the stability and the accuracy of the resulting partitions.
Exploring the limits of community detection strategies in complex networks
TLDR
It is shown that none of the community detection algorithms tested provide consistently optimal results in all networks and that Surprise maximization, obtained by combining multiple algorithms, obtains quasi-optimal performances in these difficult benchmarks.
Near linear time algorithm to detect community structures in large-scale networks.
TLDR
This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Benchmark graphs for testing community detection algorithms.
TLDR
This work introduces a class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes, and uses this benchmark to test two popular methods of community detection, modularity optimization, and Potts model clustering.
Fast unfolding of communities in large networks
TLDR
This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Detecting communities using asymptotical Surprise
TLDR
An accurate asymptotic approximation of surprise is developed, which allows for the development of an efficient algorithm for optimizing surprise, and shows that surprise is (nearly) unaffected by the well-known resolution limit, a particular problem for modularity.
...
1
2
3
4
5
...