Chapter 10 Artificial Intelligence. 2 Chapter 10: Artificial Intelligence 10.1 Intelligence and Machines 10.2 Understanding Images 10.3 Reasoning 10.4.

Slides:



Advertisements
Similar presentations
Chapter 09 AI techniques in different game genres (Puzzle/Card/Shooting)
Advertisements

Decision Support and Artificial Intelligence Jack G. Zheng May 21 st 2008 MIS Chapter 4.
Decision Support and Artificial Intelligence Jack G. Zheng July 11 th 2005 MIS Chapter 4.
Best-First Search: Agendas
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
1 Lecture 35 Brief Introduction to Main AI Areas (cont’d) Overview  Lecture Objective: Present the General Ideas on the AI Branches Below  Introduction.
Chapter 10 Artificial Intelligence © 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Artificial Intelligence
1 Chapter 4 Decision Support and Artificial Intelligence Brainpower for Your Business.
1 MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING By Kaan Tariman M.S. in Computer Science CSCI 8810 Course Project.
October 7, 2010Neural Networks Lecture 10: Setting Backpropagation Parameters 1 Creating Data Representations On the other hand, sets of orthogonal vectors.
Artificial Intelligence
3.11 Robotics, artificial intelligence and expert systems Strand 3 Karley Holland.
Artificial Intelligence
Artificial Intelligence (AI) Addition to the lecture 11.
Enabling Organization-Decision Making
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Chapter 11: Artificial Intelligence
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Invitation to Computer Science 5th Edition
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
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.
What is Artificial Intelligence? AI is the effort to develop systems that can behave/act like humans. Turing Test The problem = unrestricted domains –human.
计算机科学概述 Introduction to Computer Science 陆嘉恒 中国人民大学 信息学院
Artificial Neural Nets and AI Connectionism Sub symbolic reasoning.
11 C H A P T E R Artificial Intelligence and Expert Systems.
 The most intelligent device - “Human Brain”.  The machine that revolutionized the whole world – “computer”.  Inefficiencies of the computer has lead.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
NEURAL NETWORKS FOR DATA MINING
LINEAR CLASSIFICATION. Biological inspirations  Some numbers…  The human brain contains about 10 billion nerve cells ( neurons )  Each neuron is connected.
Fundamentals of Information Systems, Third Edition2 Principles and Learning Objectives Artificial intelligence systems form a broad and diverse set of.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition.
Succeeding with Technology: Second Edition
KNOWLEDGE BASED TECHNIQUES INTRODUCTION many geographical problems are ill-structured an ill-structured problem "lacks a solution algorithm.
Chapter 11 Artificial Intelligence Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Lecture on Introduction to Artificial Intelligence Chapter#10 Sec 10.1 and 10.3 (before Heuristics)
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.
I Robot.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition.
PARALLELIZATION OF ARTIFICIAL NEURAL NETWORKS Joe Bradish CS5802 Fall 2015.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
ARTIFICIAL INTELLIGENCE include people, procedures, hardware, software, data and knowledge needed to develop computer systems and machines that demonstrated.
Artificial Intelligence, simulation and modelling.
Pattern Recognition. What is Pattern Recognition? Pattern recognition is a sub-topic of machine learning. PR is the science that concerns the description.
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.
Fundamentals of Information Systems, Sixth Edition
Chapter 11: Artificial Intelligence
Artificial Intelligence Chapter 11 – Artificial Intelligence
Fundamentals of Information Systems
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
Chapter 11: Artificial Intelligence
Neural Computing: The Basics
PART IV: The Potential of Algorithmic Machines.
Artificial Intelligence (CS 370D)
What is an ANN ? The inventor of the first neuro computer, Dr. Robert defines a neural network as,A human brain like system consisting of a large number.
Artificial Intelligence
Introduction Artificial Intelligent.
Creating Data Representations
AI and Agents CS 171/271 (Chapters 1 and 2)
Presentation transcript:

Chapter 10 Artificial Intelligence

2 Chapter 10: Artificial Intelligence 10.1 Intelligence and Machines 10.2 Understanding Images 10.3 Reasoning 10.4 Artificial Neural Networks 10.5 Genetic Algorithms 10.6 Other Areas of Research 10.7 Considering the Consequences

