The DOI matches its Crossref record; 88 of the 88 references it cites were found in a registry or an index.
Selecting critical features for data classification based on machine learning methods
Open accessAbstract
Feature selection becomes prominent, especially in the data sets with many variables and features. It will eliminate unimportant variables and improve the accuracy as well as the performance of classification. Random Forest has emerged as a quite useful algorithm that can handle the feature selection issue even with a higher number of variables. In this paper, we use three popular datasets with a higher number of variables (Bank Marketing, Car Evaluation Database, Human Activity Recognition Using Smartphones) to conduct the experiment. There are four main reasons why feature selection is essential. First, to simplify the model by reducing the number of parameters, next to decrease the training time, to reduce overfilling by enhancing generalization, and to avoid the curse of dimensionality. Besides, we evaluate and compare each accuracy and performance of the classification model, such as Random Forest (RF), Support Vector Machines (SVM), K-Nearest Neighbors (KNN), and Linear Discriminant Analysis (LDA). The highest accuracy of the model is the best classifier. Practically, this paper adopts Random Forest to select the important feature in classification. Our experiments clearly show the comparative study of the RF algorithm from different perspectives. Furthermore, we compare the result of the dataset with and without essential features selection by RF methods varImp(),Boruta, and Recursive Feature Elimination (RFE) to get the best percentage accuracy and kappa. Experimental results demonstrate that Random Forest achieves a better performance in all experiment groups.
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
1 retracted
Magesh, G., & Swarnalatha, P. (2020) · Evolutionary Intelligence · doi:10.1007/s12065-019-00336-0 · Cited by 74
RetractedThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
Hanley, J. A., & McNeil, B. J. (1982) · Radiology · doi:10.1148/radiology.143.1.7063747 · Cited by 21,856 · cited 1×
“Then calculate the accuracy and prediction error rates using the equation below: [105] where: TP = True positive; FP = False positive; TN = True negative; FN = False negative.”
MethodClassification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
Principal component analysis: A review and recent developments
Jolliffe, I. T., & Cadima, J. (2016) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2015.0202 · Cited by 10,117
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
An Introduction to Kernel and Nearest-Neighbor Nonparametric Regression
Altman, N. S. (1992) · The American Statistician · doi:10.1080/00031305.1992.10475879 · Cited by 5,708
The Nature of Statistical Learning Theory
Sain, S. R. (1996) · Technometrics · doi:10.1080/00401706.1996.10484565 · Cited by 5,434
An Introduction to Support Vector Machines and Other Kernel‐based Learning Methods
(2001) · Kybernetes · doi:10.1108/k.2001.30.1.103.6 · Cited by 3,308
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
Cited by
Review of swarm intelligence-based feature selection methods
Rostami, M., Berahmand, K., Nasiri, E., & Forouzandeh, S. (2021) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2021.104210 · Cited by 451
Uddin, M. G., Nash, S., Rahman, A., & Olbert, A. I. (2023) · Process Safety and Environmental Protection · doi:10.1016/j.psep.2022.11.073 · Cited by 288
A novel community detection based genetic algorithm for feature selection
(2021) · doi:10.1186/s40537-020-00398-3 · Cited by 197
Textual Feature Extraction Using Ant Colony Optimization for Hate Speech Classification
Gite, S., Patil, S., Dharrao, D., Yadav, M., Basak, S., Rajendran, A., & Kotecha, K. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7010045 · Cited by 37
Park, J., Na, H. J., & Kim, H. (2024) · IEEE Access · doi:10.1109/access.2024.3519219 · Cited by 10
Metadata
- Authors
- Chen, R.-C., Dewi, C., Huang, S.-W., & Caraka, R. E.
- Venue
- Journal of Big Data
- Published
- 2020-07-23
- Volume
- 7
- Issue
- 1
- ISSN
- 2196-1115 (ISSN-L)
- OpenAlex
- W3044853528
- Cited by
- 979
- References
- 88
- FWCI
- 99.49
- Type
- journal article
- Language
- en
- Open access
- gold
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: Selecting critical features for data classification based on machine learning methods. https://app.cochat.ai/papers/10.1186/s40537-020-00327-4
- The paper
- Chen, R.-C., Dewi, C., Huang, S.-W., & Caraka, R. E. (2020). Selecting critical features for data classification based on machine learning methods. Journal of Big Data. https://doi.org/10.1186/s40537-020-00327-4
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.