Introduction to Artificial Intelligence Revision Session.

Slides:



Advertisements
Similar presentations
Learning School of Computing, University of Leeds, UK AI23 – 2004/05 – demo 2.
Advertisements

Cognitive Systems, ICANN panel, Q1 What is machine intelligence, as beyond pattern matching, classification and prediction. What is machine intelligence,
Learning in Neural and Belief Networks - Feed Forward Neural Network 2001 년 3 월 28 일 안순길.
Algorithms + L. Grewe.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Tuomas Sandholm Carnegie Mellon University Computer Science Department
Chapter 10 Artificial Intelligence © 2007 Pearson Addison-Wesley. All rights reserved.
An Introduction to Machine Learning In the area of AI (earlier) machine learning took a back seat to Expert Systems Expert system development usually consists.
Artificial Neural Networks Artificial Neural Networks are (among other things) another technique for supervised learning k-Nearest Neighbor Decision Tree.
Chapter 13 Artificial Intelligence. Introduction Artificial intelligence (AI) is the part of computer science that attempts to make computers act like.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
1 MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING By Kaan Tariman M.S. in Computer Science CSCI 8810 Course Project.
CPSC 322 Introduction to Artificial Intelligence September 10, 2004.
Hub Queue Size Analyzer Implementing Neural Networks in practice.
Neural Networks. Background - Neural Networks can be : Biological - Biological models Artificial - Artificial models - Desire to produce artificial systems.
Supervised Learning: Perceptrons and Backpropagation.
Artificial Neural Networks for Secondary Structure Prediction CSC391/691 Bioinformatics Spring 2004 Fetrow/Burg/Miller (slides by J. Burg)
Artificial Intelligence (AI) Addition to the lecture 11.
Revision Michael J. Watts
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Chapter 11: Artificial Intelligence
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Introduction to AI Michael J. Watts
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice A. J. Gonzalez and D. D. Dankel.
Artificial Neural Network Theory and Application Ashish Venugopal Sriram Gollapalli Ulas Bardak.
Artificial Neural Nets and AI Connectionism Sub symbolic reasoning.
 Prominent AI Reseacher  Colleague of Alan Turing at Bletchley Park  1992 Paper: ◦ Turing’s Test and Conscious Thought Turing’s Test and Conscious.
 The most intelligent device - “Human Brain”.  The machine that revolutionized the whole world – “computer”.  Inefficiencies of the computer has lead.
