Efficient Spectral Feature Selection with Minimum Redundancy
Date
2010
Authors
Zhao, Zheng
Wang, Lei
Liu, Huan
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press
Abstract
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 L 2,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.
Description
Keywords
Keywords: Adverse effect; Efficient path; Feature redundancy; Learning performance; Multi-output; Optimal solutions; Real-world application; Redundant features; Spectral feature; Unsupervised feature selection; Algorithms; Artificial intelligence; Quality assurance
Citation
Collections
Source
Proceedings of National Conference on Artificial Intelligence (AAAI 2010)
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description