Estimated Time to Complete
Only available after login
What You'll Learn
Concepts:
Recursive Rectangular Partitioning of Feature Space by Decision Trees in Machine Learning
The Naive Bayes Conditional Independence Assumption and Smoothing in Machine Learning
Weight Initialization Overfitting Control and Local Optima in Artificial Neural Network Training
The BIRCH Algorithm for Clustering Very Large Datasets in Machine Learning
P-Value Calculation and Interpretation via T-Tests
Temporal Difference Learning in the Reinforcement Learning Agent-Environment Framework
Threshold Graphs for Clustering from a Similarity Matrix in Machine Learning
Deriving the Optimal Regression Function from Squared Error Loss in Statistical Learning
Minimizing 0-1 Loss with the Bayes Optimal Classifier in Machine Learning
Bias Variance Decomposition of Prediction Error in Machine Learning
Early Artificial Neural Network Models as Computing Elements in Machine Learning
Variable Elimination for Exact Inference in Probabilistic Graphical Models
The Expectation Maximization Algorithm for Maximum Likelihood with Missing Data
Gini Index and Cross Entropy as Split Criteria for Decision Trees in Machine Learning
Linear Discriminant Analysis with Gaussian Class Conditional Densities in Machine Learning
Kernel Functions and Inner Products in Support Vector Machines
Bootstrap, jackknife and other resampling methods
Vector spaces, linear dependence, rank, lineability
Unsupervised Learning and Clustering of Unlabelled Data in Machine Learning
Temporal Difference Updates Versus Dynamic Programming in Reinforcement Learning
Deriving the Dual of the Support Vector Machine Optimization Problem
Parametric tolerance and confidence regions
Frequent Itemset Mining and Support Counting in Unsupervised Machine Learning
Multiway Decision Tree Splits on Categorical Attributes and the Gain Ratio in Machine Learning
Supervised Learning Inductive Bias and the Complexity-Accuracy Tradeoff in Machine Learning
Deriving Partial Least Squares Directions from Response Correlation in Linear Regression
Multiway and Binary Splits Selected by Entropy in Decision Trees for Machine Learning
Deriving the Fisher Criterion Projection Direction in Linear Discriminant Analysis
Binary Outcomes and Logistic Regression Basics
Maximum Margin Formulation of Support Vector Machines in Machine Learning
One-Versus-One and One-Versus-All Strategies for Multiclass Classification in Machine Learning
The ROC Curve for Tuning Classifier Decision Thresholds in Machine Learning
Partitional Clustering with K-Means and K-Medoids in Machine Learning
Classification and discrimination; cluster analysis (statistical aspects)
Boosting Weak Learners into Strong Classifiers in Machine Learning
Bayesian Networks and Conditional Independence in Machine Learning
Greedy Recursive Partitioning and Region Means in Regression Trees for Machine Learning
Selecting Decision Tree Split Attributes with Cross Entropy and Gini Index in Machine Learning
Minimum Description Length Trading Model Complexity Against Error in Machine Learning
Undirected Graphical Models and Markov Blankets in Machine Learning
Gradient Boosting by Fitting Trees to Loss Function Residuals in Machine Learning
Perceptron Learning by Stochastic Gradient Descent on Misclassified Points in Machine Learning
Hinge Loss Formulation of Support Vector Machines with L^2 Regularization in Machine Learning
Parametric hypothesis testing
Expectation Maximization for Gaussian Mixture Models in Machine Learning
Equal Class Covariance and Linear Decision Boundaries in Linear Discriminant Analysis
Bayesian inference
Best Subset and Forward Stepwise Selection for Linear Regression in Machine Learning
Trial-and-Error Learning from Rewards and Punishments in Reinforcement Learning
Missing data
Ridge regression; shrinkage estimators (Lasso)
Maximum Likelihood Estimation of Model Parameters in Machine Learning
Running Ridge-Regularized Linear Regression on ARFF Data in the Weka Explorer
Random Variables Density Functions and Expectation in Probability Theory
Maximum a Posteriori Parameter Estimation with Priors in Machine Learning
One-Sample vs. Independent-Samples vs. Paired-Samples T-Tests
Choosing Evaluation Measures for Supervised Classification in Machine Learning
Markov processes: estimation; hidden Markov models
Least Squares Estimation in Regression Analysis
Belief Propagation for Reusing Marginal Inference in Probabilistic Graphical Models
Principal Components Regression on Orthogonal Variance Directions in Statistical Learning
Fitting Gaussian Mixture Models by Expectation Maximization in Machine Learning
CURE Clustering with Shrunk Representative Points for Large Data Sets in Data Mining
Instability of Decision Trees and Variance Reduction by Bagging in Machine Learning
DBSCAN Density-Based Clustering with Core Points and ε Neighborhoods
Choosing Split Points for Categorical Attributes in Decision Trees
Bagging Committee Machines and Stacking as Ensemble Methods in Machine Learning
Random Forests Decorrelating Bagged Trees in Machine Learning
Defining Learning by Task Experience and Performance Measure in Machine Learning
Backpropagation: Computing Gradients via the Chain Rule
Potential Functions and the Hammersley-Clifford Theorem in Markov Random Fields
Hierarchical Cluster Analysis using Euclidean Distance and Single Linkage
Forward Stagewise Selection of Predictor Subsets in Linear Regression
Designing Hypothesis Tests to Compare Machine Learning Algorithms
Constructing Probability Spaces from Sigma Algebras in Probability Theory
Formulating Mathematical Optimization Problems with Objective and Constraints for Machine Learning
Multivariate Linear Regression as a Series of Univariate Regressions
The Apriori Property for Candidate Pruning in Frequent Itemset Mining
Hypothesis Testing Frameworks for Null and Alternative Hypotheses
Slack Variables for Linearly Non-Separable Data in Support Vector Machines
Generalization Error and Hardness of Learning in Computational Learning Theory
Stopping Criteria and Cost-Complexity Pruning for Decision Trees in Machine Learning
Screening Test Evaluation
Matrix Diagonalization: A = PDP^-1 via Eigenvectors and Eigenvalues
Spectral Clustering with the Graph Laplacian and the Fiedler Vector in Machine Learning