The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Unsupervised feature selection using feature similarity
Abstract
In this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and size. The method is based on measuring similarity between features whereby redundancy therein is removed. This does not need any search and, therefore, is fast. A new feature similarity measure, called maximum information compression index, is introduced. The algorithm is generic in nature and has the capability of multiscale representation of data sets. The superiority of the algorithm, in terms of speed and performance, is established extensively over various real-life data sets of different sizes and dimensions. It is also demonstrated how redundancy and information loss in feature selection can be quantified with an entropy measure.
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Linear Statistical Inference and its Applications: Second Editon
Rao, C. R. (1973) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316436 · Cited by 10,489
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
Linear Statistical Inference and Its Applications.
Robertson, C. A., & Rao, C. R. (1975) · Biometrics · doi:10.2307/2529568 · Cited by 3,598
Floating search methods in feature selection
Pudil, P., Novovičová, J., & Kittler, J. (1994) · Pattern Recognition Letters · doi:10.1016/0167-8655(94)90127-9 · Cited by 3,098
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 2,978
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
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
Testing Statistical Hypotheses
Lehmann, E. L. (1986) · Springer Texts in Statistics · doi:10.1007/978-1-4757-1923-9 · Cited by 1,873
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
Comparison of algorithms that select features for pattern classifiers
Kudo, M., & Sklansky, J. (2000) · Pattern Recognition · doi:10.1016/s0031-3203(99)00041-2 · Cited by 905
Data mining and knowledge discovery in databases
Fayyad, U., & Uthurusamy, R. (1996) · Communications of the ACM · doi:10.1145/240455.240463 · Cited by 590
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
Skalak, D. B. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50043-x · Cited by 486
A Comparative Evaluation of Sequential Feature Selection Algorithms
Aha, D. W., & Bankert, R. L. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_19 · Cited by 445
Step-Wise Clustering Procedures
King, B. (1967) · Journal of the American Statistical Association · doi:10.1080/01621459.1967.10482890 · Cited by 386
Feature Subset Selection and Order Identification for Unsupervised Learning
Dy, J., & Brodley, C. E. (2000) · Cited by 234
Efficient Algorithms for Minimizing Cross Validation Error
Moore, A. W., & Lee, M. S. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50031-3 · Cited by 232
TABLES FOR USE IN COMPARISONS WHOSE ACCURACY INVOLVES TWO VARIANCES, SEPARATELY ESTIMATED
Aspin, A. A. (1949) · Biometrika · doi:10.1093/biomet/36.3-4.290 · Cited by 138
Unsupervised feature evaluation: a neuro-fuzzy approach
Pal, S. K., De, R. K., & Basak, J. K. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.839007 · Cited by 137
Self-citationUnsupervised Feature Selection
Dy, J. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781584888796-9 · Cited by 78
Feature Selection with a Linear Dependence Measure
Das, S. K. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223412 · Cited by 55
Liu, H., & Setiono, R. (1998) · Expert Systems with Applications · doi:10.1016/s0957-4174(98)90049-5 · Cited by 43
Redundancy in Feature Extraction
Heydorn, R. P. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223401 · Cited by 24
Cited by
A survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
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
Survey on speech emotion recognition: Features, classification schemes, and databases
El Ayadi, M., Kamel, M. S., & Karray, F. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.020 · Cited by 2,073
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
Metadata
- Authors
- Mitra, P., Murthy, C. A., & Pal, S. K.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-03
- Volume
- 24
- Issue
- 3
- Pages
- 301-312
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2060542593
- Cited by
- 1,460
- References
- 24
- FWCI
- 19.10
- 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.