Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen AI Kurs an der Misr International University zu.
in GA (GENERATING A SET OF RANDOM SOLUTIONS
these encoded strings are sometimes called
? and individual bits are called?
“genotypes” or “chromosomes” - genes
the time for building a tree may be lower than another type of classifier (T OR F)
false , higher
Set of all classification rules hi we allow.
Hypothesis Space H
classification model by building a tree
checks to see if data is homogeneous or not?
Mapping from Attributes to Target Feature
support tool that uses a tree-like graph or model of decision and their possible consequences, including chance event outcome, resource costs, and utility.
: Set of instances labeled with Target Feature
what is used in analysis, to help identify a strategy most likely to reach a goal.
is an algorithm used to generate a decision tree invented by Ross Quinlan
ID3 (iterative dichotomiser 3)
a set which contain n training set, S is divided into c classes, each class contain ni , then the entropy of S divided by c classes is.
problems with decision tree?
ID3 is not optimal
it must use discrete (discretized) attributes
Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.Jetzt loslegen