how to understand "Decision tree for classification (text description)"
2 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
Amend
el 14 de Abr. de 2015
Editada: marwa lagha
el 14 de Jun. de 2017
The "Decision tree for classification (text description)" is difficult to understand. Who can give detail explanation.
Thank you
0 comentarios
Respuesta aceptada
Roberto Herrera-Lara
el 14 de Abr. de 2015
The philosophy of operation of any algorithm based on decision trees is quite simple. In fact, although sometimes containing important differences in the way to do this or that step, any algorithm of this category is based on the strategy of divide and conquer. In general, this philosophy is based on the successive division of the problem into several subproblems with a smaller number of dimensions, until a solution for each of the simpler problems can be found. Based on this principle, the classifiers based on decision trees try to find ways to divide the universe into successively more subgroups (creating nodes containing the respective tests) until each addressing only one class or until one of the classes shows a clear majority do not justifying further divisions, generating in this situation a leaf containing the class majority....
more details here,
http://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R/Classification/Decision_Trees
http://ocw.mit.edu/courses/sloan-school-of-management/15-097-prediction-machine-learning-and-statistics-spring-2012/lecture-notes/MIT15_097S12_lec08.pdf
0 comentarios
Más respuestas (1)
Amend
el 15 de Abr. de 2015
Editada: Amend
el 15 de Abr. de 2015
1 comentario
marwa lagha
el 14 de Jun. de 2017
Editada: marwa lagha
el 14 de Jun. de 2017
it is easier for you to view the decision tree rather that thinking wether it is left or right branch
view(Mdl,'mode','graph');
Ver también
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!