LGBQPC: Local Granular-Ball Quality Peaks Clustering

• URL: http://arxiv.org/abs/2505.11359v1
• Date: Fri, 16 May 2025 15:26:02 GMT
• Title: LGBQPC: Local Granular-Ball Quality Peaks Clustering
• Authors: Zihang Jia, Zhen Zhang, Witold Pedrycz,
• Abstract summary: The density peaks clustering (DPC) algorithm has attracted considerable attention for its ability to detect arbitrarily shaped clusters.<n>Recent advancements integrating granular-ball computing with DPC have led to the GB-based DPC algorithm, which improves computational efficiency.<n>This paper proposes the local GB quality peaks clustering (LGBQPC) algorithm, which offers comprehensive improvements to GBDPC in both GB generation and clustering processes.
• Score: 51.58924743533048
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The density peaks clustering (DPC) algorithm has attracted considerable attention for its ability to detect arbitrarily shaped clusters based on a simple yet effective assumption. Recent advancements integrating granular-ball (GB) computing with DPC have led to the GB-based DPC (GBDPC) algorithm, which improves computational efficiency. However, GBDPC demonstrates limitations when handling complex clustering tasks, particularly those involving data with complex manifold structures or non-uniform density distributions. To overcome these challenges, this paper proposes the local GB quality peaks clustering (LGBQPC) algorithm, which offers comprehensive improvements to GBDPC in both GB generation and clustering processes based on the principle of justifiable granularity (POJG). Firstly, an improved GB generation method, termed GB-POJG+, is developed, which systematically refines the original GB-POJG in four key aspects: the objective function, termination criterion for GB division, definition of abnormal GB, and granularity level adaptation strategy. GB-POJG+ simplifies parameter configuration by requiring only a single penalty coefficient and ensures high-quality GB generation while maintaining the number of generated GBs within an acceptable range. In the clustering phase, two key innovations are introduced based on the GB k-nearest neighbor graph: relative GB quality for density estimation and geodesic distance for GB distance metric. These modifications substantially improve the performance of GBDPC on datasets with complex manifold structures or non-uniform density distributions. Extensive numerical experiments on 40 benchmark datasets, including both synthetic and publicly available datasets, validate the superior performance of the proposed LGBQPC algorithm.

Related papers

• Approximate Borderline Sampling using Granular-Ball for Classification Tasks [7.340676924771606]
  Recently, the sampling method based on granular-ball (GB) has shown promising performance in generality and noisy classification tasks.<n>In this paper, an approximate borderline sampling method using GBs is proposed for classification tasks.
  arXiv  Detail & Related papers  (2025-06-03T02:04:27Z)
• PCE-GAN: A Generative Adversarial Network for Point Cloud Attribute Quality Enhancement based on Optimal Transport [56.56430888985025]
  We propose a generative adversarial network for point cloud quality enhancement (PCE-GAN)<n>The generator consists of a local feature extraction (LFE) unit, a global spatial correlation (GSC) unit and a feature squeeze unit.<n>The discriminator computes the deviation between the probability distributions of the enhanced point cloud and the original point cloud, guiding the generator to achieve high quality reconstruction.
  arXiv  Detail & Related papers  (2025-02-26T07:34:33Z)
• Clustering Based on Density Propagation and Subcluster Merging [92.15924057172195]
  We propose a density-based node clustering approach that automatically determines the number of clusters and can be applied in both data space and graph space. Unlike traditional density-based clustering methods, which necessitate calculating the distance between any two nodes, our proposed technique determines density through a propagation process.
  arXiv  Detail & Related papers  (2024-11-04T04:09:36Z)
• 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)
• Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition [49.41718583061147]
  Graph condensation is a data-centric solution to replace the large graph with a small yet informative condensed graph.<n>Existing GC methods suffer from intricate optimization processes, necessitating excessive computing resources and training time.<n>We propose a training-free GC framework termed Class-partitioned Graph Condensation (CGC)<n>CGC condenses the Ogbn-products graph within 30 seconds, achieving a speedup ranging from $102$X to $104$X and increasing accuracy by up to 4.2%.
  arXiv  Detail & Related papers  (2024-05-22T14:57:09Z)
• Generation of Granular-Balls for Clustering Based on the Principle of Justifiable Granularity [51.58924743533048]
  This article introduces a novel GB generation method for clustering tasks. We define the coverage and specificity of a GB and introduce a comprehensive measure for assessing GB quality. Compared to previous GB generation methods, the new method maximizes the overall quality of generated GBs.
  arXiv  Detail & Related papers  (2024-05-11T04:21:32Z)
• Gaussian Ensemble Belief Propagation for Efficient Inference in High-Dimensional Systems [3.6773638205393198]
  Efficient inference in high-dimensional models is a central challenge in machine learning.<n>We introduce the Gaussian Ensemble Belief Propagation (GEnBP) algorithm.<n>We show that GEnBP outperforms existing belief methods in terms of accuracy and computational efficiency.
  arXiv  Detail & Related papers  (2024-02-13T03:31:36Z)
• GBG++: A Fast and Stable Granular Ball Generation Method for Classification [17.7229704582645]
  Granular ball computing is an efficient, robust, and scalable learning method.<n>The stability and efficiency of existing GBG methods need to be further improved.<n>A fast and stable GBG (GBG++) method is proposed first.
  arXiv  Detail & Related papers  (2023-05-29T04:00:19Z)
• Fully and partially distributed Quantum Generalized Benders Decomposition for Unit Commitment Problems [12.20904743817675]
  Hybrid quantum-classical generalized Benders decomposition (GBD) algorithms are proposed to address unit commitment (UC) problems.<n>In the centralized approach, the quantum GBD transforms the master problem (MP) into a quadratic unconstrained binary optimization form suitable for quantum computing.<n>For distributed systems, the distributed consensus quantum GBD employs an average consensus strategy to reformulate subproblems into local subproblems.
  arXiv  Detail & Related papers  (2022-10-13T02:26:27Z)

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.