@INPROCEEDINGS { Rsds2609,
author = {Hu, Xiaohua Tony and Sanchez, Ricardo and Han, Jianchao}, 
title = {Feature Selection Based on Relative Attribute Dependency: An Experimental Study}, 
booktitle = {Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Part I}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 3641, 
pages = {214--223}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {August}, 
year = 2005, 
editor = {Slezak, Dominik and Wang, Guoying and Szczuka, Marcin and Duntsch, Ivo and Yao, Yiyu}, 
issn = {0302-9743}, 
isbn = {3-540-28653-5}, 
abstract = {Most existing rough set-based feature selection algorithms suffer from intensive computation of either discernibility functions or positive regions to find attribute reduct. In this paper, we develop a new computation model based on relative attribute dependency that is defined as the proportion of the projection of the decision table on a subset of condition attributes to the projection of the decision table on the union of the subset of condition attributes and the set of decision attributes. To find an optimal reduct, we use information entropy conveyed by the attributes as the heuristic. A novel algorithm to find optimal reducts of condition attributes based on the relative attribute dependency is implemented using Java, and is experimented with 10 data sets from UCI Machine Learning Repository. We conduct the comparison of data classification using C4.5 with the original data sets and their reducts. The experiment results demonstrate the usefulness of our algorithm.}, 
keywords = {rough set theory (RST), machine learning, data mining, classification, data reduction, feature selection, }, 
}