The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Global and Local Structure Preservation for Feature Selection
Open accessAbstract
The recent literature indicates that preserving global pairwise sample similarity is of great importance for feature selection and that many existing selection criteria essentially work in this way. In this paper, we argue that besides global pairwise sample similarity, the local geometric structure of data is also critical and that these two factors play different roles in different learning scenarios. In order to show this, we propose a global and local structure preservation framework for feature selection (GLSPFS) which integrates both global pairwise sample similarity and local geometric data structure to conduct feature selection. To demonstrate the generality of our framework, we employ methods that are well known in the literature to model the local geometric data structure and develop three specific GLSPFS-based feature selection algorithms. Also, we develop an efficient optimization algorithm with proven global convergence to solve the resulting feature selection problem. A comprehensive experimental study is then conducted in order to compare our feature selection algorithms with many state-of-the-art ones in supervised, unsupervised, and semisupervised learning scenarios. The result indicates that: 1) our framework consistently achieves statistically significant improvement in selection performance when compared with the currently used algorithms; 2) in supervised and semisupervised learning scenarios, preserving global pairwise similarity is more important than preserving local geometric data structure; 3) in the unsupervised scenario, preserving local geometric data structure becomes clearly more important; and 4) the best feature selection performance is always obtained when the two factors are appropriately integrated. In summary, this paper not only validates the advantages of the proposed GLSPFS framework but also gains more insight into the information to be preserved in different feature selection tasks.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
(2006) · Cited by 3,624
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Face recognition using Laplacianfaces
He, X., Yan, S., Hu, Y., Niyogi, P., & Zhang, H.-J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.55 · Cited by 3,264
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 · cited 1×
“The local geometric structure can be captured by building a graph, where each sample is treated as a node, and an edge is put between two samples if they are neighbors.”
BackgroundIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · neural information processing systems · Cited by 2,231
Feature selection: evaluation, application, and small sample performance
Jain, A., & Zongker, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.574797 · Cited by 2,171
Laplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
Feature selection, L 1 vs. L 2 regularization, and rotational invariance
Ng, A. Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015435 · Cited by 1,572
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
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
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
1-norm Support Vector Machines
Zhu, J., Rosset, S., Tibshirani, R. J., & Hastie, T. J. (2003) · Cited by 797
Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis
SugiyamaMasashi (2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248694 · Cited by 703
Think Globally, Fit Locally : Unsupervised Learning of Low Dimensional Manifolds
Saul, L. K., Roweis, S. T., & Singer, Y. (2003) · ScholarlyCommons (University of Pennsylvania) · Cited by 568
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
Yang, J., Zhang, D., Yang, J.-Y., & Niu, B. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1008 · Cited by 497
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 495
Discriminative Least Squares Regression for Multiclass Classification and Feature Selection
Xiang, S., Nie, F., Meng, G., Pan, C., & Zhang, C. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2212721 · Cited by 473
Structured Variable Selection with Sparsity-Inducing Norms
Jenatton, R., Audibert, J.-Y., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3523 · Cited by 431
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
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
Sun, Y., Todorovic, S., & Goodison, S. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.190 · Cited by 347
On Similarity Preserving Feature Selection
Zhao, Z., Wang, L., Liu, H., & Ye, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.222 · Cited by 312
Self-citationSemi-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-citationEfficient Spectral Feature Selection with Minimum Redundancy
Zhao, Z., Wang, L., & Liu, H. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7671 · Cited by 277
Self-citationAn introduction to nonlinear dimensionality reduction by maximum variance unfolding
Weinberger, K. Q., & Saul, L. K. (2006) · Cited by 247
Linear local tangent space alignment and application to face recognition
Zhang, T., Yang, J., Zhao, D., & Ge, X. (2007) · Neurocomputing · doi:10.1016/j.neucom.2006.11.007 · Cited by 246
Joint Feature Selection and Subspace Learning
Gu, Q., Li, Z., & Han, J. (2011) · Cited by 226
Locality sensitive semi-supervised feature selection
Zhao, J., Lu, K., & He, X. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.06.014 · Cited by 191
Gradient LASSO for feature selection
Kim, Y., & Kim, J. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015364 · Cited by 89
Locality-Preserved Maximum Information Projection
Wang, H., Chen, S., Hu, Z., & Zheng, W. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.910733 · Cited by 81
Feature Selection Using Probabilistic Prediction of Support Vector Regression
Yang, J.-B., & Ong, C. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2128342 · Cited by 57
Efficient linear discriminant analysis with locality preserving for face recognition
Shu, X., Gao, Y., & Lu, H. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.11.012 · Cited by 54
Multiclass Feature Selection With Kernel Gram-Matrix-Based Criteria
Ramona, M., Gaël Richard, A., & David, B. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2201748 · Cited by 53
Discovering Support and Affiliated Features from Very High DimensionsPreprint
Zhai, Y., Tan, M., Tsang, I. W.-H., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6477 · Cited by 30
A Discrimination Analysis for Unsupervised Feature Selection via Optic Diffraction Principle
Padungweang, P., Lursinsap, C., & Sunat, K. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2208269 · Cited by 26
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…”
BackgroundMethodSelf-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-citationCucumber leaf disease identification with global pooling dilated convolutional neural network
Zhang, S., Zhang, S., Zhang, C., Wang, X., & Shi, Y. (2019) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2019.03.012 · Cited by 354
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
Multiple Kernel k-means with Incomplete Kernels
Liu, X., Gao, W., Zhu, X., Li, M., Wang, L., Zhu, E., Liu, T., Kloft, M., Shen, D., & Yin, J. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2892416 · Cited by 300
Self-citation
Metadata
- Authors
- Liu, X., Wang, L., Zhang, J., Yin, J., & Liu, H.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2014-06
- Volume
- 25
- Issue
- 6
- Pages
- 1083-1095
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2168901348
- Cited by
- 256
- References
- 46
- FWCI
- 13.38
- Type
- journal article
- Language
- en
- Open access
- green
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.