Affiliation:
1. Department of Computer Science, Bishop Heber College (Autonomous), Affiliated to Bharathidasan University, Tiruchirappalli, India
2. Head, Department of Computer Science, Bishop Heber College (Autonomous), Affiliated to Bharathidasan University, Tiruchirappalli, India
Abstract
The major purpose of this research is to forecast cervical cancer, compare which algorithms perform well, and then choose the best algorithm to predict cervical cancer at an early stage. Cervical cancer classification can be automated using a machine learning system. This study evaluates multiple machine learning techniques for cervical cancer classification. For this classification, algorithms such as Decision Tree, Naive Bayes, KNN, SVM, and MLP are proposed and evaluated. The cervical cancer Dataset, which was retrieved from the UCI machine learning data repository, was used to test these methods. With the help of Sciklit-learn, the algorithms' results were compared in terms of Accuracy, Sensitivity, and Specificity. Sciklit-learn is a Python-based machine learning package that is available for free. Finally, the best model for predicting cervical cancer is developed.
Reference20 articles.
1. All about Cancer, Cancer Society of Finland, Available at: https://www.allaboutcancer.fi/facts-aboutcancer/detection/#8667b054 (Accessed date 25.07.2020).
2. American Cancer Society, Cancer Facts for Women, Available at: https://www.cancer.org/healthy/findcancer-early/womens-health/cancer-facts-for-women.html(Accessed date 25.07.2020).
3. American Cancer Society, What is Cervical Cancer?, Available at: https://www.cancer.org/cancer/cervical-cancer/about/what-is-cervical-cancer.html (Accessed date 25.07.2020).
4. Shimizu, H., & Nakayama, K. I. (2020). Artificial intelligence in oncology. Cancer Science, 111(5), 1452–1460. https://doi.org/10.1111/cas.14377
5. Devi, M. A., Ravi, S., Vaishnavi, J., & Punitha, S. (2016). Classification of Cervical Cancer Using Artificial Neural Networks. Procedia Computer Science, 89, 465–472. https://doi.org/10.1016/j.procs.2016.06.105