A Heuristic Optimal Reduct Algorithm

Authors:
Keyun Hu;Lili Diao;Yuchang Lu;Chunyi Shi
Affiliations:
-;-;-;-
Venue:
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
Year:
2000

Citing 4
Cited 1

Knowledge discovery in databases: an attribute-oriented rough set approach

Knowledge discovery in databases: an attribute-oriented rough set approach
Feature selection and effective classifiers

Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining
Rough computational methods for information systems

Artificial Intelligence
Rough-Fuzzy Hybridization: A New Trend in Decision Making

Rough-Fuzzy Hybridization: A New Trend in Decision Making

A New Rough Set Reduct Algorithm Based on Particle Swarm Optimization

IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks

Quantified Score

Hi-index	0.02

Visualization

Abstract

Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it does; and it is very fast.