Generation of Granular-Balls for Clustering Based on the Principle of Justifiable Granularity

• URL: http://arxiv.org/abs/2405.06904v2
• Date: Wed, 15 May 2024 09:29:58 GMT
• Title: Generation of Granular-Balls for Clustering Based on the Principle of Justifiable Granularity
• Authors: Zihang Jia, Zhen Zhang, Witold Pedrycz,
• Abstract summary: 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.
• Score: 51.58924743533048
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient and robust data clustering remains a challenging task in the field of data analysis. Recent efforts have explored the integration of granular-ball (GB) computing with clustering algorithms to address this challenge, yielding promising results. However, existing methods for generating GBs often rely on single indicators to measure GB quality and employ threshold-based or greedy strategies, potentially leading to GBs that do not accurately capture the underlying data distribution. To address these limitations, this article introduces a novel GB generation method. The originality of this method lies in leveraging the principle of justifiable granularity to measure the quality of a GB for clustering tasks. To be precise, we define the coverage and specificity of a GB and introduce a comprehensive measure for assessing GB quality. Utilizing this quality measure, the method incorporates a binary tree pruning-based strategy and an anomaly detection method to determine the best combination of sub-GBs for each GB and identify abnormal GBs, respectively. Compared to previous GB generation methods, the new method maximizes the overall quality of generated GBs while ensuring alignment with the data distribution, thereby enhancing the rationality of the generated GBs. Experimental results obtained from both synthetic and publicly available datasets underscore the effectiveness of the proposed GB generation method, showcasing improvements in clustering accuracy and normalized mutual information.

Related papers

• 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)
• ADRS-CNet: An adaptive dimensionality reduction selection and classification network for DNA storage clustering algorithms [8.295062627879938]
  Methods like PCA, UMAP, and t-SNE are commonly employed to project high-dimensional features into low-dimensional space. This paper proposes training a multilayer perceptron model to classify input DNA sequence features and adaptively select the most suitable dimensionality reduction method.
  arXiv  Detail & Related papers  (2024-08-22T22:26:41Z)
• A robust three-way classifier with shadowed granular-balls based on justifiable granularity [53.39844791923145]
  We construct a robust three-way classifier with shadowed GBs for uncertain data. Our model demonstrates in managing uncertain data and effectively mitigates classification risks.
  arXiv  Detail & Related papers  (2024-07-03T08:54:45Z)
• GCC: Generative Calibration Clustering [55.44944397168619]
  We propose a novel Generative Clustering (GCC) method to incorporate feature learning and augmentation into clustering procedure. First, we develop a discrimirative feature alignment mechanism to discover intrinsic relationship across real and generated samples. Second, we design a self-supervised metric learning to generate more reliable cluster assignment.
  arXiv  Detail & Related papers  (2024-04-14T01:51:11Z)
• Boost clustering with Gaussian Boson Sampling: a full quantum approach [0.09437521840642138]
  We propose a novel clustering approach based on Gaussian Boson Sampling (GBS) We benchmark our approach with two well-known classical clustering algorithms. Results show that our approach outperforms the two classical algorithms in two out of the three chosen metrics.
  arXiv  Detail & Related papers  (2023-07-25T09:05:24Z)
• GBG++: A Fast and Stable Granular Ball Generation Method for Classification [18.611701583873504]
  Granular ball computing is an efficient, robust, and scalable learning method. The stability and efficiency of existing GBG methods need to be further improved. A fast and stable GBG (GBG++) method is proposed first.
  arXiv  Detail & Related papers  (2023-05-29T04:00:19Z)
• Improving Generative Adversarial Networks with Local Coordinate Coding [150.24880482480455]
  Generative adversarial networks (GANs) have shown remarkable success in generating realistic data from some predefined prior distribution. In practice, semantic information might be represented by some latent distribution learned from data. We propose an LCCGAN model with local coordinate coding (LCC) to improve the performance of generating data.
  arXiv  Detail & Related papers  (2020-07-28T09:17:50Z)
• A Novel Granular-Based Bi-Clustering Method of Deep Mining the Co-Expressed Genes [76.84066556597342]
  Bi-clustering methods are used to mine bi-clusters whose subsets of samples (genes) are co-regulated under their test conditions. Unfortunately, traditional bi-clustering methods are not fully effective in discovering such bi-clusters. We propose a novel bi-clustering method by involving here the theory of Granular Computing.
  arXiv  Detail & Related papers  (2020-05-12T02:04:40Z)

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.