3 Intelligent agents Agent = “ device ” that responds to stimuli from its environment Sensors — receive data from environment --microphone, camera Actuators — response to the stimuli --legs, wings, hands, The goal of artificial intelligence is to build agents that behave intelligently

4 Levels of intelligence in behavior Reflex: actions are predetermined responses to the input data Intelligent response: actions affected by knowledge of the environment Goal seeking Learning

5 Artificial intelligence research approaches Agent ’ s intelligence is judged by observing its input-response patterns Performance oriented: Researcher tries to maximize the performance of the agents. Simulation oriented: Researcher tries to understand how the agents produce responses.

6 Turing test Proposed by Alan Turing in 1950 Benchmark for progress in artificial intelligence Test setup: Human interrogator communicates with test subject by typewriter. Test: Can the human interrogator distinguish whether the test subject is human or machine?

7 Figure 10.1 The eight-puzzle in its solved configuration

8 Figure 10.2 Our puzzle-solving machine

9 Techniques for understanding images The first intelligent behavior required by the puzzle-solving machine is the extraction of information through a visual medium. Unlike photographing an image, the problem is to understand the image (Computer Vision) – the ability to perceive. Since the possible images are finite, the machine can merely compare the different sections of the picture to prerecorded templates pixel by pixel, and reveal the condition of the puzzle.

10 Techniques for understanding images Optical readers apply the similar method for image recognition (hand-writing). A certain degree of uniformity(style, size, orientation, non-overlapping, … ) is required. The alternative is to first extract the geometric features(digit 1: a single vertical line) and make comparison in terms of these features

11 Techniques for understanding images Template matching Image processing: identify the characteristics of the image. Edge enhancement to clarify the boundary (taking a derivative), Region(with common properties: color, … ) finding for identifying objects, Smoothing(removing flaws/noises in image),

12 Techniques for understanding images Image analysis: identify the meaning of these characteristics. -- It is to recognize partially obstructed objects from different perspectives. -- First, assumption of what the image might be is made. (clue) -- Then, associate the image components with the objects conjectured to exist.

13 Reasoning After deciphering the positions of tiles from visual image, the remaining task is to move the tiles to reach the final state from the current state. The eight-puzzle has many configurations such that explicitly hard-coded each case for problem solving is not generally feasible. Some algorithm is necessary to resolve the problem in a systematic way. The machine will then ably make decisions, draw conclusions, and perform elementary reasoning activities.

14 Components of production systems A production system classifies the common characteristics shared by a class of reasoning problems, and has the following components: 1. Collection of states Start or initial state Goal state 2. Collection of productions: rules or moves Each production may have preconditions 3. Control system: decides which production to apply next

15 Data processing for production systems State graph = states, productions, and preconditions A graph consists of nodes and arcs(arrows) connecting nodes.A state graph has nodes representing states and arrows representing rules. The arc linking two nodes signifies two states can be shift to each other using the rule; the absence of arcs implicitly indicates the preconditions are not met. The problem magnitude may be too large for explicitly showing the entire state graph. Partial representation of the state graph will help understand the problem.

16 Data processing for production systems State graph = states, productions, and preconditions Search tree = record of state transitions explored while searching for a goal state Breadth-first search Depth-first search

17 Figure 10.3 A small portion of the eight-puzzle ’ s state graph

18 Figure 10.4 Deductive reasoning in the context of a production system

19 Figure 10.5 An unsolved eight-puzzle

20 Figure 10.6 A sample search tree

21 Figure 10.7 Productions stacked for later execution

22 Figure 10.8 An unsolved eight-puzzle

23 Heuristic strategies Generally, a search tree may grow much huger if the nodes ’ fan-outs are large. It becomes more complicate if the goal is very far away. (more generations) Developing a full (exhaustive) search tree[brute-force methods] may be impractical. In contrast to this breadth-first approach (layer by layer), we (humans) may attempt to pursue the more promising paths to greater depths in a depth-first manner. (vertical)

24 Heuristic strategies Heuristic strategy is to develop a heuristic–a quantitative measure on how close a state is to the goal. Requirements for good heuristics Must be much easier to compute than a complete solution Must provide a reasonable estimate of proximity to a goal

