Boolean Feature Discovery in Empirical Learning
Machine Learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Learning Boolean concepts in the presence of many irrelevant features
Artificial Intelligence
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Feature Selection Using Rough Sets Theory
ECML '93 Proceedings of the European Conference on Machine Learning
Chi2: Feature Selection and Discretization of Numeric Attributes
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Generalized rough sets based feature selection
Intelligent Data Analysis
The feature selection problem: traditional methods and a new algorithm
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
The fitness-rough: A new attribute reduction method based on statistical and rough set theory
Intelligent Data Analysis
An enhanced support vector machine model for intrusion detection
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
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.