Efficient Spectral Feature Selection with Minimum Redundancy

Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and unsupervised feature selection, and has been proven to be effective in many real-world applications. One common drawback associated with most existing spectral feature selection algorithms is that they evaluate features individually and cannot identify redundant features. Since redundant features can have significant adverse effect on learning performance, it is necessary to address this limitation for spectral feature selection. To this end, we propose a novel spectral feature selection algorithm to handle feature redundancy, adopting an embedded model. The algorithm is derived from a formulation based on a sparse multi-output regression with a L2,1-norm constraint. We conduct theoretical analysis on the properties of its optimal solutions, paving the way for designing an efficient path-following solver. Extensive experiments show that the proposed algorithm can do well in both selecting relevant features and removing redundancy.

The Elements ofStatistical Learning…The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd EditionAn introduction tovariable and feature…An introduction to variable and feature selectionAn Introduction toVariable and Feature…An Introduction to Variable and Feature Selection.Efficient FeatureSelection via Analysis…Efficient Feature Selection via Analysis of Relevance and RedundancyConvex OptimizationConvex OptimizationLaplacian Score forFeature SelectionLaplacian Score for Feature SelectionSpectral featureselection for supervise…Spectral feature selection for supervised and unsupervised learningConvex multi-taskfeature learningConvex multi-task feature learningA Tutorial on SpectralClusteringA Tutorial on Spectral ClusteringSupervised FeatureSelection via Dependenc…Supervised Feature Selection via Dependence EstimationTrace Ratio Criterionfor Feature SelectionTrace Ratio Criterion for Feature SelectionMulti-Task FeatureLearning Via Efficient…Multi-Task Feature Learning Via Efficient l2, 1-Norm MinimizationFeature Selection viaJoint Embedding Learnin…Feature Selection via Joint Embedding Learning and Sparse RegressionUnsupervised featureselection for linked…Unsupervised feature selection for linked social media dataRobust UnsupervisedFeature SelectionRobust Unsupervised Feature SelectionJoint Embedding Learningand Sparse Regression…Joint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature SelectionUnsupervised featureselection by regularize…Unsupervised feature selection by regularized self-representationEmbedded UnsupervisedFeature SelectionEmbedded Unsupervised Feature SelectionUnsupervised FeatureSelection with Adaptive…Unsupervised Feature Selection with Adaptive Structure LearningNon-convex RegularizedSelf-representation for…Non-convex Regularized Self-representation for Unsupervised Feature SelectionRobust graph regularizedunsupervised feature…Robust graph regularized unsupervised feature selectionSubspace clusteringguided unsupervised…Subspace clustering guided unsupervised feature selectionRobust unsupervisedfeature selection via…Robust unsupervised feature selection via dual self-representation and manifold regularizationA systematic evaluationof filter Unsupervised…A systematic evaluation of filter Unsupervised Feature Selection methodsEfficient SpectralFeature Selection with…Efficient Spectral Feature Selection with Minimum Redundancy過去の参考文献中心の論文この論文を引用する論文古い新しい

ノードをクリックするとフォーカスを固定、空白をクリックすると本論文に戻ります。ホバーで一時的にプレビューできます。各ノードのページはタイトルから開けます。