IGNOU MCS 221 2026 2027 - Compare decision tree, Naïve Bayes, k-nearest nei

Question

Compare decision tree, Naïve Bayes, k-nearest neighbour and support vector machine classifiers. Recommend the most appropriate algorithm for credit-risk prediction with justification.

30 Jul 2026

Answer :

Word Count : 683

Classification is one of the most important tasks in data mining, where a model is trained using historical data to predict the class label of new instances. Decision Tree, Naïve Bayes, k-Nearest Neighbour (k-NN), and Support Vector Machine (SVM) are among the most widely used classification algorithms. Each algorithm differs in its learning approach, computational complexity, interpretability, and suitability for different types of datasets. A Decision Tree is a supervised learning algorithm that classifies data by recursively splitting it into subsets based on the most informative attributes. Internal nodes represent decision conditions, branches represent outcomes of those conditions, and leaf nodes represent class labels. Algorithms such as ID3, C4.5, and CART are commonly used for constructing decision trees. Decision trees are easy to understand and interpret, can handle both numerical and categorical data, and require little data preprocessing. However, they are prone to

___ ____ _______ __________ ____ _____ ____.
___ __________ ______ _______ __________ _________.
_______ __________ ____ _______ ___ _____ ___ ____.
___ ___ _____ ________ _____ _______ __________ ________.
_______ __________ _________ ______ ________ ______ __________ ____ ________ ______ __________.
_________ ____ _________ ______ _________ ___ _________.
_______ _______ _________ ___ ______ _________ _____ ______ ________ _____ ___ ______.
________ _____ ___ ___ _________ ____ _______ ____ _________ ______.
________ _________ __________ _____ _______ _____ ________ _____ _________ ________ ________.
____ ______ _____ _______ ________ ________ _______ _________ ________ __________ ______ _____.
______ ____ _______ ________ __________ __________ ____ ________ ___ ___ _______ _________.
_______ ______ _________ __________ ________ ________.
_____ ______ _______ ___ _____ _______ ________ ______ _________ ____ __________ ___.
_________ ________ ___ __________ _______ ____ __________ ___ ________ _______ _____ _____.
____ ___ ____ _______ ___.
______ _________ ______ ________ _________ _____ ________ _______ ________ __________ ___.
_______ ___ _______ ___ ____ _____ _________ _____ ________ ______.
_______ __________ _______ ________ ______ ________ ________ ________ ___ ______ ___.
_________ ________ ____ _____ ___ __________ _________ ___.
_______ __________ _______ __________ ______ ___ _______ ________ _________ ___ _____.
_______ ____ ______ __________ ______ ______ _____ _______ __________ ____ ______ ________.
________ __________ _______ ______ _________.
_____ ________ ___ _______ ___ __________ ______ ___ __________ _______ _____ ____.
_____ ___ __________ __________ ______ _______ _____ ___.
_____ _____ ____ ________ ____ ____ _____ _________ _____ ________ ____.
________ ______ _________ ___ _________ __________ ________ _______ _________ __________ ________.
________ _________ _________ _____ _______ __________ _______ ____ __________ ___ ______ ________.
___ ______ __________ ________ _____ _______ _______ _________ ______.
_________ ___ ___ ____ ____ __________ _______.
______ ____ _______ _________ ____ ____ _____ _______ ________ ____.
_______ ___ __________ ___ __________.
_______ _______ ________ ________ _________ ____.
___ ___ ______ ____ _______ _________ ____.
_________ _________ ___ ________ ______ ______ ________ ____ ______ ________ ___.
______ ___ _______ __________ ____ ________ _____ _______ __________ ___ ________.
__________ ____ ____ ________ ___ _________ ______ ___ ______ ______ ___.
______ ___ _____ ____ __________ ___ ___ __________ ______ ________.
_______ ________ _________ ________ ____.
______ _____ ______ ______ _________ ___ ________.
___ ______ ______ ___ ________ ______ __________.
_____ ___ ___ _____ ____ ________.
________ _____ _________ _______ _________.
___ ____ ___ _______ _______ ________ ____ _______ _______ ___ _______.
___ ____ ___ ____ _________.
____ _____ _____ _____ _________ ____ _______.
___ ______ ______ ____ _____ _________ ___ _______ ___ __________ ______ ________.
____ _____ _________ ______ _____ ___ _____ ___ ________ __________.
__________ ______ ________ ______ ________ _______ _______ _________.
___ ______ __________ ___ ____ __________ _________ ______ ___.
________ ___ __________ _________ _________ _________ ____ _______ _________.
________ ___ _______ ______ _____ ______ ____ _________ _______.
________ _______ _______ _____ ___ _____ ____.
_____ ______ _____ _____ _______ _____ _______.
_____ ______ __________ __________ ____ __________ ___ ___ _________ ________.
_________ ______ __________ ___ ____.
________ ________ ________ _______ _______ ___.
___ _____ _________ ____ ________ ____ _________ _____ __________.
___ _________ __________ ____ ___ _________ ______ _____ ________ __________ __________ ______.
___ _____ ________ ____ _________ __________ _________ __________ _________ _________.
_______ ______ _____ ________ _______ _________ ________ ______ ________ __________ ______.
_______ __________ ___ ___ __________.

IGNOU ACADEMY

Your IGNOU journey, made easier.

Solved Assignments
Study Notes
Guess Papers
Question Papers

Call Us WhatsApp

STUDY • PREPARE • SUCCEED

Skip in 10

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers