123,893 research outputs found
Overlapping modularity at the critical point of k-clique percolation
One of the most remarkable social phenomena is the formation of communities
in social networks corresponding to families, friendship circles, work teams,
etc. Since people usually belong to several different communities at the same
time, the induced overlaps result in an extremely complicated web of the
communities themselves. Thus, uncovering the intricate community structure of
social networks is a non-trivial task with great potential for practical
applications, gaining a notable interest in the recent years. The Clique
Percolation Method (CPM) is one of the earliest overlapping community finding
methods, which was already used in the analysis of several different social
networks. In this approach the communities correspond to k-clique percolation
clusters, and the general heuristic for setting the parameters of the method is
to tune the system just below the critical point of k-clique percolation.
However, this rule is based on simple physical principles and its validity was
never subject to quantitative analysis. Here we examine the quality of the
partitioning in the vicinity of the critical point using recently introduced
overlapping modularity measures. According to our results on real social- and
other networks, the overlapping modularities show a maximum close to the
critical point, justifying the original criteria for the optimal parameter
settings.Comment: 20 pages, 6 figure
A New overlapping community detection algorithm based on similarity of neighbors in complex networks
summary:Community detection algorithms help us improve the management of complex networks and provide a clean sight of them. We can encounter complex networks in various fields such as social media, bioinformatics, recommendation systems, and search engines. As the definition of the community changes based on the problem considered, there is no algorithm that works universally for all kinds of data and network structures. Communities can be disjointed such that each member is in at most one community or overlapping such that every member is in at least one community. In this study, we examine the problem of finding overlapping communities in complex networks and propose a new algorithm based on the similarity of neighbors. This algorithm runs in running time in the complex network containing number of relationships. To compare our algorithm with existing ones, we select the most successful four algorithms from the Community Detection library (CDlib) by eliminating the algorithms that require prior knowledge, are unstable, and are time-consuming. We evaluate the successes of the proposed algorithm and the selected algorithms using various known metrics such as modularity, F-score, and Normalized Mutual Information. In addition, we adapt the coverage metric defined for disjoint communities to overlapping communities and also make comparisons with this metric. We also test all of the algorithms on small graphs of real communities. The experimental results show that the proposed algorithm is successful in finding overlapping communities
An Enhanced Multi-Objective Biogeography-Based Optimization Algorithm for Automatic Detection of Overlapping Communities in a Social Network with Node Attributes
Community detection is one of the most important and interesting issues in
social network analysis. In recent years, simultaneous considering of nodes'
attributes and topological structures of social networks in the process of
community detection has attracted the attentions of many scholars, and this
consideration has been recently used in some community detection methods to
increase their efficiencies and to enhance their performances in finding
meaningful and relevant communities. But the problem is that most of these
methods tend to find non-overlapping communities, while many real-world
networks include communities that often overlap to some extent. In order to
solve this problem, an evolutionary algorithm called MOBBO-OCD, which is based
on multi-objective biogeography-based optimization (BBO), is proposed in this
paper to automatically find overlapping communities in a social network with
node attributes with synchronously considering the density of connections and
the similarity of nodes' attributes in the network. In MOBBO-OCD, an extended
locus-based adjacency representation called OLAR is introduced to encode and
decode overlapping communities. Based on OLAR, a rank-based migration operator
along with a novel two-phase mutation strategy and a new double-point crossover
are used in the evolution process of MOBBO-OCD to effectively lead the
population into the evolution path. In order to assess the performance of
MOBBO-OCD, a new metric called alpha_SAEM is proposed in this paper, which is
able to evaluate the goodness of both overlapping and non-overlapping
partitions with considering the two aspects of node attributes and linkage
structure. Quantitative evaluations reveal that MOBBO-OCD achieves favorable
results which are quite superior to the results of 15 relevant community
detection algorithms in the literature
- …