64,765 research outputs found
Link-Prediction Enhanced Consensus Clustering for Complex Networks
Many real networks that are inferred or collected 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-community edges are missing. We propose a
novel consensus clustering algorithm to enhance community detection on
incomplete networks. Our framework utilizes existing community detection
algorithms that process networks imputed by our link prediction based
algorithm. The framework then merges their multiple outputs into a final
consensus output. On average our method boosts performance of existing
algorithms by 7% on artificial data and 17% on ego networks collected from
Facebook
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most
real-world complex networks, play an important role in many contexts. Most
existing community detection algorithms produce a hierarchical structure of
community and seek a partition into communities that optimizes a given quality
function. We propose new methods to improve the results of any of these
algorithms. First we show how to optimize a general class of additive quality
functions (containing the modularity, the performance, and a new similarity
based quality function we propose) over a larger set of partitions than the
classical methods. Moreover, we define new multi-scale quality functions which
make it possible to detect the different scales at which meaningful community
structures appear, while classical approaches find only one partition.Comment: 12 Pages, 4 figure
Community detection based on "clumpiness" matrix in complex networks
The "clumpiness" matrix of a network is used to develop a method to identify
its community structure. A "projection space" is constructed from the
eigenvectors of the clumpiness matrix and a border line is defined using some
kind of angular distance in this space. The community structure of the network
is identified using this borderline and/or hierarchical clustering methods. The
performance of our algorithm is tested on some computer-generated and
real-world networks. The accuracy of the results is checked using normalized
mutual information. The effect of community size heterogeneity on the accuracy
of the method is also discussed.Comment: 18 pages and 13 figure
Semi-Supervised Overlapping Community Finding based on Label Propagation with Pairwise Constraints
Algorithms for detecting communities in complex networks are generally
unsupervised, relying solely on the structure of the network. However, these
methods can often fail to uncover meaningful groupings that reflect the
underlying communities in the data, particularly when those structures are
highly overlapping. One way to improve the usefulness of these algorithms is by
incorporating additional background information, which can be used as a source
of constraints to direct the community detection process. In this work, we
explore the potential of semi-supervised strategies to improve algorithms for
finding overlapping communities in networks. Specifically, we propose a new
method, based on label propagation, for finding communities using a limited
number of pairwise constraints. Evaluations on synthetic and real-world
datasets demonstrate the potential of this approach for uncovering meaningful
community structures in cases where each node can potentially belong to more
than one community.Comment: Fix table
Network Community Detection On Small Quantum Computers
In recent years a number of quantum computing devices with small numbers of
qubits became available. We present a hybrid quantum local search (QLS)
approach that combines a classical machine and a small quantum device to solve
problems of practical size. The proposed approach is applied to the network
community detection problem. QLS is hardware-agnostic and easily extendable to
new quantum computing devices as they become available. We demonstrate it to
solve the 2-community detection problem on graphs of size up to 410 vertices
using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their
performance with the optimal solutions. Our results demonstrate that QLS
perform similarly in terms of quality of the solution and the number of
iterations to convergence on both types of quantum computers and it is capable
of achieving results comparable to state-of-the-art solvers in terms of quality
of the solution including reaching the optimal solutions
- …