Boosting-BoW Algorithm for Finding Kidney Diseases from Medical Test Reports
Wisam A. Qader1 & Abbas M. Ali2 Show affiliations
- Tishk International University, Iraq
- Salahaddin University, Iraq
Journal of Computer Science, Volume 15, Issue 4, pp. 558–565 · doi.org/10.3844/jcssp.2019.558.565
Abstract
This paper introduces an approach to increase the accuracy rate of classification by employing Bag-of-Words (BoW) as a feature selection method along with machine learning algorithms to obtain a more accurate output. Because of its capability in quickly processing large sets of data and getting accurate results, this approach can be used in medical areas. Different ensemble approaches are generated by different researchers to obtain good results as mentioned in the literature review. In this study a novel algorithm is proposed to analyze medical kidney test reports, using BoW for selecting the features and analyzing them via Boosting four different machine learning classification algorithms like Sequential Minimum Optimization (SMO), k-Nearest Neighbors (k-NN), Random Forests (RF) and Naïve Bayes (NB). With the help of specialists in urology, the proposed algorithm is tested against multiple datasets of different kidney tests. The accuracy of the proposed Boosting algorithms outperforms its counterpart algorithms like SMO, k-NN, RF and NB when they had showen their performances alone.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Qader, W. A. & Ali, A. M. (2019). Boosting-BoW Algorithm for Finding Kidney Diseases from Medical Test Reports. Journal of Computer Science, 15(4), 558–565. https://doi.org/10.3844/jcssp.2019.558.565
- Licence
- CC BY 3.0
- Issue
- Volume 15, Issue 4
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
