Logo image
Back
Feature Selection Based on Relative Attribute Dependency: An Experimental Study
Book chapter   Peer reviewed

Feature Selection Based on Relative Attribute Dependency: An Experimental Study

Jianchao Han, Ricardo Sanchez and Xiaohua Hu
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, pp 214-223
2005
DOI: https://doi.org/10.1007/11548669_23
Featured in Collection :   UN Sustainable Development Goals @ Drexel

Abstract

classification data reduction feature selection machine learning and data mining Rough set theory
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.

Metrics

7 Record Views
6 citations in Web of Science
12 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#3 Good Health and Well-Being

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
Web of Science research areas
Computer Science, Artificial Intelligence
Logo image