Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{149013,
        author = {Neha Gahlan},
        title = {Assessment of Supervised Machine Learning Algorithms},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {6},
        number = {10},
        pages = {169-173},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=149013},
        abstract = {Supervised machine learning is the assembly of algorithms that are able to produce general patterns and hypotheses by using superficially supplied instances to predict the fate of future instances. Supervised machine learning classification algorithms aim at categorizing data from prior information. Classification is carried out very frequently in data science problems. Various successful techniques have been proposed to solve such problems viz. Rule-based techniques, Logic-based techniques, Instance-based techniques, and stochastic techniques. This paper discusses the efficacy of supervised machine learning algorithms in terms of the accuracy, speed of learning, complexity and risk of over fitting measures. The main objective of this paper is to provide a general comparison with state of art machine learning algorithms. },
        keywords = {Decision Trees (DT), k-Nearest Neighbors (k-NN), Logistic Regression (LR), Random Forests (RF), Supervised Machine Learning, Support Vector Machine (SVM)},
        month = {},
        }