Results 301 to 310 of about 10,917,671 (339)
Some of the next articles are maybe not open access.
An Efficient Attribute Reduction Algorithm
2006Attribute reduction is an important issue of data mining. It is generally regarded as a preprocessing phase that alleviates the curse of dimensionality, though it also leads to classificatory analysis of decision tables. In this paper, we propose an efficient algorithm TWI-SQUEEZE that can find a minimal (or irreducible) attribute subset, which ...
openaire +1 more source
Attribute Reduction Based on Granular Computing
2006Attribute reduction is a very important issue in data mining and machine learning. Granular computing is a new kind of soft computing theory. A novel method for encoding granules using bitmap technique is proposed in this paper. A new attribute reduction method based on granular computing is also developed with this encoding method.
Jun Hu 0002 +3 more
openaire +1 more source
Variable radius neighborhood rough sets and attribute reduction
International Journal of Approximate Reasoning, 2022Di Zhang, Ping Zhu
semanticscholar +1 more source
Tri-level attribute reduction in rough set theory
Expert systems with applications, 2021Xian-Yong Zhang, Yi-Yu Yao
semanticscholar +1 more source
Unsupervised attribute reduction: improving effectiveness and efficiency
International Journal of Machine Learning and Cybernetics, 2022Zhice Gong +4 more
semanticscholar +1 more source
Parallel Reducts Based on Attribute Significance
2010In the paper, we focus on how to get parallel reducts. We present a new method based on matrix of attribute significance, by which we can get parallel reduct as well as dynamic reduct. We prove the validity of our method in theory. The time complex of our method is polynomial. Experiments show that our method has advantages of dynamic reducts.
Dayong Deng, Dianxun Yan, Jiyi Wang
openaire +1 more source
Searching for Reductive Attributes in Decision Tables
2015Most decision support systems based on rough set theory are related to the minimal reduct calculation problem, which is NP-hard. This paper investigates the problem of searching for the set of useful attributes that occur in at least one reduct. By complement, this problem is equivalent to searching for the set of redundant attributes, i.e.
Long Giang Nguyen, Hung Son Nguyen
openaire +1 more source
Attribute reduction approaches under interval-valued q-rung orthopair fuzzy soft framework
Applied intelligence (Boston), 2021Ghous Ali +3 more
semanticscholar +1 more source
Triple-G: a new MGRS and attribute reduction
International Journal of Machine Learning and Cybernetics, 2021Jing Ba +5 more
semanticscholar +1 more source