Results 221 to 230 of about 140,208 (262)

Universal Attribute Reduction Problem

2007
In the paper, some generalizations of the notions of reduct and test (superreduct) are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information on greedy algorithm work is studied.
Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko   +2 more
openaire   +1 more source

Research on attribute reduction algorithm

2010 International Conference On Computer Design and Applications, 2010
In this paper, by the comprehension and analysis of data mining algorithm based on tradition rough set theory, on improved discernibility matrix, the information for core and reduction without inclusion relation is gained in the process of comparing objects. Based on this information, a new heuristic algorithm for reduction is proposed.
Qiang Lv, Liang-shan Shao
openaire   +1 more source

Consistency Based Attribute Reduction

2007
Rough sets are widely used in feature subset selection and attribute reduction. In most of the existing algorithms, the dependency function is employed to evaluate the quality of a feature subset. The disadvantages of using dependency are discussed in this paper. And the problem of forward greedy search algorithm based on dependency is presented.
Qinghua Hu, Hui Zhao, Zongxia Xie, Daren Yu   +3 more
openaire   +1 more source

Quick Complete Attribute Reduction Algorithm

2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, 2009
To improve the efficiency of attribute reduction and obtain the minimal attribute reduction, the notion of consistent simplified decision table is proposed. The concentrated discernibility set is created in the consistent simplified decision table, and an algorithm of completeness attribute reduction based on concentrated discernibility set is put ...
Chuanjian Yang, Hao Ge, Guangshun Yao, Lisheng Ma   +3 more
openaire   +1 more source

Ensemble selector for attribute reduction

Applied Soft Computing, 2018
Abstract Through abstracting commonness from the existing heuristic algorithms, control strategies bring us higher level understandings of building reducts in rough set theory. To further improve the performances and strengthen the applicabilities of the addition control strategy, an ensemble selector is introduced into such framework.
Xibei Yang, Yiyu Yao
openaire   +1 more source

Attribute reduction recursion algorithm based on attribute diminishing strategy

2012 International Conference on Computer Science and Information Processing (CSIP), 2012
Attribute reduction is one of core research subjects in rough set theory. By means of studying some existing attribute reduction algorithms, it found that they cannot effectively or correctly get reduction results. An attribute reduction recursion algorithm based on attribute diminishing strategy was presented in this paper.
null Li Hong-Chan, null Zhu Hao-Dong
openaire   +1 more source

Local Search for Attribute Reduction

2019
Two new attribute reduction algorithms based on iterated local search and rough sets are proposed. Both algorithms start with a greedy construction of a relative reduct. Then attempts to remove some attributes to make the reduct smaller. Process of attributes selection is the main difference between the algorithms. It is random for the first one, and a
Xiaojun Xie, Ryszard Janicki, Xiaolin Qin, Wei Zhao, Guangmei Huang   +4 more
openaire   +1 more source

Attributes correlation coefficients and their application to attributes reduction

Journal of Intelligent & Fuzzy Systems, 2019
In this paper, information entropy about logarithmic form is used to measure uncertainty of knowledge, and the correlation connection between information entropy, conditional information entropy, joint information entropy and mutual information entropy are analyzed. Correlation coefficient ρ  ( B
Wu, Xia, Zhang, Jialu, Zhong, Jiaming
openaire   +1 more source

Semi-supervised attribute reduction via attribute indiscernibility

International Journal of Machine Learning and Cybernetics, 2022
Jianhua Dai, Weisi Wang, Chucai Zhang, Shaojun Qu   +3 more
openaire   +1 more source

Attribute Reduction: An Ensemble Strategy

2017
In rough set theory, the heuristic strategy for computing reducts does not take the stability of the selected attributes into account. An unstable reduct may imply the lower adaption to data variations. To fill such a gap, an ensemble strategy is embedded in heuristic algorithm for achieving stable reducts of variable precision fuzzy rough sets.
Suping Xu, Pingxin Wang, Jinhai Li, Xibei Yang, Xiangjian Chen   +4 more
openaire   +1 more source