Performance Analysis of SVM and KNN
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Machine learning is one of the fastest-growing fields in computer science that enables systems to learn automatically from data and make intelligent decisions without being explicitly programmed. It plays a major role in real-world applications such as healthcare, banking, fraud detection, education, and recommendation systems. The primary objective of machine learning is to identify meaningful patterns and relationships in large datasets and use them to predict future outcomes. Among different learning approaches, supervised learning is widely used because it trains models using labeled data, and classification is one of its most important tasks. Support Vector Machine (SVM) and K-Nearest Neighbor (KNN) are two commonly used supervised learning algorithms for classification and prediction problems. SVM works by finding an optimal hyperplane that separates classes with maximum margin, while KNN classifies new instances based on the majority class among the nearest neighbors using distance measures. This review paper presents an overview of machine learning concepts, discusses the importance of classification, explains the working principles of SVM and KNN, and compares their performance using evaluation metrics such as accuracy, precision, recall, F1-score, training time, testing time, scalability, and memory usage. The study concludes that SVM is more suitable for high-dimensional and complex datasets, whereas KNN is effective for smaller datasets due to its simplicity and ease of implementation.
Fields of Study & Subjects
Data Mining and Machine Learning Applications
Machine Learning and Data Classification
Text and Document Classification Technologies
Publication details
- Journal / source
- International Journal of Science Strategic Management and Technology
- Volume
- 02
- Issue
- 03
- Pages
- 1–9
- Publication date
- 28 March 2026
- Language
- EN