Diabetic Retinopathy Prediction Using Machine Learning
Keywords:
Decision tree, Blind spots, coronary artery disease, Normalize, Diagnostic systemsAbstract
Diabetic Retinopathy (DR) is a significant complication of diabetes and a leading cause of blindness worldwide. It occurs when high blood sugar levels cause damage to the blood vessels in the retina, leading to leakage and other retinal issues. Early detection and classification of DR lesions are crucial to prevent vision loss. While manual diagnosis of retinal fundus images by ophthalmologists is effective, it is often time-consuming, labor-intensive, costly, and carries a risk of misdiagnosis. In recent years, machine learning has become a prominent tool in enhancing performance across various fields, including medical image classification. This chapter evaluates classifiers such as Support Vector Machines, Decision Trees, Logistic Regression, k-Nearest Neighbors, and Artificial Neural Networks to identify the most effective approach for DR classification. Additionally, it reviews available DR Datasets and discusses several challenging issues that require further research. Comparisons with previous studies indicate satisfactory results. Furthermore, in diabetes prediction, our findings highlight those models such as Logistic regression (LR), Support Vector Machine (SVM), decision Tree (DT), Artificial Neural Network (ANN), and K Nearest neighbor (KNN) provide good predictive performance, making them valuable techniques for early detection. These classifiers have also been applied to diabetic retinopathy prediction, demonstrating their ability to analyze retinal fundus images and distinguish between different stages of DR. This research aims to improve DR diagnosis by demonstrating the efficacy of different Machine Learning ML classifiers, thereby aiding in the development of accurate and efficient computer-aided diagnostic systems for early detection and management.
Downloads
Metrics
References
Bhawna, Gaurav Kumar and pardeep Kumar Bhatia,”Software Test Case Reduction using Genetic Algorithm:A Modified Approach”IJISET,Vol 3,Issue 5,May 2016.
Anamika Taya,“ Performance Improvement of Genetic Algorithm by Fitness Scaling and Diversity Maintenance,” in International Journal for Research in Technological Studies, vol. 2, Issue 7, June 2015.
V. Kreinovich, C. Quintana, and O. Fuentes, “Genetic algorithms: what fitness scaling is optimal?,” Cybernetics and Systems, vol. 24, no. 1, pp. 9–26, 1993.
J. H. Holland and D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.
M. Zhou, S. D. Sun, “Theory and application of genetic algorithm,” presented at National defense press, Beijing, 1996.
G.-S. Hao, Y. Yu-Chen, K.-X. Wei, G. Gong, and X.-T. Hu, “Parameters selection of fitness scaling in genetic algorithm and its application,” presented at the 2010 Chinese Control and Decision Conference, 2010, pp. 2475–2480.
L. Nolle, A. Armstrong, A. Hopgood, and A. Ware, “Optimum work roll profile selection in the hot rolling of wide steel strip using computational intelligence,” in International Conference on Computational Intelligence, 1999, pp. 435–452.
S. Hill, J. Newell, and C. O’Riordan, “Analysing the effects of combining fitness scaling and inversion in genetic algorithms,” presented at the Tools with Artificial Intelligence, 2004. ICTAI 2004. 16th IEEE International Conference on, 2004, pp. 380–387.
J. H. Holland and D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.
S. N. Sivanandam and S. N. Deepa, Introduction to Genetic Algorithms. Springer Science & Business Media, 2007.
N. Surajudeen-Bakinde, X. Zhu, J. Gao, and A. K. Nandi, “Effects of fitness scaling and adaptive parameters on genetic algorithm based equalization for DS-UWB systems,” presented at the Computers and Devices for Communication, 2009. CODEC 2009. 4th International Conference on, 2009, pp. 1–4.
B. Sareni and L. Krahenbuhl, “Fitness sharing and niching methods revisited,” IEEE Transactions on Evolutionary Computation, vol. 2, no. 3, pp. 97–106, Sep. 1998.
P. Darwen and X. Yao, “A dilemma for fitness sharing with a scaling function,” presented at the Evolutionary Computation, 1995, IEEE International Conference on, 1995, vol. 1, pp. 166-171.
Nitin S. Choubey and Madan U. Kharat ,”Performance Evaluation of Methods for handling Premature Convergence in GA - Case of Grammar Induction,” in International Journal of Computer Applications, vol. 79, no. 2, pp. 9-13, Oct. 2013.
A. A. Hopgood and A. Mierzejewska, “Transform ranking: a new method of fitness scaling in genetic algorithms,” in Research and Development in Intelligent Systems XXV, Springer, 2009, pp. 349–354.
P. Da:rwen and X. Yao, “How good is fitness sharing with a scaling function,’’ Tech. Rep. CS 8/95, University College, The University of New South Wales, Canberra, Apr. 1995.
Z.Michaelwicz,“Genetic Algorithm + Data Structures = Evolution Programs”, Springer, 3 rd revised and extendededition,Oct.1995.
F. Sadjadi, “Comparison of fitness scaling functions in genetic algorithms with applications to optical processing,” in Optical Science and Technology, the SPIE 49th Annual Meeting, 2004, pp. 356–364.
S. W. Mahfoud, “Population sizing for sharing methods,” Tech. Rep. 94005, Illinois Genetic Algorithms Laboratory, University of Illinois at Ur.bana-Champaign, Aug. 1994. To appear in the: Third Workshop on the Foundations of Genetic Algorithms.
R. E. Smith, S. Forrest, and A. S. Perel- son, ‘Searching for diverse, cooperative popu-lations with genetic algorithms,” Evolutionary Computation, vol. 1, no. 2, pp. 127-149, 11992.
Man, K., Tang, K. and Kwong, S. (1999). Genetic algorithms: concepts and designs. SprigerVerlag London Limited.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
Terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.