Lecture 02
Lecture 02
Roberto Henriques
▪ Simulate evolution
▪ Reduce uncertainty
▪ As in mathematical operations
Addition 2+2=?
Subtraction 2+ ? = 4
Deduction Induction
▪ Logic programming
▪ Prolog
▪ Inductive and Abductive logic programming
▪ Expert systems
▪ Knowledge bases, Inference Engines,
▪ Decision Trees
▪ C4.5 the most popular, but has many variants, including regression trees and
random forests
▪ Main algorithms
▪ Perceptron (simple perceptron)
▪ Multilayer Perceptron (MLP)
▪ Varying structures, including feedback and time-delay
▪ DeepLearning Networks
▪ Convolutional Neural Networks
▪ Hopfield Networks
▪ Boltzman Networks
▪ Milestones:
▪ 1964: Lawrence Fogel published on evolutionary programming
▪ 1975: John Holland invents genetic algorithms.
▪ 1981: Richard Forsyth coins genetic programming and demonstrates it using
trees of actions.
▪ 1991: Dorigo writes a thesis on Ant Colony Optimization
▪ 1995: Kennedy & Eberhart invent Particle Swarm Optimization
▪ Draws on Statistics
▪ Bayes Theorem, and evidence
▪ Bayesian Classifiers
▪ NB, MAP, ML
▪ Milestones:
▪ 1968: k-nearest neighbor algorithm increases in popularity.
▪ 1979: Douglas Hofstadter publishes Godel, Escher, Bach.
▪ 1982. Kohonen’s book on Self-Organization and Associative Memory
▪ 1992: Support Vector Machines (SVMs) invented
▪ Representation
▪ Probabilistic logic (Markov logic Networks)
▪ Each rule has a weight
▪ Evaluation
▪ Posterior probability
▪ User-defined objective function
▪ Optimization
▪ Formula discovery: Genetic programming
▪ Weight learning: Backprop
The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World Pedro Domingos, 2015
Instituto Superior de Estatística e Gestão de Informação
Universidade Nova de Lisboa
Instituto Superior de Estatística e Gestão de Informação
Universidade Nova de Lisboa