Evolutionary feature selection via structure retention

Authors:
W. Pedrycz;S. S. Syed Ahmad
Affiliations:
Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB, Canada T6R 2V4 and Department of Electrical & Computer Engineering, Faculty of Engineering, King Abdulaziz Uni ...;Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB, Canada T6R 2V4
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 7
Cited 3

Data clustering: a review

ACM Computing Surveys (CSUR)
Feature Selection for Knowledge Discovery and Data Mining

Feature Selection for Knowledge Discovery and Data Mining
Feature selection based on a modified fuzzy C-means algorithm with supervision

Information Sciences—Informatics and Computer Science: An International Journal
Evolving Feature Selection

IEEE Intelligent Systems
Feature selection based on rough sets and particle swarm optimization

Pattern Recognition Letters
Particle swarm optimization for parameter determination and feature selection of support vector machines

Expert Systems with Applications: An International Journal
Clustering with a genetically optimized approach

IEEE Transactions on Evolutionary Computation

Genetic algorithms in feature and instance selection

Knowledge-Based Systems
Genetic wavelet packets for speech recognition

Expert Systems with Applications: An International Journal
A feature construction method for general object recognition

Pattern Recognition

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this study, we introduce a concept of feature space reduction, in which the reduction process is guided by a criterion of structure retention. In other words, the features forming the reduced space are selected in such a way that the original structure present in the highly dimensional space is retained in the reduced space to the highest possible extent. The quality of structure retention is quantified by means of the reconstruction criterion, which dwells on an idea of granulation and degranulation and quantifies an extent to which the information granules are capable of representing original patterns while being expressed by them. Fuzzy clustering (and Fuzzy C-Means, FCM, in particular) is used as an algorithmic vehicle of information granulation. The quality of information granules (and the granular structure, in general) is expressed by the reconstruction error. Given the combinatorial character of the selection process, the underlying optimization process is realized through the use of evolutionary optimization (Genetic Algorithms) and Particle Swarm Optimization (PSO). Experiments are provided. We show that, depending upon the specific data set, their structural content can be preserved even for a relatively significant reduction of the dimensionality of the feature space.