Feature Selection via Dependence Maximization

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.

Gene Selection forCancer Classification…Gene Selection for Cancer Classification using Support Vector MachinesCross-platform analysisof cancer microarray…Cross-platform analysis of cancer microarray data improves gene expression based classification of phenotypesMeasuring StatisticalDependence with…Measuring Statistical Dependence with Hilbert-Schmidt NormsA Kernel Method for theTwo-Sample ProblemA Kernel Method for the Two-Sample ProblemIntegrating structuredbiological data by…Integrating structured biological data by Kernel Maximum Mean DiscrepancyThousands of samples areneeded to generate a…Thousands of samples are needed to generate a robust gene list for predicting outcome in cancerGene selection via theBAHSIC family of…Gene selection via the BAHSIC family of algorithmsSupervised FeatureSelection via Dependenc…Supervised Feature Selection via Dependence EstimationKernel Measures ofConditional DependenceKernel Measures of Conditional DependenceA Kernel StatisticalTest of IndependenceA Kernel Statistical Test of IndependenceKernel Choice andClassifiability for RKH…Kernel Choice and Classifiability for RKHS Embeddings of Probability DistributionsHilbert Space Embeddingsand Metrics on…Hilbert Space Embeddings and Metrics on Probability MeasuresHigh-Dimensional FeatureSelection by…High-Dimensional Feature Selection by Feature-Wise Kernelized LassoGlobal SensitivityAnalysis with Dependenc…Global Sensitivity Analysis with Dependence MeasuresFeature selection forSupport Vector Machines…Feature selection for Support Vector Machines via Mixed Integer Linear ProgrammingSubspace learning forunsupervised feature…Subspace learning for unsupervised feature selection via matrix factorizationA Primer on ReproducingKernel Hilbert SpacesA Primer on Reproducing Kernel Hilbert SpacesSparse Hilbert SchmidtIndependence Criterion…Sparse Hilbert Schmidt Independence Criterion and Surrogate-Kernel-Based Feature Selection for Hyperspectral Image ClassificationA Kernel IndependenceTest for Geographical…A Kernel Independence Test for Geographical Language VariationFeature selection byoptimizing a lower boun…Feature selection by optimizing a lower bound of conditional mutual informationGaussian Processes andKernel Methods: A Revie…Gaussian Processes and Kernel Methods: A Review on Connections and EquivalencesA Review of MicroarrayDatasets: Where to Find…A Review of Microarray Datasets: Where to Find Them and Specific CharacteristicsMultilabel FeatureExtraction Algorithm vi…Multilabel Feature Extraction Algorithm via Maximizing Approximated and Symmetrized Normalized Cross-Covariance OperatorStatistical developmentsfor target and…Statistical developments for target and conditional sensitivity analysis: Application on safety studies for nuclear reactorFeature Selection viaDependence MaximizationFeature Selection via Dependence MaximizationEarlier referencesFocus paperCiting papersOlderNewer

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.