Unsupervised feature selection for multi-cluster data
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
In many data analysis tasks, one is often confronted with very high dimensional data. Feature selection techniques are designed to find the relevant feature subset of the original features which can facilitate clustering, classification and retrieval. In this paper, we consider the feature selection problem in unsupervised learning scenario, which is particularly difficult due to the absence of class labels that would guide the search for relevant information. The feature selection problem is essentially a combinatorial optimization problem which is computationally expensive. Traditional unsupervised feature selection methods address this issue by selecting the top ranked features based on certain scores computed independently for each feature. These approaches neglect the possible correlation between different features and thus can not produce an optimal feature subset. Inspired from the recent developments on manifold learning and L1-regularized models for subset selection, we propose in this paper a new approach, called Multi-Cluster Feature Selection (MCFS), for unsupervised feature selection. Specifically, we select those features such that the multi-cluster structure of the data can be best preserved. The corresponding optimization problem can be efficiently solved since it only involves a sparse eigen-problem and a L1-regularized least squares problem. Extensive experimental results over various real-life data sets have demonstrated the superiority of the proposed algorithm.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
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
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
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
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
“MCFS consists of three steps.”
MethodInfluentialFeature 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
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
Supervised, Unsupervised, and Semi-Supervised Feature Selection: A Review on Gene Selection
Ang, J. C., Mirzal, A., Haron, H., & Hamed, H. N. A. (2016) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2478454 · Cited by 641
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
Feature selection techniques for machine learning: a survey of more than two decades of research
Theng, D., & Bhoyar, K. K. (2024) · Knowledge and Information Systems · doi:10.1007/s10115-023-02010-5 · Cited by 510
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
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
RolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Feature Selection for Clustering: A Review
Alelyani, S., Tang, J., & Liu, H. (2018) · Data Clustering · doi:10.1201/9781315373515-2 · Cited by 371
Robust 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
A Survey of Signed Network Mining in Social Media
Tang, J., Chang, Y., Aggarwal, C., & Liu, H. (2017) · ACM Computing Surveys · doi:10.1145/2956185 · Cited by 342
Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection
Zhu, X., Li, X., Zhang, S., Ju, C., & Wu, X. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2521602 · Cited by 339
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
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
Zakeri, H., Nejad, F. M., & Fahimifar, A. (2017) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-016-9194-z · Cited by 304
Clustering-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
Infinite Latent Feature Selection: A Probabilistic Latent Graph-Based Ranking Approach
Roffo, G., Melzi, S., Castellani, U., & Vinciarelli, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.156 · Cited by 257
Cluster analysis of acoustic emission signals for 2D and 3D woven glass/epoxy composites
Li, L., Lomov, S. V., Yan, X., & Carvelli, V. (2014) · Composite Structures · doi:10.1016/j.compstruct.2014.05.023 · Cited by 255
Mahato, S., & Paul, S. (2020) · Journal of Medical Systems · doi:10.1007/s10916-019-1486-z · Cited by 148
Cosmo: contrastive fusion learning with small data for multimodal human activity recognition
Ouyang, X., Shuai, X., Zhou, J., Shi, I. W., Xie, Z., Xing, G., & Huang, J. (2022) · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · doi:10.1145/3495243.3560519 · Cited by 94
Feature Selection Boosted by Unselected Features
Zheng, W., Chen, S., Fu, Z., Zhu, F., Yan, H., & Yang, J. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3058172 · Cited by 51
Qi, L., Zhong, F., Chen, Y., Mao, S., Yan, Z., & Ma, Y. (2020) · Journal of Pharmaceutical Analysis · doi:10.1016/j.jpha.2019.12.004 · Cited by 26
“Two unsupervised feature selection techniques of Laplacian Score (LS) [25] and UnsupervisedMulti-Cluster Feature Selection (U-MCFS) [26] were first applied.”
MethodInfluential
Metadata
- Authors
- Cai, D., Zhang, C., & He, X.
- Venue
- Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2010-07-25
- Pages
- 333-342
- OpenAlex
- W2128873747
- Cited by
- 1,112
- References
- 27
- FWCI
- 18.97
- 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.