Granular Computing: An Augmented Scheme of Degranulation Through a Modified Partition Matrix

04/03/2020
by   Kaijie Xu, et al.
0

As an important technology in artificial intelligence Granular Computing (GrC) has emerged as a new multi-disciplinary paradigm and received much attention in recent years. Information granules forming an abstract and efficient characterization of large volumes of numeric data have been considered as the fundamental constructs of GrC. By generating prototypes and partition matrix, fuzzy clustering is a commonly encountered way of information granulation. Degranulation involves data reconstruction completed on a basis of the granular representatives. Previous studies have shown that there is a relationship between the reconstruction error and the performance of the granulation process. Typically, the lower the degranulation error is, the better performance of granulation is. However, the existing methods of degranulation usually cannot restore the original numeric data, which is one of the important reasons behind the occurrence of the reconstruction error. To enhance the quality of degranulation, in this study, we develop an augmented scheme through modifying the partition matrix. By proposing the augmented scheme, we dwell on a novel collection of granulation-degranulation mechanisms. In the constructed approach, the prototypes can be expressed as the product of the dataset matrix and the partition matrix. Then, in the degranulation process, the reconstructed numeric data can be decomposed into the product of the partition matrix and the matrix of prototypes. Both the granulation and degranulation are regarded as generalized rotation between the data subspace and the prototype subspace with the partition matrix and the fuzzification factor. By modifying the partition matrix, the new partition matrix is constructed through a series of matrix operations. We offer a thorough analysis of the developed scheme. The experimental results are in agreement with the underlying conceptual framework

READ FULL TEXT

page 1

page 9

research
04/13/2020

Augmentation of the Reconstruction Performance of Fuzzy C-Means with an Optimized Fuzzification Factor Vector

Information granules have been considered to be the fundamental construc...
research
02/21/2020

Kullback-Leibler Divergence-Based Fuzzy C-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation

Although spatial information of images usually enhance the robustness of...
research
06/24/2022

Augmented unprojected Krylov subspace methods from an alternative view of an existing framework

Augmented Krylov subspace methods aid in accelerating the convergence of...
research
06/03/2022

Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case

We consider the problem of secure distributed matrix multiplication (SDM...
research
05/01/2021

Multi-view Clustering via Deep Matrix Factorization and Partition Alignment

Multi-view clustering (MVC) has been extensively studied to collect mult...
research
08/04/2023

Krylov Subspace Recycling With Randomized Sketching For Matrix Functions

A Krylov subspace recycling method for the efficient evaluation of a seq...
research
09/28/2022

Krylov Subspace Recycling For Matrix Functions

We derive an augmented Krylov subspace method with subspace recycling fo...

Please sign up or login with your details

Forgot password? Click here to reset