Escolar Documentos
Profissional Documentos
Cultura Documentos
Sc, PhD(c)
ing.leonelrozo@gmail.com
2010
Decision tree learning is one of the most widely used and practical
methods for inductive inference. It is a method for approximating
discrete-valued functions that is robust to noisy data and capable of
learning disjunctive expressions.
1. Decision tree representation
• The target function has discrete output values - The decision tree
assigns a boolean classification (e.g., yes or no) to each
example.
2. The best attribute is selected and used as the test at the root
node of the tree.
Subset of S for
which attribute A
has value v
An illustrative example
4. Issues in decision tree learning
Approaches that stop growing the tree earlier, before it reaches the
point where it perfectly classifies the training data.
Approaches that allow the tree to overfit the data, and then post-prune
the tree.
4. Issues in decision tree learning
Rule post-pruning
iv. Sort the pruned rules by their estimated accuracy, and consider them
in this sequence when classifying subsequent instances.
4. Issues in decision tree learning
“The amount of activity at any given point in the brain cortex is the sum
of the tendencies of all other points to discharge into it, such tendencies
being proportionate…” (William James)
The small gap between an end bulb and a dendrite is called a synapse,
across which information is propagated. The axon of a single neuron
forms synaptic connections with many other neurons.
3. Structure and function of a single neuron
A neuron will fire if sufficient signals from other neurons fall upon its
dendrites in a short period of time, called the period of latent
summation.
3. Structure and function of a single neuron
Ramp functions
Step functions
3. Structure and function of a single neuron
Sigmoid functions
Layered networks
Acyclic networks
4. Neural net architectures
Feedforward networks
Modular networks
5. Neural learning
Correlation learning
Competitive learning
The connections between input nodes and the winner node are
then modified , increasing the likelihood that the same winner
continues to win in future competitions.
Classification
6. What can neural networks be used for ?
Clustering
Pattern association
Function approximation
Forescasting
Control applications
Quality of results
• Euclidean distance
Generalizability
Computational resources