Decision Tree 3: which attribute to split on?
Full lecture: http://bit.ly/D-Tree
Which attribute do we select at each step of the ID3 algorithm? The attribute that results in the most pure subsets. We can measure purity of a subset as the entropy (degree of uncertainty) about the class within the subset.
Видео Decision Tree 3: which attribute to split on? канала Victor Lavrenko
Which attribute do we select at each step of the ID3 algorithm? The attribute that results in the most pure subsets. We can measure purity of a subset as the entropy (degree of uncertainty) about the class within the subset.
Видео Decision Tree 3: which attribute to split on? канала Victor Lavrenko
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
StatQuest: Decision Trees
Let’s Write a Decision Tree Classifier from Scratch - Machine Learning Recipes #8
Decision Tree 1: how it works
AdaBoost, Clearly Explained
1. Decision Tree | ID3 Algorithm | Solved Numerical Example | by Mahesh Huddar
Decision Tree 5: overfitting and pruning
Decision Tree 7: continuous, multi-class, regression
StatQuest: Random Forests Part 1 - Building, Using and Evaluating
Information Gain - How to identify best split in Decision Trees
K-Mean Clustering
Data Analysis 8: Classifying Data - Computerphile
Decision Tree Algorithm | Decision Tree in Python | Machine Learning Algorithms | Edureka
Gradient Descent, Step-by-Step
Decision Tree Full Course | #4. How to Select the Best Split Point in Decision Trees
k nearest neighbor (kNN): how it works
Supervised and Unsupervised Learning In Machine Learning | Machine Learning Tutorial | Simplilearn
Perhitungan GINI Index dan Gini Spliting Index dalam Classification dan Decision Trees, Contoh 1
Interview Questions On Decision Tree- Data Science