loading
Papers

Research.Publish.Connect.

Paper

Authors: Camila Tautenhain and Mariá Nascimento

Affiliation: Instituto de Ciência e Tecnologia, Universidade Federal de São Paulo, São José dos Campos, Brasil

ISBN: 978-989-758-350-6

Keyword(s): Overlapping Community Detection, Modularity Maximization, Spectral Method, Social Network Analysis.

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 the 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)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.85.245.126

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Tautenhain, C. and Nascimento, M. (2019). Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-350-6, pages 306-317. DOI: 10.5220/0007403803060317

@conference{icaart19,
author={Camila P. S. Tautenhain. and Mariá C. V. Nascimento.},
title={Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2019},
pages={306-317},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007403803060317},
isbn={978-989-758-350-6},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks
SN - 978-989-758-350-6
AU - Tautenhain, C.
AU - Nascimento, M.
PY - 2019
SP - 306
EP - 317
DO - 10.5220/0007403803060317

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.