Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Ensemble Methods: Random Forests

In course

ME-390: Foundations of artificial intelligence

This course provides the students with 1) a set of theoretical concepts to understand the machine learning approach; and 2) a subset of the tools to use this approach for problems arising in mechanical engineering applications. ...

Description

This lecture covers ensemble methods, focusing on random forests and Gaussian Naive Bayes. It explains the concept of ensemble learning, the construction of decision trees, and the use of bagging, boosting, and stacking. The instructor discusses the random forest algorithm, which combines multiple decision trees to improve prediction accuracy. Additionally, the lecture delves into Gaussian Naive Bayes, a probabilistic classifier based on Bayes' theorem and the assumption of feature independence. The instructor demonstrates how Gaussian Naive Bayes estimates the conditional Gaussian distribution for each feature using sample data.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Maryam Kamgarpour

Maryam Kamgarpour holds a Doctor of Philosophy in Engineering from the University of California, Berkeley and a Bachelor of Applied Science from University of Waterloo, Canada. Her research is on safe decision-making and control under uncertainty, game theory and mechanism design, mixed integer and stochastic optimization and control. Her theoretical research is motivated by control challenges arising in intelligent transportation networks, robotics, power grid systems and healthcare. She is the recipient of NASA High Potential Individual Award, NASA Excellence in Publication Award, and the European Union (ERC) Starting Grant.

Official source

Ontological neighbourhood

Information engineering

Machine learning: Decision tree learning

Statistics

Statistical inference: Mathematical statistics

Related concepts (32)

Naive Bayes classifier

In statistics, naive Bayes classifiers are a family of simple "probabilistic classifiers" based on applying Bayes' theorem with strong (naive) independence assumptions between the features (see Bayes classifier). They are among the simplest Bayesian network models, but coupled with kernel density estimation, they can achieve high accuracy levels. Naive Bayes classifiers are highly scalable, requiring a number of parameters linear in the number of variables (features/predictors) in a learning problem.

Random forest

Random forests or random decision forests is an ensemble learning method for classification, regression and other tasks that operates by constructing a multitude of decision trees at training time. For classification tasks, the output of the random forest is the class selected by most trees. For regression tasks, the mean or average prediction of the individual trees is returned. Random decision forests correct for decision trees' habit of overfitting to their training set.

Decision tree learning

Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning. In this formalism, a classification or regression decision tree is used as a predictive model to draw conclusions about a set of observations. Tree models where the target variable can take a discrete set of values are called classification trees; in these tree structures, leaves represent class labels and branches represent conjunctions of features that lead to those class labels.

Decision tree

A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains conditional control statements. Decision trees are commonly used in operations research, specifically in decision analysis, to help identify a strategy most likely to reach a goal, but are also a popular tool in machine learning.

Ensemble learning

In statistics and machine learning, ensemble methods use multiple learning algorithms to obtain better predictive performance than could be obtained from any of the constituent learning algorithms alone. Unlike a statistical ensemble in statistical mechanics, which is usually infinite, a machine learning ensemble consists of only a concrete finite set of alternative models, but typically allows for much more flexible structure to exist among those alternatives.

Related lectures (31)

Supervised Learning: k-NN and Decision Trees

Introduces supervised learning with k-NN and decision trees, covering techniques, examples, and ensemble methods.

Decision Trees: Induction & Attributes

Explores decision trees, attribute selection, bias-variance tradeoff, and ensemble methods in machine learning.

Machine Learning Basics: Supervised and Unsupervised Learning

Covers the basics of machine learning, supervised and unsupervised learning, various techniques like k-nearest neighbors and decision trees, and the challenges of overfitting.

Decision Trees and CLT's: Inference and Machine Learning

Explores decision trees, ensembles, CLT, inference, machine learning, diagnostic methods, boosting, and variance estimation.

Machine Learning Basics: Supervised Learning