Exploring the Boundary Region for Attribute Reduction in Inconsistent Decision Tables
- Resource Type
- Article
Text
- Authors
- Yuhui Chang; Jin Qian
- Source
- International Journal of Database Theory and Application, 10/30/2016, Vol. 9, Issue 10, p. 199-214
- Subject
- Rough set
attribute reduction
discernibility matrix
boundary region
counting sort
- Language
- 영어(ENG)
- ISSN
- 2005-4270
Attribute reduction is one of the key issues for data preprocess in data mining. Many heuristic attribute reduction algorithms based on discernibility matrix have been proposed for inconsistent decision tables. However, these methods are usually computationally time-consuming. To address this issue, the derived consistent decision tables are defined for different definitions of relative reducts. The computations for different reducts of the original inconsistent decision tables are converted into the computations for their corresponding reducts of the derived consistent datasets. The relationships among different core sets and attribute reducts are further discussed. The relative discernibility object pair and the more optimal relative discernibility degree from view of the boundary region are designed to accelerate the attribute reduction process. An efficient attribute reduction framework using relative discernibility degree is proposed for large datasets. Experimental results show that our attribute reduction algorithms are effective and feasible for large inconsistent datasets.