5 results on '"Xu, Taihua"'
Search Results
2. Optimizing Attribute Reduction in Multi-Granularity Data through a Hybrid Supervised–Unsupervised Model.
- Author
-
Fan, Zeyuan, Chen, Jianjun, Cui, Hongyang, Song, Jingjing, and Xu, Taihua
- Subjects
ROUGH sets ,DATA reduction ,SUPERVISED learning ,DIMENSION reduction (Statistics) - Abstract
Attribute reduction is a core technique in the rough set domain and an important step in data preprocessing. Researchers have proposed numerous innovative methods to enhance the capability of attribute reduction, such as the emergence of multi-granularity rough set models, which can effectively process distributed and multi-granularity data. However, these innovative methods still have numerous shortcomings, such as addressing complex constraints and conducting multi-angle effectiveness evaluations. Based on the multi-granularity model, this study proposes a new method of attribute reduction, namely using multi-granularity neighborhood information gain ratio as the measurement criterion. This method combines both supervised and unsupervised perspectives, and by integrating multi-granularity technology with neighborhood rough set theory, constructs a model that can adapt to multi-level data features. This novel method stands out by addressing complex constraints and facilitating multi-perspective effectiveness evaluations. It has several advantages: (1) it combines supervised and unsupervised learning methods, allowing for nuanced data interpretation and enhanced attribute selection; (2) by incorporating multi-granularity structures, the algorithm can analyze data at various levels of granularity. This allows for a more detailed understanding of data characteristics at each level, which can be crucial for complex datasets; and (3) by using neighborhood relations instead of indiscernibility relations, the method effectively handles uncertain and fuzzy data, making it suitable for real-world datasets that often contain imprecise or incomplete information. It not only selects the optimal granularity level or attribute set based on specific requirements, but also demonstrates its versatility and robustness through extensive experiments on 15 UCI datasets. Comparative analyses against six established attribute reduction algorithms confirms the superior reliability and consistency of our proposed method. This research not only enhances the understanding of attribute reduction mechanisms, but also sets a new benchmark for future explorations in the field. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Forward Greedy Searching to κ -Reduct Based on Granular Ball.
- Author
-
Song, Minhui, Chen, Jianjun, Song, Jingjing, Xu, Taihua, and Fan, Yan
- Subjects
ROUGH sets - Abstract
As a key part of data preprocessing, namely attribute reduction, is effectively applied in the rough set field. The purpose of attribute reduction is to prevent too many attributes from affecting classifier operations and reduce the dimensionality of data space. Presently, in order to further improve the simplification performance of attribute reduction, numerous researchers have proposed a variety of methods. However, given the current findings, the challenges are: to reasonably compress the search space of candidate attributes; to fulfill multi-perspective evaluation; and to actualize attribute reduction based on guidance. In view of this, forward greedy searching to κ -reduct based on granular ball is proposed, which has the following advantages: (1) forming symmetrical granular balls to actualize the grouping of the universe; (2) continuously merging small universes to provide guidance for subsequent calculations; and (3) combining supervised and unsupervised perspectives to enrich the viewpoint of attribute evaluation and better improve the capability of attribute reduction. Finally, based on three classifiers, 16 UCI datasets are used to compare our proposed method with six advanced algorithms about attribute reduction and an algorithm without applying any attribute reduction algorithms. The experimental results indicate that our method can not only ensure the result of reduction has considerable performance in the classification test, but also improve the stability of attribute reduction to a certain degree. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. Attribute Reduction Based on Lift and Random Sampling.
- Author
-
Chen, Qing, Xu, Taihua, and Chen, Jianjun
- Subjects
- *
ROUGH sets , *STATISTICAL sampling , *FEATURE selection - Abstract
As one of the key topics in the development of neighborhood rough set, attribute reduction has attracted extensive attentions because of its practicability and interpretability for dimension reduction or feature selection. Although the random sampling strategy has been introduced in attribute reduction to avoid overfitting, uncontrollable sampling may still affect the efficiency of search reduct. By utilizing inherent characteristics of each label, Multi-label learning with Label specIfic FeaTures (Lift) algorithm can improve the performance of mathematical modeling. Therefore, here, it is attempted to use Lift algorithm to guide the sampling for reduce the uncontrollability of sampling. In this paper, an attribute reduction algorithm based on Lift and random sampling called ARLRS is proposed, which aims to improve the efficiency of searching reduct. Firstly, Lift algorithm is used to choose the samples from the dataset as the members of the first group, then the reduct of the first group is calculated. Secondly, random sampling strategy is used to divide the rest of samples into groups which have symmetry structure. Finally, the reducts are calculated group-by-group, which is guided by the maintenance of the reducts' classification performance. Comparing with other 5 attribute reduction strategies based on rough set theory over 17 University of California Irvine (UCI) datasets, experimental results show that: (1) ARLRS algorithm can significantly reduce the time consumption of searching reduct; (2) the reduct derived from ARLRS algorithm can provide satisfying performance in classification tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Beam-Influenced Attribute Selector for Producing Stable Reduct.
- Author
-
Yan, Wangwang, Ba, Jing, Xu, Taihua, Yu, Hualong, Shi, Jinlong, and Han, Bin
- Subjects
ROUGH sets ,FEATURE selection - Abstract
Attribute reduction is a critical topic in the field of rough set theory. Currently, to further enhance the stability of the derived reduct, various attribute selectors are designed based on the framework of ensemble selectors. Nevertheless, it must be pointed out that some limitations are concealed in these selectors: (1) rely heavily on the distribution of samples; (2) rely heavily on the optimal attribute. To generate the reduct with higher stability, a novel beam-influenced selector (BIS) is designed based on the strategies of random partition and beam. The scientific novelty of our selector can be divided into two aspects: (1) randomly partition samples without considering the distribution of samples; (2) beam-based selections of features can save the selector from the dependency of the optimal attribute. Comprehensive experiments using 16 UCI data sets show the following: (1) the stability of the derived reducts may be significantly enhanced by using our selector; (2) the reducts generated based on the proposed selector can provide competent performance in classification tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.