Granular-Ball-Induced Multiple Kernel K-Means
Shuyin Xia, Yifan Wang, Lifeng Shen, Guoyin Wang

TL;DR
This paper introduces a novel granular-ball based multi-kernel clustering method that enhances computational efficiency and robustness, especially in complex and high-dimensional data scenarios, outperforming existing algorithms.
Contribution
It proposes the granular-ball kernel and a multi-kernel K-means framework that leverage granular-ball representations for improved clustering efficiency and robustness.
Findings
Outperforms traditional multi-kernel K-means in efficiency
Demonstrates superior clustering accuracy on various datasets
Shows robustness to noise and complex data distributions
Abstract
Most existing multi-kernel clustering algorithms, such as multi-kernel K-means, often struggle with computational efficiency and robustness when faced with complex data distributions. These challenges stem from their dependence on point-to-point relationships for optimization, which can lead to difficulty in accurately capturing data sets' inherent structure and diversity. Additionally, the intricate interplay between multiple kernels in such algorithms can further exacerbate these issues, effectively impacting their ability to cluster data points in high-dimensional spaces. In this paper, we leverage granular-ball computing to improve the multi-kernel clustering framework. The core of granular-ball computing is to adaptively fit data distribution by balls from coarse to acceptable levels. Each ball can enclose data points based on a density consistency measurement. Such ball-based data…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
