Title Feature selection in a kernel space
Authors Cao, Bin
Shen, Dou
Sun, Jian-Tao
Yang, Qiang
Chen, Zheng
Affiliation Peking University, Beijing, China
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Microsoft Research Asia, 49 Zhichun Road, Beijing, China
Issue Date 2007
Citation 24th International Conference on Machine Learning, ICML 2007.Corvalis, OR, United states,227(121-128).
Abstract We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult problem because the dimension of a kernel space may be infinite. In the past, little work has been done on feature selection in a kernel space. To solve this problem, we derive a basis set in the kernel space as a first step for feature selection. Using the basis set, we then extend the margin-based feature selection algorithms that are proven effective even when many features are dependent. The selected features form a subspace of the kernel space, in which different state-of-the-art classification algorithms can be applied for classification. We conduct extensive experiments over real and simulated data to compare our proposed method with four baseline algorithms. Both theoretical analysis and experimental results validate the effectiveness of our proposed method.
URI http://hdl.handle.net/20.500.11897/302736
DOI 10.1145/1273496.1273512
Indexed EI
Appears in Collections: 待认领

Files in This Work
There are no files associated with this item.

Web of Science®


0

Checked on Last Week

Scopus®



Checked on Current Time

百度学术™


0

Checked on Current Time

Google Scholar™





License: See PKU IR operational policies.