ID3 algorithm
Decision tree algorithm
In decision tree learning, ID3 (Iterative Dichotomiser 3) is a greedy algorithm invented by Ross Quinlan used to generate a decision tree from a dataset. ID3 is the precursor to the C4.5 algorithm.
Nº Q1653378 ★
Common · Knowledge
ID3 algorithm
Decision tree algorithm
In decision tree learning, ID3 (Iterative Dichotomiser 3) is a greedy algorithm invented by Ross Quinlan used to generate a decision tree from a dataset. ID3 is the precursor to the C4.5 algorithm.
From Wikipedia
In decision tree learning, ID3 (Iterative Dichotomiser 3) is a greedy algorithm invented by Ross Quinlan used to generate a decision tree from a dataset. ID3 is the precursor to the C4.5 algorithm. The 3 in the name is meant to signify that this was Quinlan's third attempt at a model based on entropy-based splitting, and the term dichotomiser is a misnomer as it implies a binary split, but the ID3 algorithm can split on multi-valued attributes.
Text: Wikipédia, CC BY-SA 4.0. · Image: Original diagram: Acoggins38 SVG version: Ixfd64 (CC BY-SA 4.0) ·
Related cards
-
D3.js
JavaScript data visualization library using SVG and CSS
Nº Q3011087 ★
Not listed
-
Dirichlet convolution
Convolution operation defined on complex‐valued functions over positive integers
Nº Q6453184 ★
Not listed
-
J
Johnson's algorithm
Algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest
Nº Q2345824 ★
Not listed
-
D
Distributed artificial intelligence
Subfield of artificial intelligence
Nº Q3153007 ★
Not listed
-
N
Neuroevolution of augmenting topologies
Genetic algorithm for the generation of evolving artificial neural networks developed by Ken Stanley in 2002
Nº Q7002196 ★
Not listed
-
P
Planning Domain Definition Language
Planning programming language
Nº Q7201366 ★
Not listed
-
Decision tree learning
Algorithm that recursively splits data on attributes to build a tree for classification or regression
Nº Q16766476 ★★
Not listed
-
Merge sort
Worst-case optimal stable divide and conquer comparison sorting algorithm
Nº Q189057 ★★★
Not listed
-
B
Bareiss algorithm
Algorithm for calculating determinants
Nº Q4860404 ★
Not listed
-
Odd–even sort
Sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
Nº Q578580 ★
Not listed
-
A
Autoregressive conditional heteroskedasticity
Time series model
Nº Q180752 ★★
Not listed
-
I
IntelliJ IDEA
Integrated development environment
Nº Q1206660 ★★★
Not listed
-
W3Schools
Web development information website
Nº Q7946200 ★★
Not listed
-
F
Frank–Wolfe algorithm
Optimization algorithm
Nº Q2020318 ★
Not listed
-
Merge-insertion sort
Sorting algorithm
Nº Q56277713 ★
Not listed
-
MUSIC (algorithm)
Algorithm used for frequency estimation and radio direction finding
Nº Q3841682 ★
Not listed
-
E
EdDSA
Digital signature scheme
Nº Q16966748 ★★
Not listed
-
Simplex algorithm
Algorithm
Nº Q134164 ★★★
Not listed