Abstract

Stroke is a serious medical condition that affects many people around the world. The ability to predict a person's stroke risk can help in effective prevention, treatment and care. In this study, a comparison between the K-Nearest Neighbors (KNN) and Support Vector Machine (SVM) algorithms was conducted to predict stroke risk. The KNN algorithm is a method that searches for the nearest neighbors among the data points to be predicted and assigns the most common label among its neighbors. Experimental results show that both KNN and SVM can provide fairly accurate stroke predictions. However, from an operational point of view, SVM consistently performed better than KNN in terms of accuracy and precision. This research provides insight into the differences between KNN and SVM algorithms in the context of stroke prediction. The results can provide guidance for researchers and practitioners in choosing the right algorithm to predict stroke risk based on the characteristics of the available datasets.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.