A Heuristic Algorithm for Attribute Reduction Based on Discernibility and Equivalence by Attributes

Authors:
Yasuo Kudo;Tetsuya Murai
Affiliations:
Dept. of Computer Science and Systems Eng., Muroran Institute of Technology, Muroran, Japan 050-8585;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814
Venue:
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Year:
2009

Citing 7
Cited 0

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations

Rough Sets: Mathematical Foundations
Approximate entropy reducts

Fundamenta Informaticae
Tabu search for attribute reduction in rough set theory

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Efficient attribute reduction based on discernibility matrix

RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Fast knowledge reduction algorithms based on quick sort

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
New reduction algorithm based on decision power of decision table

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a heuristic method to partially calculate relative reducts with better evaluation by the evaluation criterion proposed by the authors. By considering discernibility and equivalence of elements with respect to values of condition attributes that appear in relative reducts, we introduce an evaluation criterion of condition attributes, and consider a heuristic method for calculating a relative reduct with better evaluation.