The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Spectral feature selection for supervised and unsupervised learning
Abstract
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied separately according to the type of learning: supervised or unsupervised. This work exploits intrinsic properties underlying supervised and unsupervised feature selection algorithms, and proposes a unified framework for feature selection based on spectral graph theory. The proposed framework is able to generate families of algorithms for both supervised and unsupervised feature selection. And we show that existing powerful algorithms such as ReliefF (supervised) and Laplacian Score (unsupervised) are special cases of the proposed framework. To the best of our knowledge, this work is the first attempt to unify supervised and unsupervised feature selection, and enable their joint study under a general framework. Experiments demonstrated the efficacy of the novel algorithms derived from the framework.
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
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 4×
“We show that two powerful feature selection algorithms, ReliefF ( Robnik-Sikonja & Kononenko, 2003 ) and Laplacian Score (He et al., 2005) are special cases of the proposed framework.”
MethodInfluentialToward 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-citationLaplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
Feature Selection for Unsupervised Learning
Dy, J., & Brodley, C. E. (2004) · doi:10.5555/1005332.1016787 · Cited by 885
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609407 · Cited by 849
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
“When the second evaluation criterion SPEC_score2( fi ) is used, SPEC is equivalent to the Laplacian Score.”
BackgroundMethodInfluentialSelf-citationMachine learning on big data: Opportunities and challenges
Zhou, L., Pan, S., Wang, J., & Vasilakos, A. V. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.026 · Cited by 1,228
Unsupervised feature selection for multi-cluster data
Cai, D., Zhang, C., & He, X. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835848 · Cited by 1,112
Whale optimization approaches for wrapper feature selection
Mafarja, M., & Mirjalili, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.006 · Cited by 825
Feature 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-citationA 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
A Review of Feature Selection and Its Methods
Venkatesh, B., & Anuradha, J. (2019) · Cybernetics and Information Technologies · doi:10.2478/cait-2019-0001 · Cited by 631
Miao, J., & Niu, L. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.07.111 · Cited by 564
Joint 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
Unsupervised Feature Selection Using Nonnegative Spectral Analysis
Li, Z., Yang, Y., Liu, J., Zhou, X., & Lu, H. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8289 · Cited by 508
Deep Learning for Change Detection in Remote Sensing Images: Comprehensive Review and Meta-Analysis
Khelifi, L., & Mignotte, M. (2020) · IEEE Access · doi:10.1109/access.2020.3008036 · Cited by 441
Mafarja, M., Aljarah, I., Heidari, A. A., Hammouri, A. I., Faris, H., Al-Zoubi, A. M., & Mirjalili, S. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.12.037 · Cited by 418
Feature Selection for Classification using Principal Component Analysis and Information Gain
Odhiambo Omuya, E., Onyango Okeyo, G., & Waema Kimwele, M. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114765 · Cited by 398
Binary grasshopper optimisation algorithm approaches for feature selection problems
Mafarja, M., Aljarah, I., Faris, H., Hammouri, A. I., Al-Zoubi, A. M., & Mirjalili, S. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.09.015 · Cited by 397
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
Feature selection with dynamic mutual information
Liu, H., Sun, J., Liu, L., & Zhang, H. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2008.10.028 · Cited by 373
Self-citationFeature Selection for Clustering: A Review
Alelyani, S., Tang, J., & Liu, H. (2018) · Data Clustering · doi:10.1201/9781315373515-2 · Cited by 371
Self-citationRobust Structured Subspace Learning for Data Representation
Li, Z., Liu, J., Tang, J., & Lu, H. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2400461 · Cited by 353
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
Unsupervised Feature Selection with Structured Graph Optimization
Nie, F., Zhu, W., & Li, X. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10168 · Cited by 321
Feature selection with multi-view data: A survey
Zhang, R., Nie, F., Li, X., & Wei, X. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.019 · Cited by 313
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-citationClustering-Guided Sparse Structural Learning for Unsupervised Feature Selection
Li, Z., Liu, J., Yang, Y., Zhou, X., & Lu, H. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.65 · Cited by 303
An improved approximation algorithm for the column subset selection problem
Boutsidis, C., Mahoney, M. W., & Petros Drineas, B. (2009) · doi:10.5555/1496770.1496875 · Cited by 286
Efficient 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-citationOnline Feature Selection and Its Applications
Wang, J., Zhao, P., Hoi, S. C. H., & Jin, R. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.32 · Cited by 275
An Evolutionary Multitasking-Based Feature Selection Method for High-Dimensional Classification
Chen, K., Xue, B., Zhang, M., & Zhou, F. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3042243 · Cited by 263
Global and Local Structure Preservation for Feature Selection
Liu, X., Wang, L., Zhang, J., Yin, J., & Liu, H. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2287275 · Cited by 256
Self-citationBinary biogeography-based optimization based SVM-RFE for feature selection
Albashish, D., Hammouri, A. I., Braik, M., Atwan, J., & Sahran, S. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.107026 · Cited by 154
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Massively parallel feature selection: an approach based on variance preservation
Zhao, Z., Zhang, R., Cox, J., Duling, D., & Sarle, W. (2013) · Machine Learning · doi:10.1007/s10994-013-5373-4 · Cited by 85
Self-citationLiang, C., Wang, L., Liu, L., Zhang, H., & Guo, F. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109632 · Cited by 72
Isolation-based feature Selection for Unsupervised Outlier Detection
Yang, Q., Singh, J., & Lee, J. (2019) · Annual Conference of the PHM Society · doi:10.36001/phmconf.2019.v11i1.824 · Cited by 19
“Among these limited set of studies, most of them specifically focused on clustering problems; most notable among them being spectral feature selection (SPEC) (Zhao & Liu, 2007).”
Background
Metadata
- Authors
- Zhao, Z., & Liu, H.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 1151-1157
- OpenAlex
- W2158933803
- Cited by
- 906
- References
- 16
- FWCI
- 14.51
- Type
- conference paper
- 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.