BasicsDecision trees are flowchart-like models used to predict a class (like yes/no) by asking a series of questions about features. You start at the root and follow branches based on answers until you reach a leaf with a class label. Each internal node tests one attribute, each branch is an outcome of that test, and each leaf gives the prediction.
MLThis lesson explains the core pieces of machine learning: data (X and Y), models f(x;θ), loss functions that measure mistakes, and optimizers that adjust θ to reduce the loss. It divides learning into supervised (with labels), unsupervised (without labels), and reinforcement learning (with rewards). The focus here is on supervised learning, especially regression and classification, plus a short intro to k-means clustering.