25 Figure 10.9 An algorithm for a control system using heuristics

26 Figure The beginnings of our heuristic search

27 Figure The search tree after two passes

28 Figure The search tree after three passes

29 Figure The complete search tree formed by our heuristic system

30 Neural networks CPU is not capable of perceive and reasoning Artificial neuron Each input is multiplied by a weighting factor. Output is 1 if sum of weighted inputs exceeds a threshold value; 0 otherwise. Network is programmed by adjusting weights using feedback from examples.

31 Figure A neuron in a living biological system

32 Neural networks ANN are multi-processing architectures to model networks of concurrent neurons. Each processing unit in ANN is a simple device to simulate the neuron. The output of the unit may be 0 or 1, (or the fractional numbers in-between), dependent on the whether its effective input exceeds a given threshold value.

33 Figure The activities within a processing unit

34 Figure Representation of a processing unit

35 Figure A neural network with two different programs: (a) o=1 when 2 inputs diff (b)o=1 when both I=1

36 Neural networks Different weights determine different output values.Case (a) will produce 1 if its two inputs differ, while (b) outputs 1 if both inputs are 1’s. A human brain contains roughly 10^11 neurons with about 10^4 synapses per neuron.

37 character recognition: A specific application –character recognition: distinguish C and T, regardless of the orientation.The network produces a 0 if the recognized letter is C, or a 1 if the letter is a T.

38 Figure Uppercase C and uppercase T

39 Figure Various orientations of the letters C and T

40 Neural networks The system contains two levels of units. The first level has many units, one for each 3x3 block of pixels. Each unit has nine inputs; the inputs of adjacent units overlap.Threshold =.5, center’s weight = 2, others’weights = -1. The second level only has one unit, with a separate input for each unit in the first level. Threshold =.5, each weight = 1. It outputs a 1 iff at least one input is a 1.

41 Neural networks If “C”is present, all the first level units will produce a 0.All the possible cases can be enumerated. If “T”is present, only the first level’s unit (highlighted below) will output a 1, while others output 0’s.The final output is 1.

42 Figure The structure of the character recognition system

43 Figure The letter C in the field of view

44 Figure The letter T in the field of view

45 Associative memory Associative memory = the retrieval of information relevant to the information at hand One direction of research seeks to build associative memory using neural networks that when given a partial pattern, transition themselves to a completed pattern.

46 Figure An artificial neural network implementing an associative memory 1.The lines connecting circles are two-way connection i.e. output of one unit is connected As input of other unit 2. The number associated with Lines are weights 3. The number inside the circle is threshold

47 Figure The steps leading to a stable configuration Two stable states 1.Perimeter stable state (later stable state) When we initialize the Network with a least four Adjacent units on the Perimeter in their excited states 1

48 The steps leading to a stable configuration Two stable states 2. Center stable state (former stable state) When we initialize the Network with center excited And no more than two of Perimeter in their excited states

49 Genetic algorithms Simulate genetic processes to evolve algorithms Start with an initial population of “ partial solutions. ” Graft together parts of the best performers to form a new population. Periodically make slight modifications to some members of the current population. Repeat until a satisfactory solution is obtained.

50 Figure Crossing two poker-playing strategies

51 Figure Coding the topology of an artificial neural network

52 Language processing Syntactic analysis(subject,verb, noun) Semantic analysis(identify actions) Contextual analysis(understanding) --The bat flew from his hand. Entire database Information retrieval(web searching) Information extraction(template) Semantic net(a large linked data structure)

53 Figure A semantic net

54 Robotics Began as a field within mechanical and electrical engineering Today encompasses a much wider range of activities Robot cup competition Evolutionary robotics

55 Expert systems Expert system = software package to assist humans in situations where expert knowledge is required Example: medical diagnosis Often similar to a production system Blackboard model: several problem-solving systems share a common data area

56 Some issues raised by artificial intelligence When should a computer ’ s decision be trusted over a human ’ s? If a computer can do a job better than a human, when should a human do the job anyway? What would be the social impact if computer “ intelligence ” surpasses that of many humans?