
Learning by observation
Learning Agents
Forms of Learning Inductive Learning
Supervised Learning
Unsupervised Learning
Reinforcement Learning
Introduction to Decision Trees
Decision Tree Construction Algorithm
Explore entropy as a measure of uncertainty, compute remainder and information gain to guide attribute selection in decision trees, including binary and multi-valued attributes.
Demonstrates building a decision tree classifier in Python using sklearn on the zoo dataset, including data prep, train-test split, model fitting with entropy, making predictions, and evaluating accuracy.
Build a Python decision tree on a zoo dataset by uploading zoo.csv to Google Colab, preparing data with Pandas, and evaluating an 80/20 split with entropy and depth five.
When there are more than one independent variable, we build the model using Gradient Descent method
Build and test a linear regression model in Google Colab using sklearn on IMDb data, preparing data, selecting numeric features, splitting 80/20, training, predicting, and evaluating with r-squared.
Learn to normalize data in Python by loading a CSV with pandas, computing mean and standard deviation with NumPy, and applying (value - mean)/std to a WBC feature.
Learn to preprocess diabetes data in python by loading csv with pandas, handling missing values, replacing zeros with nan, imputing with mean or median, and scaling features with sklearn.
Learn logistic regression as a classifier that solves binary and multiclass classification by learning a linear decision boundary from data, using gradient descent.
Explain the k nearest neighbor algorithm for classification, using distance to select k training examples and majority vote to assign labels, with no explicit model.
Develop and test a k-nearest neighbor classifier for handwritten digit recognition using a 28 by 28 pixel image representation, Euclidean distance, and the Emnist dataset in Python.
In this course, we present the concept of machine learning and the classification of different methods of learning such as Supervised and Unsupervised Learning. We also present reinforcement learning. We offer popular techniques and implement them in Python. We begin with the Decision Tree method. We present this simply with all the required mathematical tools such as entropy. We implement them in Python and explain how the accuracy can be improved. We offer the classification problem with a suitable real-life scenario. Linear Regression is taught using simple real-life examples. We present the L2 Error estimation and explain how we can minimize the error using gradient optimization. This is implemented using the Python library. We also offer the Logistic Regression method with an example and implement in Python. The Nearest Neighbourhood approach is explained with examples and implemented in Python. Support Vector Machines (SVM) are a popular supervised learning model that you can use for classification or regression. This approach works well with high-dimensional spaces (many features in the feature vector) and can be used with small data sets effectively. When trained on a data set, the algorithm can easily classify new observations efficiently. We also present a few more methods. The Bayesian model of classification is used for large finite datasets. It is a method of assigning class labels using a direct acyclic graph. The graph comprises one parent node and multiple children nodes. And each child node is assumed to be independent and separate from the parent. As the model for supervised learning in ML helps construct the classifiers in a simple and straightforward way, it works great with very small data sets. This model draws on common data assumptions, such as each attribute is independent. Yet having such simplification, this algorithm can easily be implemented on complex problems.