Authors: Le Song , Alexander J. Smola , Arthur Gretton , Justin Bedo , Karsten M. Borgwardt - Journal of Machine Learning Research, JMLR 2012 cited by 346
We introduce a framework for feature selection based on dependence maximization between the selected features and the labels of an estimation problem, using the Hilbert-Schmidt Independence Criterion. The key idea is that good features should be highly dependent on the labels. Our approach leads to a greedy procedure for feature selection. We show that a number of existing feature selectors are special cases of this framework. Experiments on both artificial and real-world data show that our feature selector works well in practice.
✨ Checking sign-in… PDF Cited by View BibTeX Hide BibTeX View BibTeX Cite
Gene Selection for Cancer Classification… Gene Selection for Cancer Classification using Support Vector Machines Cross-platform analysis of cancer microarray… Cross-platform analysis of cancer microarray data improves gene expression based classification of phenotypes Measuring Statistical Dependence with… Measuring Statistical Dependence with Hilbert-Schmidt Norms A Kernel Method for the Two-Sample Problem A Kernel Method for the Two-Sample Problem Integrating structured biological data by… Integrating structured biological data by Kernel Maximum Mean Discrepancy Thousands of samples are needed to generate a… Thousands of samples are needed to generate a robust gene list for predicting outcome in cancer Gene selection via the BAHSIC family of… Gene selection via the BAHSIC family of algorithms Supervised Feature Selection via Dependenc… Supervised Feature Selection via Dependence Estimation Kernel Measures of Conditional Dependence Kernel Measures of Conditional Dependence A Kernel Statistical Test of Independence A Kernel Statistical Test of Independence Kernel Choice and Classifiability for RKH… Kernel Choice and Classifiability for RKHS Embeddings of Probability Distributions Hilbert Space Embeddings and Metrics on… Hilbert Space Embeddings and Metrics on Probability Measures High-Dimensional Feature Selection by… High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso Global Sensitivity Analysis with Dependenc… Global Sensitivity Analysis with Dependence Measures Feature selection for Support Vector Machines… Feature selection for Support Vector Machines via Mixed Integer Linear Programming Subspace learning for unsupervised feature… Subspace learning for unsupervised feature selection via matrix factorization A Primer on Reproducing Kernel Hilbert Spaces A Primer on Reproducing Kernel Hilbert Spaces Sparse Hilbert Schmidt Independence Criterion… Sparse Hilbert Schmidt Independence Criterion and Surrogate-Kernel-Based Feature Selection for Hyperspectral Image Classification A Kernel Independence Test for Geographical… A Kernel Independence Test for Geographical Language Variation Feature selection by optimizing a lower boun… Feature selection by optimizing a lower bound of conditional mutual information Gaussian Processes and Kernel Methods: A Revie… Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences A Review of Microarray Datasets: Where to Find… A Review of Microarray Datasets: Where to Find Them and Specific Characteristics Multilabel Feature Extraction Algorithm vi… Multilabel Feature Extraction Algorithm via Maximizing Approximated and Symmetrized Normalized Cross-Covariance Operator Statistical developments for target and… Statistical developments for target and conditional sensitivity analysis: Application on safety studies for nuclear reactor Feature Selection via Dependence Maximization Feature Selection via Dependence Maximization Earlier references Focus paper Citing papers Older Newer Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.