GBFRS: Robust Fuzzy Rough Sets via Granular-ball Computing
- URL: http://arxiv.org/abs/2501.18413v1
- Date: Thu, 30 Jan 2025 15:09:26 GMT
- Title: GBFRS: Robust Fuzzy Rough Sets via Granular-ball Computing
- Authors: Shuyin Xia, Xiaoyu Lian, Binbin Sang, Guoyin Wang, Xinbo Gao,
- Abstract summary: Fuzzy rough set theory is effective for processing datasets with complex attributes.
Most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise.
This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points.
- Score: 48.33779268699777
- License:
- Abstract: Fuzzy rough set theory is effective for processing datasets with complex attributes, supported by a solid mathematical foundation and closely linked to kernel methods in machine learning. Attribute reduction algorithms and classifiers based on fuzzy rough set theory exhibit promising performance in the analysis of high-dimensional multivariate complex data. However, most existing models operate at the finest granularity, rendering them inefficient and sensitive to noise, especially for high-dimensional big data. Thus, enhancing the robustness of fuzzy rough set models is crucial for effective feature selection. Muiti-garanularty granular-ball computing, a recent development, uses granular-balls of different sizes to adaptively represent and cover the sample space, performing learning based on these granular-balls. This paper proposes integrating multi-granularity granular-ball computing into fuzzy rough set theory, using granular-balls to replace sample points. The coarse-grained characteristics of granular-balls make the model more robust. Additionally, we propose a new method for generating granular-balls, scalable to the entire supervised method based on granular-ball computing. A forward search algorithm is used to select feature sequences by defining the correlation between features and categories through dependence functions. Experiments demonstrate the proposed model's effectiveness and superiority over baseline methods.
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) - Granular-ball computing: an efficient, robust, and interpretable
adaptive multi-granularity representation and computation method [54.2899493638937]
Human cognition operates on a "Global-first" cognitive mechanism, prioritizing information processing based on coarse-grained details.
The analysis pattern reliance on the finest granularity and single-granularity makes most existing computational methods less efficient, robust, and interpretable.
Multi-granularity granular-ball computing employs granular-balls of varying sizes to daptively represent and envelop the sample space.
Granular-ball computing is a rare and innovative theoretical approach in AI that can adaptively and simultaneously enhance efficiency, robustness, and interpretability.
arXiv Detail & Related papers (2023-04-21T03:26:29Z) - GBO:AMulti-Granularity Optimization Algorithm via Granular-ball for Continuous Problems [18.229944332377755]
This paper proposes a new multi-granularity evolutionary optimization method, namely the Granular-ball Optimization (GBO) algorithm.
Using granular-balls instead of traditional points for optimization increases the diversity and robustness of the random search process.
Experiments on commonly used benchmarks have shown that GBO outperforms popular and advanced evolutionary algorithms.
arXiv Detail & Related papers (2023-03-18T13:18:21Z) - 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) - Fuzzy Granular-Ball Computing Framework and Its Implementation in SVM [0.8916420423563476]
We propose a framework for a fuzzy granular-ball computational classifier by introducing granular-ball computing into fuzzy set.
The computational framework is based on the granular-balls input rather than points.
The framework is extended to the fuzzy support vector machine (FSVM), and granular ball fuzzy SVM (GBFSVM) is derived.
arXiv Detail & Related papers (2022-10-21T02:03:52Z) - An Efficient and Adaptive Granular-ball Generation Method in
Classification Problem [69.02474089703678]
Granular-ball computing is an efficient, robust, and scalable learning method for granular computing.
This paper proposes a method for accelerating the granular-ball generation using the division to replace $k$-means.
It can greatly improve the efficiency of granular-ball generation while ensuring the accuracy similar to the existing method.
arXiv Detail & Related papers (2022-01-12T07:26:19Z) - Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature
Selection [138.97647716793333]
We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization.
We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
arXiv Detail & Related papers (2020-12-29T04:08:38Z)
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.