The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Feature selection based on artificial bee colony and gradient boosting decision tree
Abstract
Abstract Data from many real-world applications can be high dimensional and features of such data are usually highly redundant. Identifying informative features has become an important step for data mining to not only circumvent the curse of dimensionality but to reduce the amount of data for processing. In this paper, we propose a novel feature selection method based on bee colony and gradient boosting decision tree aiming at addressing problems such as efficiency and informative quality of the selected features. Our method achieves global optimization of the inputs of the decision tree using the bee colony algorithm to identify the informative features. The method initializes the feature space spanned by the dataset. Less relevant features are suppressed according to the information they contribute to the decision making using an artificial bee colony algorithm. Experiments are conducted with two breast cancer datasets and six datasets from the public data repository. Experimental results demonstrate that the proposed method effectively reduces the dimensions of the dataset and achieves superior classification accuracy using the selected features.
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
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731 · cited 1×
“GBDT [15] was developed to identify the primary features of users’ comments about items and could be efficient for feature selection.”
BackgroundPeng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442 · cited 1×
“Its advantages have been demonstrated in various data mining and machine learning applications [9,10].”
BackgroundConsistency-based search in feature selection
Dash, M., & Liu, H. (2003) · Artificial Intelligence · doi:10.1016/s0004-3702(03)00079-1 · Cited by 889
A review of feature selection methods on synthetic data
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2013) · Knowledge and Information Systems · doi:10.1007/s10115-012-0487-8 · Cited by 830
Whale optimization approaches for wrapper feature selection
Mafarja, M., & Mirjalili, S. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.11.006 · Cited by 825
Cited by
Predicting Hard Rock Pillar Stability Using GBDT, XGBoost, and LightGBM Algorithms
Liang, W., Luo, S., Zhao, G., & Wu, H. (2020) · Mathematics · doi:10.3390/math8050765 · Cited by 496
A comprehensive survey on recent metaheuristics for feature selection
Dokeroglu, T., Deniz, A., & Kiziloz, H. E. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.083 · Cited by 356
Abdullah, A. Y. M., Masrur, A., Adnan, M. S. G., Baky, M. A. A., Hassan, Q. K., & Dewan, A. (2019) · Remote Sensing · doi:10.3390/rs11070790 · Cited by 309
Otchere, D. A., Ganat, T. O. A., Ojero, J. O., Tackie-Otoo, B. N., & Taki, M. Y. (2022) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2021.109244 · Cited by 264
A feature selection algorithm of decision tree based on feature weight
Zhou, H., Zhang, J., Zhou, Y., Guo, X., & Ma, Y. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113842 · Cited by 262
Modeling solid solution strengthening in high entropy alloys using machine learning
Wen, C., Wang, C., Zhang, Y., Antonov, S., Xue, D., Lookman, T., & Su, Y. (2021) · Acta Materialia · doi:10.1016/j.actamat.2021.116917 · Cited by 254
Bai, X., & Li, J. (2020) · Knowledge Management Research & Practice · doi:10.1080/14778238.2020.1834886 · Cited by 26
“There are many methods in artificial intelligence, such as decision tree (Rao et al., 2019), random forest (Speiser et al., 2019), logistic regression (Chen et al., 2019), greedy algorithm (Deng et al., 2019) and genetic algorithm (Sivaram et al., 2019).”
Retracted
Metadata
- Authors
- Rao, H., Shi, X., Rodrigue, A. K., Feng, J., Xia, Y., Elhoseny, M., Yuan, X., & Gu, L.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2019-01
- Volume
- 74
- Pages
- 634-642
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W2899750879
- Cited by
- 579
- References
- 26
- FWCI
- 30.27
- 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.