Variable precision rough set model
Journal of Computer and System Sciences
From rough set theory to evidence theory
Advances in the Dempster-Shafer theory of evidence
Communications of the ACM
Attribute reduction in decision-theoretic rough set models
Information Sciences: an International Journal
Probabilistic rough set approximations
International Journal of Approximate Reasoning
Three-Way Decision: An Interpretation of Rules in Rough Set Theory
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Decision-theoretic rough set models
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
A note on attribute reduction in the decision-theoretic rough set model
Transactions on rough sets XIII
Two Semantic Issues in a Probabilistic Rough Set Model
Fundamenta Informaticae - Advances in Rough Set Theory
Hi-index | 0.00 |
Real world data may contain inconsistencies, uncertainty and noise. Rough set model is a mathematical methodology in data analysis to deal with inconsistent and imperfect knowledge. Various probabilistic approaches to rough set model are proposed. Decision-theoretic rough set model (DTRSM) is one of the probabilistic approaches to rough set model. This paper proposes an attribute reduction algorithm in DTRSM, through region preservation. Attribute reduction is the process of identifying and removing redundant and irrelevant attributes from huge data sets, reducing its volume. The reduced data set can be much more effectively analyzed. Attribute reduction in DTRSM through region preservation is an optimization problem, thus Genetic Algorithm (GA) is used to achieve this optimization. Experiment results on discrete data sets are compared with local optimization approach based on discernibility matrix method and has been shown that GA can be effectively and efficiently used to achieve global minimal reduct.