Granular-Ball-Induced Multiple Kernel K-Means

• URL: http://arxiv.org/abs/2506.18637v1
• Date: Mon, 23 Jun 2025 13:39:32 GMT
• Title: Granular-Ball-Induced Multiple Kernel K-Means
• Authors: Shuyin Xia, Yifan Wang, Lifeng Shen, Guoyin Wang,
• Abstract summary: We introduce granular-ball kernel (GBK) and its corresponding granular-ball multi- kernel K-means framework (GB-MKKM) for efficient clustering.<n>Using granular-ball relationships in multiple kernel spaces, the proposed GB-MKKM framework shows its superiority in efficiency and clustering performance.
• Score: 16.926958592442954
• License: http://creativecommons.org/licenses/by/4.0/
• 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 description thus improves the computational efficiency and the robustness to unknown noises. Specifically, based on granular-ball representations, we introduce the granular-ball kernel (GBK) and its corresponding granular-ball multi-kernel K-means framework (GB-MKKM) for efficient clustering. Using granular-ball relationships in multiple kernel spaces, the proposed GB-MKKM framework shows its superiority in efficiency and clustering performance in the empirical evaluation of various clustering tasks.

Related papers

• Unimodal Strategies in Density-Based Clustering [15.581610184349731]
  We reveal a key property intrinsic to density-based clustering methods regarding the relation between the number of clusters and the neighborhood radius of core points.<n>We leverage this property to devise new strategies for finding appropriate values for the radius more efficiently based on the Ternary Search algorithm.<n>We validate our methodology through extensive applications across a range of high-dimensional, large-scale NLP, Audio, and Computer Vision tasks.
  arXiv  Detail & Related papers  (2025-06-26T18:25:14Z)
• Graph Probability Aggregation Clustering [5.377020739388736]
  We propose a graph-based fuzzy clustering algorithm that unifies the global clustering objective function with a local clustering constraint.<n>The entire GPAC framework is formulated as a multi-constrained optimization problem, which can be solved using the Lagrangian method.<n>Experiments conducted on synthetic, real-world, and deep learning datasets demonstrate that GPAC not only exceeds existing state-of-the-art methods in clustering performance but also excels in computational efficiency.
  arXiv  Detail & Related papers  (2025-02-27T09:11:32Z)
• GBFRS: Robust Fuzzy Rough Sets via Granular-ball Computing [48.33779268699777]
  Fuzzy rough set theory is effective for processing datasets with complex attributes.<n>Most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise.<n>This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points.
  arXiv  Detail & Related papers  (2025-01-30T15:09:26Z)
• GBCT: An Efficient and Adaptive Granular-Ball Clustering Algorithm for Complex Data [49.56145012222276]
  We propose a new clustering algorithm called granular-ball clustering (GBCT) via granular-ball computing. GBCT forms clusters according to the relationship between granular-balls, instead of the traditional point relationship. As granular-balls can fit various complex data, GBCT performs much better in non-spherical data sets than other traditional clustering methods.
  arXiv  Detail & Related papers  (2024-10-17T07:32:05Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• Fuzzy K-Means Clustering without Cluster Centroids [21.256564324236333]
  Fuzzy K-Means clustering is a critical technique in unsupervised data analysis. This paper proposes a novel Fuzzy textitK-Means clustering algorithm that entirely eliminates the reliance on cluster centroids.
  arXiv  Detail & Related papers  (2024-04-07T12:25:03Z)
• Research on Efficient Fuzzy Clustering Method Based on Local Fuzzy Granular balls [67.33923111887933]
  In this paper, the data is fuzzy iterated using granular-balls, and the membership degree of data only considers the two granular-balls where it is located. The formed fuzzy granular-balls set can use more processing methods in the face of different data scenarios.
  arXiv  Detail & Related papers  (2023-03-07T01:52:55Z)
• GBMST: An Efficient Minimum Spanning Tree Clustering Based on Granular-Ball Computing [78.92205914422925]
  We propose a clustering algorithm that combines multi-granularity Granular-Ball and minimum spanning tree (MST) We construct coarsegrained granular-balls, and then use granular-balls and MST to implement the clustering method based on "large-scale priority" Experimental results on several data sets demonstrate the power of the algorithm.
  arXiv  Detail & Related papers  (2023-03-02T09:04:35Z)
• Local Sample-weighted Multiple Kernel Clustering with Consensus Discriminative Graph [73.68184322526338]
  Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a set of base kernels. This paper proposes a novel local sample-weighted multiple kernel clustering model. Experimental results demonstrate that our LSWMKC possesses better local manifold representation and outperforms existing kernel or graph-based clustering algo-rithms.
  arXiv  Detail & Related papers  (2022-07-05T05:00:38Z)
• Variable feature weighted fuzzy k-means algorithm for high dimensional data [30.828627752648767]
  In real-world applications, cluster-dependent feature weights help in partitioning the data set into more meaningful clusters.<n>This paper presents a novel fuzzy k-means clustering algorithm by modifying the objective function of the fuzzy k-means using two different entropy terms.<n>The method is validated using both supervised and unsupervised performance measures on real-world and synthetic datasets.
  arXiv  Detail & Related papers  (2019-12-24T04:58:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.