The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Feature Selection for Clustering: A Review
Abstract
Dimensionality reduction techniques can be categorized mainly into feature extraction and feature selection. In the feature extraction approach, features are projected into a new space with lower dimensionality. Feature selection is broadly categorized into four models: filter model, wrapper model, embedded model, and hybrid model. With the existence of a large number of features, learning models tend to overfit and their learning performance degenerates. Feature selection is one of the most used techniques to reduce dimensionality among practitioners. The existence of irrelevant features in the data set may degrade learning quality and consume more memory and computational time that could be saved if these features were removed. However, finding clusters in high-dimensional space is computationally expensive and may degrade the learning performance. Clustering is useful in several machine learning and data mining tasks including image segmentation, information retrieval, pattern recognition, pattern classification, and network analysis.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
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
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
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
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
(1998) · Cited by 3,476
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
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
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
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-citationFeature 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-citationFeature 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
Efficient 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
A Framework for Clustering Evolving Data Streams
Aggarwal, C. C., Yu, P. S., Han, J., & Wang, J. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50016-1 · Cited by 1,808
Unsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460
Computational Methods of Feature Selection
(2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796 · Cited by 1,271
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
A Statistical Approach to Mechanized Encoding and Searching of Literary Information
Luhn, H. P. (1957) · IBM Journal of Research and Development · doi:10.1147/rd.14.0309 · Cited by 1,093
Feature Selection via Concave Minimization and Support Vector Machines
Bradley, P. S., & Mangasarian, O. L. (1998) · Cited by 984
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-citationFast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304188 · Cited by 900
Feature Selection for Unsupervised Learning
Dy, J., & Brodley, C. E. (2004) · doi:10.5555/1005332.1016787 · Cited by 885
Relational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799 · cited 1×
“Social Dimension Regularization: In [65], social dimension is introduced to improve the performance of relational learning.”
BackgroundSelf-citationWettschereck, D., Aha, D. W., & Mohri, T. (1997) · Artificial Intelligence Review · doi:10.1023/a:1006593614256 · Cited by 717
A framework for feature selection in clustering
Witten, D. M., & Tibshirani, R. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09415 · Cited by 696 · cited 4×
“This framework can be applied to any similarity-based clustering technique, yet, they used k-means clustering in [71].”
BackgroundMethodInfluentialUse 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
A probabilistic approach to feature selection - a filter solution
Liu, H., & Setiono, R. (1996) · Cited by 665
Self-citationAn Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Jing, L., Ng, M. K., & Huang, J. Z. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1048 · Cited by 625
Frequent term-based text clustering
Beil, F. W., Ester, M., & Xu, X. (2002) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775110 · Cited by 531
A Framework for Projected Clustering of High Dimensional Data Streams
Aggarwal, C. C., Han, J., Wang, J., & Yu, P. S. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50075-9 · Cited by 519
Text categorization with support vector machines
Joachims, T. (1997) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-5097 · Cited by 507
Hierarchical Document Clustering Using Frequent Itemsets
Fung, B. C. M., Wang, K., & Ester, M. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.6 · Cited by 471
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
ON AUTOMATIC FEATURE SELECTION
SIEDLECKI, W., & SKLANSKY, J. (1988) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001488000145 · Cited by 392
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 for clustering - a filter solution
Dash, M., Choi, K., Scheuermann, P., & Liu, H. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183893 · Cited by 383
Self-citationFeature Weighting in k-Means Clustering
Modha, D. S., & Spangler, W. S. (2003) · Machine Learning · doi:10.1023/a:1024016609528 · Cited by 382
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
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 clustering for multi-type relational data
Long, B., Zhang, Z. (., Wú, X., & Yu, P. S. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143918 · Cited by 251
Feature Subset Selection and Order Identification for Unsupervised Learning
Dy, J., & Brodley, C. E. (2000) · Cited by 234
Unsupervised feature selection for linked social media data
Tang, J., & Liu, H. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339673 · Cited by 195
Self-citationUnsupervised Feature Selection for the k-means Clustering Problem
Boutsidis, C., Petros Drineas, B., & Mahoney, M. W. (2009) · neural information processing systems · Cited by 191
Sparse Multinomial Logistic Regression via Bayesian L1 Regularisation
Cawley, G. C., Talbot, N. L. C., & Girolami, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0031 · Cited by 189
Text Clustering with Feature Selection by Using Statistical Data
Li, Y., Luo, C., & Chung, S. M. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190740 · Cited by 183
Liu, H., & Motoda, H. (2007) · Chapman & Hall/CRC eBooks · Cited by 182
Self-citationLinkage and Autocorrelation Cause Feature Selection Bias in Relational Learning
Jensen, D. D., & Neville, J. (2002) · Cited by 167
Feature Selection in Clustering Problems
Röth, V., & Lange, T. (2003) · neural information processing systems · Cited by 163
Feature selection for DNA methylation based cancer classification
Model, F., Adorján, P., Olek, A., & Piepenbrock, C. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.suppl_1.s157 · Cited by 147
Feature Selection with Linked Data in Social Media
Tang, J., & Liu, H. (2012) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.11 · Cited by 138
Self-citationSpectral Feature Selection for Data Mining
Zhao, Z., & Liu, H. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b11426 · Cited by 133
Self-citationDeveloping a feature weight self-adjustment mechanism for a K-means clustering algorithm
Tsai, C.-Y., & Chiu, C.-C. (2008) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2008.03.002 · Cited by 129
On Feature Selection: Learning with Exponentially Many Irrelevant Features as Training Examples
Ng, A. Y. (1998) · Cited by 124
Text clustering using frequent itemsets
Zhang, W., Yoshida, T., Tang, X., & Wang, Q. (2010) · Knowledge-Based Systems · doi:10.1016/j.knosys.2010.01.011 · Cited by 124
Evolutionary model selection in unsupervised learning
Kim, Y., Street, W. N., & Menczer, F. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6605 · Cited by 122
A probabilistic framework for relational clustering
Long, B., Zhang, Z. M., & Yu, P. S. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281244 · Cited by 121
Unsupervised Feature Selection
Dy, J. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796-9 · Cited by 78
The Effect of the Characteristics of the Dataset on the Selection Stability
Alelyani, S., Liu, H., & Wang, L. (2011) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2011.167 · Cited by 46
Self-citationText stream clustering algorithm based on adaptive feature selection
Gong, L., Zeng, J., & Zhang, S. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.07.041 · Cited by 38
RELIEF-C: Efficient Feature Selection for Clustering over Noisy Data
Dash, M., & Ong, Y.-S. (2011) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2011.135 · Cited by 22
Quantifying Features Using False Nearest Neighbors: An Unsupervised Approach
Filho, J. A. A., de Carvalho, A. C. P. L. F., de Mello, R. F., Alelyani, S., & Liu, H. (2011) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2011.170 · Cited by 6
Self-citation
Cited by
Unsupervised deep embedding for clustering analysis
Xie, J., Girshick, R., & Farhadi, A. (2015) · arXiv · doi:10.48550/arxiv.1511.06335 · Cited by 2,476
Feature selection in machine learning: A new perspective
Cai, J., Luo, J., Wang, S., & Yang, S. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.11.077 · Cited by 2,061
A review of feature selection methods with applications
Jovic, A., Brkic, K., & Bogunovic, N. (2015) · 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) · doi:10.1109/mipro.2015.7160458 · Cited by 1,209
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
Self-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-citation
Metadata
- Authors
- Alelyani, S., Tang, J., & Liu, H.
- Venue
- Data Clustering
- Publisher
- Chapman and Hall/CRC
- Published
- 2018-09-03
- Pages
- 29-60
- OpenAlex
- W2398336627
- Cited by
- 371
- References
- 68
- FWCI
- 63.21
- Type
- book chapter
- 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.