An Introduction to Feature Extraction
Studies in fuzziness and soft computingPublished 15 November 2008
Isabelle Guyon, André Elisseeff
Citations503
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This chapter introduces the reader to the various aspects of feature extraction covered in this book and proposes a unified view of the feature extraction problem.
Abstract
This chapter introduces the reader to the various aspects of feature extraction covered in this book. Section 1 reviews definitions and notations and proposes a unified view of the feature extraction problem. Section 2 is an overview of the methods and results presented in the book, emphasizing novel contributions. Section 3 provides the reader with an entry point in the field of feature extraction by showing small revealing examples and describing simple but effective algorithms. Finally, Section 4 introduces a more theoretical formalism and points to directions of research and open problems.
Keywords
Computer Science
Machine LearningRandom Forests
126,192 Citations2001Leo Breiman
Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.
Springer series in statisticsThe Elements of Statistical Learning
24,344 Citations2001Trevor Hastie, J. Friedman +1 more
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
19,345 Citations2013Trevor Hastie, Robert Tibshirani +1 more
Artificial IntelligenceWrappers for feature subset selection
8,925 Citations1997Ron Kohavi, George H. John
The wrapper method searches for an optimal feature subset tailored to a particular algorithm and a domain and compares the wrapper approach to induction without feature subset selection and to Relief, a filter approach tofeature subset selection.
Lecture notes in statisticsBayesian Learning for Neural Networks
4,375 Citations1996Radford M. Neal
Bayesian Learning for Neural Networks shows that Bayesian methods allow complex neural network models to be used without fear of the "overfitting" that can occur with traditional neural network learning methods.
Applied Physics Letters10.1162/153244303322753616
3,568 Citations2000
The contributions of this special issue cover a wide range of aspects of variable selection: providing a better definition of the objective function, feature construction, feature ranking, multivariate feature selection, efficient search methods, and feature validity assessment methods.
Artificial IntelligenceSelection of relevant features and examples in machine learning
3,295 Citations1997Avrim Blum, Pat Langley
This survey reviews work in machine learning on methods for handling data sets containing large amounts of irrelevant information and describes the advances that have been made in both empirical and theoretical work in this area.
Elsevier eBooksA Practical Approach to Feature Selection
2,954 Citations1992Kenji Kira, Larry Rendell
Comparison with other feature selection algorithms shows Relief's advantages in terms of learning time and the accuracy of the learned concept, suggesting Relief's practicality.
Toward optimal feature selection
1,444 Citations1996Daphne Koller, Mehran Sahami
An efficient algorithm for feature selection which computes an approximation to the optimal feature selection criterion is given, showing that the algorithm effectively handles datasets with a very large number of features.
Understanding digital signal processing
1,014 Citations1996R. Lyons
Comprehensive in scope, and gentle in approach, this book will help you achieve a thorough grasp of the basics and move gradually to more sophisticated DSP concepts and applications.
Morphological Image Analysis
1,009 Citations2004Pierre Soille
The information bottleneck method
921 Citations2000Naftali Tishby, Fernando C. N. Pereira +1 more
The variational principle provides a surprisingly rich framework for discussing a variety of problems in signal processing and learning, as will be described in detail elsewhere.
Journal of the American Statistical AssociationFeature Extraction Construction and Selection: A Data Mining Perspective
722 Citations1999MTW, Huan Liu +1 more
This book can be used by researchers and graduate students in machine learning, data mining, and knowledge discovery, who wish to understand techniques of feature extraction, construction and selection for data pre-processing and to solve large size, real-world problems.
National Conference on Artificial IntelligenceLearning with many irrelevant features
611 Citations1991Hussein Almuallim, Thomas G. Dietterich
It is demonstrated that CaS protects against oxidative stress‐induced keratinocyte cell death in part through the activation of Nrf2‐mediated HO‐1 induction via the PI3K/Akt and/or PKC pathways, but not MAPK signaling.
Feature Extraction, Construction and Selection
553 Citations1998Huan Liu, Hiroshi Motoda
A Primer on Wavelets and Their Scientific Applications
527 Citations2010James S. Walker
Humana Press eBooksDetecting Stable Clusters Using Principal Component Analysis
250 Citations2003Asa Ben‐Hur, Isabelle Guyon
This chapter extends the stability-based validation of cluster structure, and proposes stability as a figure of merit that is useful for comparing clustering solutions, thus helping in making these choices.
BioinformaticsCLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts
203 Citations2001Eric P. Xing, Richard M. Karp
CLIFF, an algorithm for clustering biological samples using gene expression microarray data that outperforms standard clustering approaches that do not consider the feature selection issue, and produces a result that is very close to the original expert labeling of the sample set.
On Feature Selection: Learning with Exponentially Many Irrelevant Features as Training Examples
128 Citations1998Andrew Y. Ng
A rigorous bound for generalization error under feature selection in thewrap-per model of feature selection suggests that, in the presence of many \irrelevant" features, the main source of error in wrapper model feature selection is from hold-out or cross-validation data.