RECENT DEVELOPMENTS OF INDUCTION MOTOR DRIVES FAULT DIAGNOSIS USING AI TECHNIQUES 1 Oly Paz.
Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l all learning algorithms,
Introduction to Artificial Intelligence and Soft Computing
Introduction to Artificial Intelligence. Artificial Intelligence  AI is often divided into two basic ‘camps’  Rule-based systems (RBS)  Biological.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
CSC Intro. to Computing Lecture 22: Artificial Intelligence.
I Robot.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
CSCI 4310 Lecture 2: Search. Search Techniques Search is Fundamental to Many AI Techniques.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Introduction to Artificial Intelligence CS 438 Spring 2008.
Neural Networks Presented by M. Abbasi Course lecturer: Dr.Tohidkhah.
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
Presented by:- Reema Tariq Artificial Intelligence.
Kim HS Introduction considering that the amount of MRI data to analyze in present-day clinical trials is often on the order of hundreds or.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Chapter 13 Artificial Intelligence. Artificial Intelligence – Figure 13.1 The Turing Test.
Artificial Intelligence
Artificial Neural Networks This is lecture 15 of the module `Biologically Inspired Computing’ An introduction to Artificial Neural Networks.
Using AI: Learning as Search. Introduction to Artificial Intelligence Semester 1, Lecture 3:
Neural Network Architecture Session 2
Chapter 11: Artificial Intelligence
Split-Brain Studies What do you see? “Nothing”
Chapter 11: Artificial Intelligence
PART IV: The Potential of Algorithmic Machines.
Done Done Course Overview What is AI? What are the Major Challenges?
Soft Computing Applied to Finite Element Tasks
Artificial Intelligence and Society
Artificial Intelligence
Introduction to Artificial Intelligence and Soft Computing
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
Future of Artificial Intelligence
David Kauchak CS158 – Spring 2019
Artificial Intelligence Machine Learning
Presentation transcript:

Introduction to Artificial Intelligence Revision Session

This course is about practical AI Started off by looking at ideas of what AI could be, attempts to reproduce consciousness, strong vs weak – Turing test – Searle’s Chinese room argument – Experience with chatbots We’re clearly years (if ever) from achieving human like intelligence

Problem Solving So this course is about: how people solve problems and do tasks How we can get machines to do it for us – Means some formalisation: ideas=> algorithms In term 2 we also looked at how nature does some problem solving

How do people solve problems? I used lots of examples in tutorials e.g. driving cars, planning routes, table tennis People solve big problems by breaking them down into little ones Different types of problems use different mental tools (different parts of the brain)

5 Computers as black boxes Model InputOutput A way of grouping problems according to missing element: to give us extra insight so we can identify appropriate technology

Example: road sign recognition Experienced driver does it subconsciously, visual inputs trigger stimulus of concept Given suitable cameras &image processing, an AI system could do this with: – a trained Artificial Neural network – A set of rules hard coded by an expert – A decision tree – Finding the “nearest neighbour” from a set of examples

Learning to recognise road signs Humans do this quite quickly, – because they are designed to exploit earlier learning e.g. Recognising numbers Machines can do this too: – We provide them with lots of labelled examples and they learn to build/refine a model: training the ANN with back-propagation, inducing the rule set, Constructing or evolving a decision tree

We can even have an optimisation component Humans quickly learn what to look for in the images and what bits to ignore to help us generalise – As babies we learn to focus our eyes... There is an optimisation task: – selecting and tuning the image processing that goes into the model. – whether that model is learned or provided by humans

Optimisation / planning problems Given a model of the system /world (or the logic that governs it) task it to find the (series of) inputs that meets some desired goal Route planning, robot/car actuators, planning (e.g. Cannibals/hostages), shot selection, deciding on a game strategy Tree search (depth-, breadth..), hill-climbing, Genetic algorithms

Model –building problems Given a set of experiences (stimulus- response, cause-effect,...) task is to find a model that maps inputs onto the right outputs Maze learning for re-use, learning to recognise things, characterising opponents, diagnostic support,... Rule induction, back-prop to train an ANN, using Genetic Programming to evolve trees

Simulation/classification problems Given a model of how the world works (rule base, ANN, first order logic, “rules of game”) and some set of inputs (measurements of state of world) find the appropriate output Sudoko, recognition, decision support, logic problems, applying game strategy Feed inputs into trained decision tree/ANN, forward chaining rules in expert system

Common theme: search to find right set of moves to take best weights for a given ANN structure right sequence of rules to apply Can be considered as finding the right one from a whole set of alternatives

How do people do this? Lots of evidence that early learning (recognition, control of arms etc.) is done by trial and error with corrective signals Many “conscious” activities are constructive: – Series of decisions considering alternatives – With backtracking Not all: e.g. route finding from map, “brainstorming”

How can we programme this into a computer? Term 1: We looked at approaches based on how we think people do things logically – State-based search using finite State Machines – Logic programming, depth-first, breadth-first, A* – typically thought of as constructive Term 2: Nature inspired approaches – Iteratively refine “whole” solutions – apply set of rules to move between/ generate solutions based on some fedback (quality)

Example: “blind” depth-first search Humans: series of decisions Computer: series of assigning values to variables Humans: explore one solution and backtrack if necessary – Exploring a maze, sudoko with a rubber Computer: depth-first search using stack to store nodes (decisions made)

Example – maze

Alternative state search methods Breadth-first if no information to guide search Hill-climbing, if there is information to help make a decision about which route to take out of node best-first, A* as more complex (memory) variations

Knowledge Representation Sometimes use Finite State Machines Sometimes useful to explicitly store and manipulate knowledge, facts – Knowledge representation – Semantic nets, frames, semantic web

Artificial Neural Networks The human brain starts off with a model of the world and then improves it. ANN’s based on perceptron as highly stylised model of a single neuron Configuration + weights = model Back-prop as a way of changing weights (moving between models) to minimise error on training set

Evoltionary Computation Generic search mechanism based on evolution Species encoded as DNA= solution encoded in binary/vector/lisp Typically used for optimisation, but not always – E.g. Could evolve weights for ANN – GP evolves trees that could be programmes, decision trees

General Scheme of EAs

Swarm Computing Means to automate the creation of useful behaviours via lots of really simple interacting things. – Search behaviour e.g. Ant colonies, evolution, particle swarm – Can get lifelike behaviours with minimal programming – good for animations etc How do you find the right rules? – Expert system, evolution?

AI in practice Break your problem down into little bits Characterise each sub-task – What type of problem is it, – What type of technology might be appropriate – How might you encode a (partial) solution? Don’t be afraid to mix and match