The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Toward optimal feature selection using ranking methods and classification algorithms
Open accessAbstract
We presented a comparison between several feature ranking methods used on two real datasets. We considered six ranking methods that can be divided into two broad categories: statistical and entropy-based. Four supervised learning algorithms are adopted to build models, namely, IB1, Naive Bayes, C4.5 decision tree and the RBF network. We showed that the selection of ranking methods could be important for classification accuracy. In our experiments, ranking methods with different supervised learning algorithms give quite different results for balanced accuracy. Our cases confirm that, in order to be sure that a subset of features giving the highest accuracy has been selected, the use of many different indices is recommended.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
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
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
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
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 Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,791
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Cited by
Thakkar, A., & Lohiya, R. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10037-9 · Cited by 350
Azam, Z., Islam, M. M., & Huda, M. N. (2023) · IEEE Access · doi:10.1109/access.2023.3296444 · Cited by 265
Khan, N., Shahid, S., Ahmed, K., Ismail, T., Nawaz, N., & Son, M. (2018) · Water · doi:10.3390/w10121793 · Cited by 183
Two-stage feature selection of voice parameters for early Alzheimer’s disease prediction
Mirzaei, S., El Yacoubi, M., Garcia-Salicetti, S., Boudy, J., Kahindo, C., Cristancho-Lacroix, V., Kerhervé, H., & Rigaud, A.-S. (2018) · IRBM · doi:10.1016/j.irbm.2018.10.016 · Cited by 52
Gulzar, Q., & Mustafa, K. (2025) · Scientific Reports · doi:10.1038/s41598-025-89650-5 · Cited by 29
Metadata
- Authors
- Novakovic, J., Strbac, P., & Bulatovic, D.
- Venue
- Yugoslav Journal of Operations Research
- Publisher
- National Library of Serbia
- Published
- 2011
- Volume
- 21
- Issue
- 1
- Pages
- 119-135
- ISSN
- 0354-0243 (ISSN-L)
- 1820-743X
- OpenAlex
- W2087576375
- Cited by
- 269
- References
- 29
- FWCI
- 5.62
- Type
- journal article
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Toward optimal feature selection using ranking methods and classification algorithms. https://app.cochat.ai/papers/10.2298/yjor1101119n
- The paper
- Novakovic, J., Strbac, P., & Bulatovic, D. (2011). Toward optimal feature selection using ranking methods and classification algorithms. Yugoslav Journal of Operations Research. https://doi.org/10.2298/yjor1101119n
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.