The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Efficient Prediction of Cardiovascular Disease Using Machine Learning Algorithms With Relief and LASSO Feature Selection Techniques
Open accessAbstract
Cardiovascular diseases (CVD) are among the most common serious illnesses affecting human health. CVDs may be prevented or mitigated by early diagnosis, and this may reduce mortality rates. Identifying risk factors using machine learning models is a promising approach. We would like to propose a model that incorporates different methods to achieve effective prediction of heart disease. For our proposed model to be successful, we have used efficient Data Collection, Data Pre-processing and Data Transformation methods to create accurate information for the training model. We have used a combined dataset (Cleveland, Long Beach VA, Switzerland, Hungarian and Stat log). Suitable features are selected by using the Relief, and Least Absolute Shrinkage and Selection Operator (LASSO) techniques. New hybrid classifiers like Decision Tree Bagging Method (DTBM), Random Forest Bagging Method (RFBM), K-Nearest Neighbors Bagging Method (KNNBM), AdaBoost Boosting Method (ABBM), and Gradient Boosting Boosting Method (GBBM) are developed by integrating the traditional classifiers with bagging and boosting methods, which are used in the training process. We have also instrumented some machine learning algorithms to calculate the Accuracy (ACC), Sensitivity (SEN), Error Rate, Precision (PRE) and F1 Score (F1) of our model, along with the Negative Predictive Value (NPR), False Positive Rate (FPR), and False Negative Rate (FNR). The results are shown separately to provide comparisons. Based on the result analysis, we can conclude that our proposed model produced the highest accuracy while using RFBM and Relief feature selection methods (99.05%).
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
Gradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887 · cited 1×
“The latest base-learner is the largest loss function correlated with negative gradients [94].”
BackgroundRegression Shrinkage and Selection via The Lasso: A Retrospective
Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00771.x · Cited by 3,589
Effective Heart Disease Prediction Using Hybrid Machine Learning Techniques
Mohan, S., Thirumalai, C., & Srivastava, G. (2019) · IEEE Access · doi:10.1109/access.2019.2923707 · Cited by 1,951 · cited 1×
“[32] with different combinations of features”
The Atlas of Heart Disease and Stroke
Mackay, J., Mensah, G. A., & Mendis, S. (2004) · Medical Entomology and Zoology · Cited by 1,550
The atlas of heart disease and stroke
Beevers, D. G. (2005) · Journal of Human Hypertension · doi:10.1038/sj.jhh.1001852 · Cited by 1,247
Random forests: from early developments to recent advancements
Fawagreh, K., Gaber, M. M., & Elyan, E. (2014) · Systems Science & Control Engineering · doi:10.1080/21642583.2014.956265 · Cited by 776
Mourão-Miranda, J., Bokde, A. L. W., Born, C., Hampel, H., & Stetter, M. (2005) · NeuroImage · doi:10.1016/j.neuroimage.2005.06.070 · Cited by 704
Latha, C. B. C., & Jeeva, S. C. (2019) · Informatics in Medicine Unlocked · doi:10.1016/j.imu.2019.100203 · Cited by 647
Haq, A. U., Li, J. P., Memon, M. H., Nazir, S., & Sun, R. (2018) · Mobile Information Systems · doi:10.1155/2018/3860146 · Cited by 621 · cited 2×
“Additionally, a limited number of studies also demonstrated AB [5], [6] as well as GB [53] can perform rather well with considerably highAccuracy.”
Background
Cited by
Ahmad, G. N., Fatima, H., Ullah, S., Salah Saidi, A., & Imdadullah (2022) · IEEE Access · doi:10.1109/access.2022.3165792 · Cited by 289
Suri, J. S., Bhagawati, M., Paul, S., Protogerou, A. D., Sfikakis, P. P., Kitas, G. D., Khanna, N. N., Ruzsa, Z., Sharma, A. M., Saxena, S., et al. (2022) · Diagnostics · doi:10.3390/diagnostics12030722 · Cited by 55
Baker, S., & Xiang, W. (2023) · arXiv · doi:10.48550/arxiv.2312.01555 · Cited by 12
Jiang, C., Department of Cardiology, T. F. A. H. O. G. M. U., Jiang, W., & Department of Cardiology, N. T. C. M. H. (2022) · Mathematical Biosciences and Engineering · doi:10.3934/mbe.2022174 · Cited by 5
Metadata
- Authors
- Ghosh, P., Azam, S., Jonkman, M., Karim, A., Shamrat, F. M. J. M., Ignatious, E., Shultana, S., Beeravolu, A. R., & De Boer, F.
- Venue
- IEEE Access
- Published
- 2021
- Volume
- 9
- Pages
- 19304-19326
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3121216533
- Cited by
- 581
- References
- 50
- FWCI
- 87.72
- 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
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.