Next Article in Journal
Transformation-Based Fuzzy Rule Interpolation Using Interval Type-2 Fuzzy Sets
Next Article in Special Issue
Post-Processing Partitions to Identify Domains of Modularity Optimization
Previous Article in Journal
On the Lagged Diffusivity Method for the Solution of Nonlinear Finite Difference Systems
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(3), 90; https://doi.org/10.3390/a10030090

Local Community Detection Based on Small Cliques

Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Kaiserstr. 12, 76131 Karlsruhe, Germany
*
Author to whom correspondence should be addressed.
Received: 21 June 2017 / Revised: 3 August 2017 / Accepted: 4 August 2017 / Published: 11 August 2017
(This article belongs to the Special Issue Algorithms for Community Detection in Complex Networks)
View Full-Text   |   Download PDF [464 KB, uploaded 14 August 2017]   |  

Abstract

Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a single community is required. Further, many overlapping community detection algorithms use local community detection algorithms as basic building block. We provide a broad comparison of different existing strategies of expanding a seed node greedily into a community. For this, we conduct an extensive experimental evaluation both on synthetic benchmark graphs as well as real world networks. We show that results both on synthetic as well as real-world networks can be significantly improved by starting from the largest clique in the neighborhood of the seed node. Further, our experiments indicate that algorithms using scores based on triangles outperform other algorithms in most cases. We provide theoretical descriptions as well as open source implementations of all algorithms used. View Full-Text
Keywords: community detection; local community; clique; iterative expansion community detection; local community; clique; iterative expansion
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Hamann, M.; Röhrs, E.; Wagner, D. Local Community Detection Based on Small Cliques. Algorithms 2017, 10, 90.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top