TL;DR
RECOME is a novel density-based clustering algorithm that uses a new relative KNN kernel density measure to effectively identify and merge clusters of various shapes, densities, and scales, with an efficient method for parameter tuning.
Contribution
The paper introduces RECOME, a new clustering algorithm based on a novel density measure and a fast method for detecting key parameter values, improving cluster detection and parameter selection.
Findings
RECOME effectively discovers clusters of different shapes, densities, and scales.
RECOME outperforms six baseline methods on synthetic and real datasets.
FJDD efficiently identifies jump discontinuities in the parameter, aiding data exploration.
Abstract
Discovering clusters from a dataset with different shapes, densities, and scales is a known challenging problem in data clustering. In this paper, we propose the RElative COre MErge (RECOME) clustering algorithm. The core of RECOME is a novel density measure, i.e., Relative nearest Neighbor Kernel Density (RNKD). RECOME identifies core objects with unit RNKD, and {partitions} non-core objects into atom clusters by successively following higher-density neighbor relations toward core objects. Core objects and their corresponding atom clusters are then merged through -reachable paths on a KNN graph. We discover that the number of clusters computed by RECOME is a step function of the parameter with jump discontinuity on a small collection of values. A fast jump discontinuity discovery (FJDD) method is proposed based on graph theory. RECOME is evaluated on both synthetic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
