Generic placeholder image

Recent Advances in Computer Science and Communications

Editor-in-Chief

ISSN (Print): 2666-2558
ISSN (Online): 2666-2566

Research Article

Discovering Strong Communities in Social Networks Through Chromatic Correlation Clustering

Author(s): Jaishri Gothania* and Shashi K. Rathore

Volume 14, Issue 5, 2021

Published on: 23 September, 2019

Page: [1520 - 1526] Pages: 7

DOI: 10.2174/2666255813666190923101910

Price: $65

Abstract

Background: Complex systems involved in biochemistry, neuroscience, physics, engineering and social science are primarily studied and modeled through network structures. The connectivity patterns within these interaction networks are discovered through clustering-like techniques. Community discovery is a related problem to find patterns in networks.

Objectives: Existing algorithms either try to find few large communities in networks; or try to partition network into small strongly connected communities; that too is time consuming and parameterdependant.

Methods/Results: This paper proposes a chromatic correlation clustering method to discover small strong communities in an interaction network in heuristic manner to have low time complexity and a parameter free method. Comparison with other methods over synthetic data is done.

Conclusion: Interaction networks are very large, sparse containing few small dense communities that can be discovered only through method specifically designed for the purpose.

Keywords: chromatic balls, correlation clustering, community detection, community discovery, strong communities, social networks.

Graphical Abstract


Rights & Permissions Print Cite
© 2024 Bentham Science Publishers | Privacy Policy