The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
On Similarity Preserving Feature Selection
Abstract
In the literature of feature selection, different criteria have been proposed to evaluate the goodness of features. In our investigation, we notice that a number of existing selection criteria implicitly select features that preserve sample similarity, and can be unified under a common framework. We further point out that any feature selection criteria covered by this framework cannot handle redundant features, a common drawback of these criteria. Motivated by these observations, we propose a new "Similarity Preserving Feature Selection” framework in an explicit and rigorous way. We show, through theoretical analysis, that the proposed framework not only encompasses many widely used feature selection criteria, but also naturally overcomes their common weakness in handling feature redundancy. In developing this new framework, we begin with a conventional combinatorial optimization formulation for similarity preserving feature selection, then extend it with a sparse multiple-output regression formulation to improve its efficiency and effectiveness. A set of three algorithms are devised to efficiently solve the proposed formulations, each of which has its own advantages in terms of computational complexity and selection performance. As exhibited by our extensive experimental study, the proposed framework achieves superior feature selection performance and attractive properties.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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
(1992) · Cited by 23,431
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
A review of feature selection techniques in bioinformatics
Saeys, Y., Inza, I., & Larrañaga, P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm344 · Cited by 5,244
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
(1998) · Cited by 3,476
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250598 · Cited by 3,031
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
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 2,978
Estimating attributes: Analysis and extensions of RELIEF
Kononenko, I. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-57868-4_57 · Cited by 2,958
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Self-citationIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
An extensive empirical study of feature selection metrics for text classification
Forman, G. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944974 · Cited by 2,394
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Self-citationFeature 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-citationLaplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
Measuring Statistical Dependence with Hilbert-Schmidt Norms
Gretton, A., Bousquet, O., Smola, A., & Schölkopf, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564089_7 · Cited by 1,560
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
Neighborhood preserving embedding
He, X., Cai, D., Yan, S., & Zhang, H.-J. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.167 · Cited by 1,502
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-citationFeature Selection for Unsupervised Learning
Dy, J., & Brodley, C. E. (2004) · doi:10.5555/1005332.1016787 · Cited by 885
Cox, T., & Cox, M. (2000) · Chapman & Hall/CRC eBooks · doi:10.1201/9780367801700 · Cited by 745
Use 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
Cox, M. A. A., & Cox, T. F. (2008) · Handbook of Data Visualization · doi:10.1007/978-3-540-33037-0_14 · Cited by 579
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
Self-citationMinimum 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
Probability and Statistics for Engineers and Scientists
Ziegel, E. R., Walpole, R., & Myers, R. (1994) · Technometrics · doi:10.2307/1269224 · Cited by 467
Discriminative Semi-Supervised Feature Selection Via Manifold Regularization
Xu, Z., King, I., Lyu, M. R.-T., & Jin, R. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2047114 · Cited by 384
Trace ratio criterion for feature selection
Nie, F., Xiang, S., Jia, Y., Zhang, C., & Yan, S. (2008) · Cited by 356
Feature selection via dependence maximization
Song, L., Smola, A. J., Gretton, A., Bedő, J., & Borgwardt, K. M. (2012) · Journal of Machine Learning Research · doi:10.5555/2188385.2343691 · Cited by 346
Semi-supervised Feature Selection via Spectral Analysis
Zhao, Z., & Liu, H. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.75 · Cited by 311
Self-citationSpectral Methods for Dimensionality Reduction
Saul, L. K., Weinberger, K. Q., Sha, F., Ham, J., & Lee, D. D. (2006) · Semi-Supervised Learning · doi:10.7551/mitpress/6173.003.0022 · Cited by 272
Unsupervised feature selection applied to content-based retrieval of lung images
Dy, J. G., Brodley, C. E., Kak, A., Broderick, L. S., & Aisen, A. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1182100 · Cited by 255
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Cai, D., He, X., & Han, J. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.89 · Cited by 212
Structure preserving embedding
Shaw, B., & Jebara, T. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553494 · Cited by 200
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753670 · Cited by 189
Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization.
Weinberger, K. Q., Packer, B., & Saul, L. K. (2005) · Cited by 151
TMG: A MATLAB Toolbox for Generating Term-Document Matrices from Text Collections
Zeimpekis, D., & Gallopoulos, E. (2006) · Springer eBooks · doi:10.1007/3-540-28349-8_7 · Cited by 131
EFFICIENT METHODS IN CONVEX PROGRAMMING
Nemirovski, A. S. (2007) · Cited by 114
Feature Weighting for Lazy Learning Algorithms
Aha, D. W. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5725-8_2 · Cited by 114
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
Self-citationRedundant 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
Cited by
A review of unsupervised feature selection methods
Solorio-Fernández, S., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09682-y · Cited by 648
Graph Learning for Multiview Clustering
Zhan, K., Zhang, C., Guan, J., & Wang, J. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2751646 · Cited by 543
Feature selection for text classification: A review
Deng, X., Li, Y., Weng, J., & Zhang, J. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6083-5 · Cited by 351
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Unsupervised feature selection by regularized self-representation
Zhu, P., Zuo, W., Zhang, L., Hu, Q., & Shiu, S. C. K. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.08.006 · Cited by 323
Metadata
- Authors
- Zhao, Z., Wang, L., Liu, H., & Ye, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2013-03
- Volume
- 25
- Issue
- 3
- Pages
- 619-632
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2132379769
- Cited by
- 312
- References
- 53
- FWCI
- 10.57
- Type
- journal article
- Language
- en
- Open access
- closed
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.