MCS-224: Artificial Intelligence and Machine Learning Programme Code: MAEC Course Code: MCS 224 Assignment Code: MCS 224 / AST/2024-2025 Total Marks: 100 Assignment Questions and Answer Links: Classify AI on the basis of the functionalities of AI. Also discuss some important applications of AI. Define Supervised, Unsupervised and Reinforcement learning with suitable examples of each […]
Introduction FP-Growth (Frequent Pattern Growth) is an efficient and scalable method for mining frequent itemsets without the need for candidate generation, unlike the Apriori algorithm. It uses a data structure called the FP-Tree (Frequent Pattern Tree). Steps of the FP-Growth Algorithm Scan the transaction database to determine the frequency (support count) of each item. Remove
Q16: Explain FP Tree Growth Algorithm with a suitable example Read More »
Introduction Linear Discriminant Analysis (LDA) is a supervised learning algorithm used for classification and dimensionality reduction. The goal is to project high-dimensional data onto a lower-dimensional space such that the separability between classes is maximized. Step-by-Step LDA Calculation for the Given Dataset Step 1: Define the datasets Class X1: (4, 2), (2, 2), (3, 2),
Introduction K-Nearest Neighbors (KNN) is a simple and intuitive supervised machine learning algorithm used for classification and regression tasks. It classifies new data points based on the majority label of the ‘k’ closest training examples in the feature space. How KNN Works Choose the number of neighbors ‘k’ Calculate the distance (e.g., Euclidean) between the
Q13: Explain K-Nearest Neighbors classification Algorithm with a suitable example. Read More »
Introduction Naïve Bayes is a simple yet powerful probabilistic classification algorithm based on Bayes’ Theorem. It assumes that the features are conditionally independent given the class label. Despite its ‘naïve’ assumption, it performs well in various real-world scenarios like spam detection, sentiment analysis, and document classification. Bayes’ Theorem Bayes’ Theorem is the foundation of the
Q12: Explain Naïve Bayes Classification Algorithm with a suitable example. Read More »
Introduction Decision Tree is a popular supervised learning algorithm used for both classification and regression tasks. It uses a tree-like structure where each internal node represents a test on a feature, each branch represents an outcome of the test, and each leaf node represents a class label or output. Key Concepts Root Node: The starting
Q11: Explain Decision Tree algorithm with the help of a suitable example. Read More »
Introduction Logistic Regression is a type of supervised learning algorithm used for classification problems. Unlike linear regression which predicts continuous values, logistic regression is used to estimate the probability that a given input belongs to a certain category. What is Logistic Regression? Logistic regression is used when the dependent variable is categorical (usually binary —
Q10: What is logistic regression? Explain with the help of a suitable example. Read More »
Introduction Ensemble methods in machine learning are techniques that combine the predictions from multiple models to improve accuracy and performance. Instead of relying on a single model, ensemble learning leverages the power of many to produce more reliable results. These methods are particularly effective in reducing variance, bias, and improving predictions. Major Types of Ensemble
Q9: Briefly discuss the various Ensemble methods. Read More »
Introduction Fuzzy set theory generalizes classical set theory by allowing degrees of membership. The following fundamental properties hold in fuzzy set theory, just like in classical set theory. These include commutativity, associativity, distributivity, and DeMorgan’s laws. (i) Commutativity Statement: A ∪ B = B ∪ A A ∩ B = B ∩ A Proof: Let
Introduction In the field of Artificial Intelligence (AI), especially in rule-based expert systems, inference engines use two major strategies to derive conclusions: Forward Chaining and Backward Chaining. Both methods are applied to derive facts from rules but in opposite directions of reasoning. Forward Chaining Forward chaining is a data-driven inference technique. It starts with the
Disabled !
