The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional Data
Abstract
Feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. Based on these criteria, a fast clustering-based feature selection algorithm (FAST) is proposed and experimentally evaluated in this paper. The FAST algorithm works in two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature that is strongly related to target classes is selected from each cluster to form a subset of features. Features in different clusters are relatively independent, the clustering-based strategy of FAST has a high probability of producing a subset of useful and independent features. To ensure the efficiency of FAST, we adopt the efficient minimum-spanning tree (MST) clustering method. The efficiency and effectiveness of the FAST algorithm are evaluated through an empirical study. Extensive experiments are carried out to compare FAST and several representative feature selection algorithms, namely, FCBF, ReliefF, CFS, Consist, and FOCUS-SF, with respect to four types of well-known classifiers, namely, the probability-based Naive Bayes, the tree-based C4.5, the instance-based IB1, and the rule-based RIPPER before and after feature selection. The results, on 35 publicly available real-world high-dimensional image, microarray, and text data, demonstrate that the FAST not only produces smaller subsets of features but also improves the performances of the four types of classifiers.
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
(1979) · Cited by 43,841
(1992) · Cited by 23,431
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Individual Comparisons by Ranking Methods
Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
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
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
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Cohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
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
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
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785
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
Irrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Using mutual information for selecting features in supervised neural net learning
Battiti, R. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298224 · Cited by 2,148
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Hall, M. A. (2000) · Cited by 1,715
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Mitchell, T. M. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90040-6 · Cited by 1,412
García, S., & Herrera, F. (2008) · Cited by 1,277
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Distributional clustering of English words
Pereira, F., Tishby, N., & Lee, L. (1993) · Proceedings of the 31st annual meeting on Association for Computational Linguistics - · doi:10.3115/981574.981598 · Cited by 974
Correlation-based Feature Subset Selection for Machine Learning
Hall, M. A. (1998) · Cited by 955
Consistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
Selection of Relevant Features in Machine Learning.
Langley, P. (1994) · doi:10.21236/ada292575 · Cited by 709
MultiBoosting: A Technique for Combining Boosting and Wagging
Webb, G. I. (2000) · Machine Learning · doi:10.1023/a:1007659514849 · Cited by 703
Distributional clustering of words for text classification
Baker, L. D., & McCallum, A. K. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290970 · Cited by 676
A probabilistic approach to feature selection - a filter solution
Liu, H., & Setiono, R. (1996) · Cited by 665
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
Feature selection algorithms: a survey and experimental evaluation
Molina, L. C., Belanche, L., & Àngela Nebot, B. (2003) · Proceedings · doi:10.1109/icdm.2002.1183917 · Cited by 653
Feature selection for high-dimensional genomic microarray data
Xing, E. P., Jordan, M. I., & Karp, R. M. (2001) · Cited by 635
Fast Binary Feature Selection with Conditional Mutual Information
FleuretFrançois (2004) · Journal of Machine Learning Research · doi:10.5555/1005332.1044711 · Cited by 593
NEWMAN, D. (1939) · Biometrika · doi:10.1093/biomet/31.1-2.20 · Cited by 567
Feature Selection for Machine Learning: Comparing a Correlation-Based Filter Approach to the Wrapper
Hall, M. A., & Smith, L. A. (1999) · Cited by 557
Learning Boolean concepts in the presence of many irrelevant features
Almuallim, H., & Dietterich, T. G. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90084-1 · Cited by 520
A divisive information theoretic feature clustering algorithm for text classification
Dhillon, I. S., Mallela, S., & Kumar, R. (2003) · doi:10.5555/944919.944973 · Cited by 500
Using Decision Trees to Improve Case-Based Learning
Cardie, C. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50010-1 · Cited by 255
Redundancy based feature selection for microarray data
Yu, L., & Liu, H. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014149 · Cited by 244
Searching for interacting features
Zhao, Z., & Liu, H. (2007) · International Joint Conference on Artificial Intelligence · Cited by 235
Feature selection using rough sets theory
Modrzejewski, M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_138 · Cited by 206
A Formalism for Relevance and Its Application in Feature Subset Selection
Bell, D., & Wang, H. (2000) · Machine Learning · doi:10.1023/a:1007612503587 · Cited by 197
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753670 · Cited by 189
A selective sampling approach to active feature selection
Liu, H., Motoda, H., & Yu, L. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2004.05.009 · Cited by 178
Feature Selection for High-Dimensional Data — A Pearson Redundancy Based Filter
Biesiada, J., & Duch, W. (2007) · Advances in intelligent and soft computing · doi:10.1007/978-3-540-75175-5_30 · Cited by 161
Small sample issues for microarray‐based classification
Dougherty, E. R. (2001) · Comparative and Functional Genomics · doi:10.1002/cfg.62 · Cited by 159
On Feature Selection: Learning with Exponentially Many Irrelevant Features as Training Examples
Ng, A. Y. (1998) · Cited by 124
Efficient Algorithms for Identifying Relevant Features
Almuallim, H., & Dietterich, T. G. (1992) · Cited by 114
Searching for interacting features in subset selection1
Zhao, Z., & Liu, H. (2009) · Intelligent Data Analysis · doi:10.3233/ida-2009-0364 · Cited by 107
Oblivious Decision Trees and Abstract Cases
Langley, P., & Sage, S. (1994) · Cited by 87
On Feature Selection through Clustering
Butterworth, R., Piatetsky-Shapiro, G., & Simovici, D. A. (2006) · Proceedings · doi:10.1109/icdm.2005.106 · Cited by 74
Efficiently handling feature redundancy in high-dimensional data
Yu, L., & Liu, H. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956840 · Cited by 69
A feature set measure based on Relief
Araúzo-Azofra, A., & Castro, J. L. (2004) · Cited by 63
ReliefMSS: a variation on a feature ranking ReliefF algorithm
Chıkhı, S., & Benhammada, S. (2009) · International Journal of Business Intelligence and Data Mining · doi:10.1504/ijbidm.2009.029085 · Cited by 29
Mining of Attribute Interactions Using Information Theoretic Metrics
Chanda, P., Cho, Y., Zhang, A., & Ramanathan, M. K. (2009) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2009.51 · Cited by 28
Extended Relief Algorithms in Instance-Based Feature Filtering
Park, H., & Kwon, H. (2007) · International Conference on Advanced Language Processing and Web Information Technology · doi:10.1109/alpit.2007.16 · Cited by 26
Cited by
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
Investigating the impact of data normalization on classification performance
Singh, D., & Singh, B. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105524 · Cited by 1,726
Relief-based feature selection: Introduction and review
Urbanowicz, R. J., Meeker, M., La Cava, W., Olson, R. S., & Moore, J. H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.07.014 · Cited by 1,311
A review of microarray datasets and applied feature selection methods
Bolón-Canedo, V., Sánchez-Maroño, N., Alonso-Betanzos, A., Benítez, J. M., & Herrera, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.05.042 · Cited by 666
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
Metadata
- Authors
- Song, Q., Ni, J., & Wang, G.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2013-01
- Volume
- 25
- Issue
- 1
- Pages
- 1-14
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2027902860
- Cited by
- 663
- References
- 61
- FWCI
- 21.58
- 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.