Abstract
In this paper, a new feature selection method based on generalized data field(FR-GDF) is proposed. The goal of feature selection is selecting useful features and simultaneously excluding garbage features from a given feature set. It is Important to measure the “distance” between data points in existing feature selection approaches. To measure the “distance”, FR-GDF adopts potential value of data field. Information entropy of potential value is used to measure the inter-class distance and intra-class distance. This method eliminates unimportant or noise features of original feature sets and extracts the optional features. Experiments prove that FR-GDF algorithm performs well and is independent of the specific classification algorithm.
Original language | English |
---|---|
Pages (from-to) | 319-333 |
Number of pages | 15 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 8933 |
DOIs | |
Publication status | Published - 2014 |
Keywords
- Feature selection
- Generalized data field
- Information entropy
- Potential value