9,758 research outputs found
Local Edge Betweenness based Label Propagation for Community Detection in Complex Networks
Nowadays, identification and detection community structures in complex
networks is an important factor in extracting useful information from networks.
Label propagation algorithm with near linear-time complexity is one of the most
popular methods for detecting community structures, yet its uncertainty and
randomness is a defective factor. Merging LPA with other community detection
metrics would improve its accuracy and reduce instability of LPA. Considering
this point, in this paper we tried to use edge betweenness centrality to
improve LPA performance. On the other hand, calculating edge betweenness
centrality is expensive, so as an alternative metric, we try to use local edge
betweenness and present LPA-LEB (Label Propagation Algorithm Local Edge
Betweenness). Experimental results on both real-world and benchmark networks
show that LPA-LEB possesses higher accuracy and stability than LPA when
detecting community structures in networks.Comment: 6 page
Enhancing community detection using a network weighting strategy
A community within a network is a group of vertices densely connected to each
other but less connected to the vertices outside. The problem of detecting
communities in large networks plays a key role in a wide range of research
areas, e.g. Computer Science, Biology and Sociology. Most of the existing
algorithms to find communities count on the topological features of the network
and often do not scale well on large, real-life instances.
In this article we propose a strategy to enhance existing community detection
algorithms by adding a pre-processing step in which edges are weighted
according to their centrality w.r.t. the network topology. In our approach, the
centrality of an edge reflects its contribute to making arbitrary graph
tranversals, i.e., spreading messages over the network, as short as possible.
Our strategy is able to effectively complements information about network
topology and it can be used as an additional tool to enhance community
detection. The computation of edge centralities is carried out by performing
multiple random walks of bounded length on the network. Our method makes the
computation of edge centralities feasible also on large-scale networks. It has
been tested in conjunction with three state-of-the-art community detection
algorithms, namely the Louvain method, COPRA and OSLOM. Experimental results
show that our method raises the accuracy of existing algorithms both on
synthetic and real-life datasets.Comment: 28 pages, 2 figure
DEMON: a Local-First Discovery Method for Overlapping Communities
Community discovery in complex networks is an interesting problem with a
number of applications, especially in the knowledge extraction task in social
and information networks. However, many large networks often lack a particular
community organization at a global level. In these cases, traditional graph
partitioning algorithms fail to let the latent knowledge embedded in modular
structure emerge, because they impose a top-down global view of a network. We
propose here a simple local-first approach to community discovery, able to
unveil the modular organization of real complex networks. This is achieved by
democratically letting each node vote for the communities it sees surrounding
it in its limited view of the global system, i.e. its ego neighborhood, using a
label propagation algorithm; finally, the local communities are merged into a
global collection. We tested this intuition against the state-of-the-art
overlapping and non-overlapping community discovery methods, and found that our
new method clearly outperforms the others in the quality of the obtained
communities, evaluated by using the extracted communities to predict the
metadata about the nodes of several real world networks. We also show how our
method is deterministic, fully incremental, and has a limited time complexity,
so that it can be used on web-scale real networks.Comment: 9 pages; Proceedings of the 18th ACM SIGKDD International Conference
on Knowledge Discovery and Data Mining, Beijing, China, August 12-16, 201
Community detection by label propagation with compression of flow
The label propagation algorithm (LPA) has been proved to be a fast and
effective method for detecting communities in large complex networks. However,
its performance is subject to the non-stable and trivial solutions of the
problem. In this paper, we propose a modified label propagation algorithm LPAf
to efficiently detect community structures in networks. Instead of the majority
voting rule of the basic LPA, LPAf updates the label of a node by considering
the compression of a description of random walks on a network. A multi-step
greedy agglomerative strategy is employed to enable LPAf to escape the local
optimum. Furthermore, an incomplete update condition is also adopted to speed
up the convergence. Experimental results on both synthetic and real-world
networks confirm the effectiveness of our algorithm
- …