The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Efficient Spectral Feature Selection with Minimum Redundancy
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Least Squares Support Vector Machine Classifiers
Suykens, J. A. K., & Vandewalle, J. (1999) · Neural Processing Letters · doi:10.1023/a:1018628609742 · Cited by 9,362
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
(1998) · Cited by 3,476
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025
MINIMUM REDUNDANCY FEATURE SELECTION FROM MICROARRAY GENE EXPRESSION DATA
DING, C., & PENG, H. (2005) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720005001004 · Cited by 2,751
Duda, R. O., Hart, P. E., & Stork, D. G. (2001) · Cited by 2,463
Feature Selection for Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Self-citationEfficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
Self-citationLaplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
Spectral feature selection for supervised and unsupervised learning
Zhao, Z., & Liu, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273641 · Cited by 906
Self-citationUse of the zero norm with linear models and kernel methods
Weston, J., Elisseeff, A., Schölkopf, B., & Tipping, M. (2003) · MPG.PuRe (Max Planck Society) · doi:10.5555/944919.944982 · Cited by 688
Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization
Liu, J., Ji, S., & Ye, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2631 · Cited by 555
Minimum redundancy feature selection from microarray gene expression data
Ding, C., & Peng, H. (2004) · Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003 · doi:10.1109/csb.2003.1227396 · Cited by 506
Supervised feature selection via dependence estimation
Song, L., Smola, A., Gretton, A., Borgwardt, K. M., & Bedo, J. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273600 · Cited by 379
Trace ratio criterion for feature selection
Nie, F., Xiang, S., Jia, Y., Zhang, C., & Yan, S. (2008) · Cited by 356
Bayesian Inference and Optimal Design for the Sparse Linear Model
Seeger, M. (2008) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/1390681.1390707 · Cited by 277
Gabrilovich, E., & Markovitch, S. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015388 · Cited by 199
A least squares formulation for a class of generalized eigenvalue problems in machine learning
Sun, L., Ji, S., & Ye, J. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553499 · Cited by 49
Redundant feature elimination for multi-class problems
Appice, A., Ceci, M., Rawles, S., & Flach, P. A. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015397 · Cited by 47
Relevant and Redundant Feature Analysis with Ensemble Classification
Duangsoithong, R., & Windeatt, T. (2009) · International Conference on Advances in Pattern Recognition · doi:10.1109/icapr.2009.36 · Cited by 23
High-dimensional support union recovery in multivariate regression
Obozinski, G., Wainwright, M. J., & Jordan, M. I. (2008) · Cited by 21
Cited by
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
“Many `2,1-norm regularization based feature selection methods have been proposed over the past decade [Zhao et al. 2010; Gu et al. 2011c; Yang et al. 2011; Hou et al. 2011; Li et al. 2012; Qian and Zhai 2013; Shi et al. 2014; Liu et al. 2014; Du and Shen 2015; Jian et al. 2016; Liu et al. 2016b; Nie et al. 2016; Zhu e…”
BackgroundSelf-citationFeature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
Self-citationJoint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature Selection
Hou, C., Nie, F., Li, X., Yi, D., & Wu, Y. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2272642 · Cited by 554
l 2,1 -norm regularized discriminative feature selection for unsupervised learning
Yang, Y. P., Shen, H. T., Ma, Z., Huang, Z. H., & Zhou, X. (2011) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5591/978-1-57735-516-8/ijcai11-267 · Cited by 549
A Survey on semi-supervised feature selection methods
Sheikhpour, R., Sarram, M. A., Gharaghani, S., & Chahooki, M. A. Z. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2016.11.003 · Cited by 505
Metadata
- Authors
- Zhao, Z., Wang, L., & Liu, H.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2010-07-03
- Volume
- 24
- Issue
- 1
- Pages
- 673-678
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W1607408214
- Cited by
- 277
- References
- 29
- FWCI
- 12.37
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.