Authors:
Camila P. S. Tautenhain
and
Mariá C. V. Nascimento
Affiliation:
Instituto de Ciência e Tecnologia, Universidade Federal de São Paulo, São José dos Campos and Brasil
Keyword(s):
Overlapping Community Detection, Modularity Maximization, Spectral Method, Social Network Analysis.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Computational Intelligence
;
Enterprise Information Systems
;
Evolutionary Computing
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Machine Learning
;
Soft Computing
;
Symbolic Systems
Abstract:
A great deal of community detection communities is based on the maximization of the measure known as modularity. There is a dearth of literature on overlapping community detection algorithms, in spite of the importance of the applications and the overwhelming number of community detection algorithms yet proposed. To this end, one of the suggestions in the literature consists of partitioning the set of edges into communities, also known as link partitions, by applying community detection algorithms to line graphs. In line with this, in this paper, overlapping vertex communities are obtained from link partitions by a method that selects the communities of the edges that represent the highest modularity gain. We also introduce a spectral algorithm to find link partitions from line graphs. We show that the modularity of communities in line graphs is equivalent to the adaptation of modularity of communities in the original graphs, when considering the non-backtracking matrix instead of th
e adjacency matrix in its formula. The results of the experiments carried out with overlapping community detection algorithms showed that the proposed method is competitive with state-of-the-art algorithms.
(More)