C-Affinity: A Novel Similarity Measure for Effective Data Clustering
Open Access
- 30 April 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 41-44
Abstract
Clustering is widely employed in various applications as it is one of the most useful data mining techniques. In performing clustering, a similarity measure, which defines how similar a pair of data objects are, plays an important role. A similarity measure is employed by considering a target dataset’s characteristics. Current similarity measures (or distances) do not reflect the distribution of data objects in a dataset at all. From the clustering point of view, this fact may limit the clustering accuracy. In this paper, we propose c-affinity, a new notion of a similarity measure that reflects the distribution of objects in the given dataset from a clustering point of view. We design c-affinity between any two objects to have a higher value as they are more likely to belong to the same cluster by learning the data distribution. We use random walk with restart (RWR) on the k-nearest neighbor graph of the given dataset to measure (1) how similar a pair of objects are and (2) how densely other objects are distributed between them. Via extensive experiments on sixteen synthetic and real-world datasets, we verify that replacing the existing similarity measure with our c-affinity improves the clustering accuracy significantly.Keywords
This publication has 9 references indexed in Scilit:
- Fast and general density peaks clusteringPattern Recognition Letters, 2019
- K-means properties on six clustering benchmark datasetsApplied Intelligence, 2018
- A Comparative Study on Distance Measuring Approaches for ClusteringInternational Journal of Research in Computer Science, 2011
- Density‐based clusteringWIREs Data Mining and Knowledge Discovery, 2011
- Fast Random Walk with Restart and Its ApplicationsIEEE International Conference on Data Mining (ICDM), 2006
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- When Is “Nearest Neighbor” Meaningful?1999
- Chameleon: hierarchical clustering using dynamic modelingComputer, 1999
- On Nearest-Neighbor GraphsDiscrete & Computational Geometry, 1997