A fast chromatic correlation clustering algorithm

Gothania, Jaishri; Buksh, Bala

doi:10.1109/icacci.2016.7732322

Cited by 1 publication

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem arises when the pivot edge chosen does not belong to the desired optimum solution. The Informed Chromatic Balls (ICB) by Gothania and Balabuksh [16] gives definition of good edge and bad edge in this respect. Good edge has more chances of being a part of an optimal solution and hence more probability of being chosen as pivot.…”

Section: Chromatic Corelation Clusteringmentioning

confidence: 99%

Performance Metrics for Chromatic Correlation Clustering for Social Network Analysis

Gothania¹,

Rathore²

2019

RIA

Self Cite

View full text Add to dashboard Cite

The social network can be viewed as a chromatic graph of relations and entities. Thus, the community discovery in social network is essentially a problem of chromatic correlation clustering. This paper aims to develop metrics to measure the performance of community discovery algorithms in view of nonoverlapping strong communities. Three performance metrics, namely, chromatic density (CD), chromatic cut ratio (CCR) and chromatic conductance (CC), were proposed for thorough analysis on the output quality of chromatic clustering algorithms. In addition, synthetic graph generator was developed to generate sparse networks with few dense and strong communities. Five algorithms for chromatic correlation clustering, i.e. CB, ICB, LCB, OCB and RECB, were evaluated by the proposed metrics. The evaluation shows that the RECB is the most suitable algorithm for the discovery of strong communities in social network. The research results shed important new light on the detection of communities in social network.

show abstract

Section: Chromatic Corelation Clusteringmentioning

confidence: 99%