Knowledge Acquisition from Game Records Takuya Kojima, Atsushi Yoshikawa Dept. of Computer Science and Information Engineering National Dong Hwa University.

Slides:



Advertisements
Similar presentations
Managerial Accounting and Cost Classification
Advertisements

Learning in Computer Go David Silver. The Problem Large state space  Approximately states  Game tree of about nodes  Branching factor.
Document Summarization using Conditional Random Fields Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, Zheng Chen IJCAI 2007 Hao-Chin Chang Department of Computer.
Sequential Minimal Optimization Advanced Machine Learning Course 2012 Fall Semester Tsinghua University.
DECISION TREES. Decision trees  One possible representation for hypotheses.
Learning Positional Features for Annotating Chess Games: A Case Study Matej Guid, Martin Mozina, Jana Krivec, Aleksander Sadikov and Ivan Bratko CG 2008.
Conceptual Graph Analysis Chapter 20 Lori Nuth | EDIT 730 | Fall 2005.
Decision Making: An Introduction 1. 2 Decision Making Decision Making is a process of choosing among two or more alternative courses of action for the.
Cognitive Psychology Chapter 7. Cognitive Psychology: Overview  Cognitive psychology is the study of perception, learning, memory, and thought  The.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Identifying "Good" Architectural Design Alternatives with Multi-Objective Optimization Strategies By Lars Grunske Presented by Robert Dannels.
Decision Tree Algorithm
Early Term Test Some Study Reminders. General Topics Sources for information to be tested are –My slides and classroom presentations of slides –Chapter.
1 Life-and-Death Problem Solver in Go Author: Byung-Doo Lee Dept of Computer Science, Univ. of Auckland Presented by: Xiaozhen Niu.
Ensemble Learning: An Introduction
Data Mining with Decision Trees Lutz Hamel Dept. of Computer Science and Statistics University of Rhode Island.
Co-training LING 572 Fei Xia 02/21/06. Overview Proposed by Blum and Mitchell (1998) Important work: –(Nigam and Ghani, 2000) –(Goldman and Zhou, 2000)
EXPERT SYSTEMS Part I.
Chapter 6: Multilayer Neural Networks
1 Ensembles of Nearest Neighbor Forecasts Dragomir Yankov, Eamonn Keogh Dept. of Computer Science & Eng. University of California Riverside Dennis DeCoste.
ML ALGORITHMS. Algorithm Types Classification (supervised) Given -> A set of classified examples “instances” Produce -> A way of classifying new examples.
© Prentice Hall1 DATA MINING Introductory and Advanced Topics Part II Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
MACHINE LEARNING. What is learning? A computer program learns if it improves its performance at some task through experience (T. Mitchell, 1997) A computer.
For Better Accuracy Eick: Ensemble Learning
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Where Are the Nuggets in System Audit Data? Wenke Lee College of Computing Georgia Institute of Technology.
1 Template-Based Classification Method for Chinese Character Recognition Presenter: Tienwei Tsai Department of Informaiton Management, Chihlee Institute.
Genetic Algorithm.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
How to make a presentation (Oral and Poster) Dr. Bernard Chen Ph.D. University of Central Arkansas July 5 th Applied Research in Healthy Information.
Copyright R. Weber Machine Learning, Data Mining ISYS370 Dr. R. Weber.
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter 10 Supporting Decision Making.
A Simple Method to Extract Fuzzy Rules by Measure of Fuzziness Jieh-Ren Chang Nai-Jian Wang.
Wavelet-Based Multiresolution Matching for Content-Based Image Retrieval Presented by Tienwei Tsai Department of Computer Science and Engineering Tatung.
Introduction to variable selection I Qi Yu. 2 Problems due to poor variable selection: Input dimension is too large; the curse of dimensionality problem.
Presented by Tienwei Tsai July, 2005
Perception-Based Classification (PBC) System Salvador Ledezma April 25, 2002.
Position Evaluation in Computer Go Martin Muller Dept. of Computer Science and Information Engineering National Dong Hwa University Reporter : Lo Jung-Yun.
Market Research Lesson 6. Objectives Outline the five major steps in the market research process Describe how surveys can be used to learn about customer.
AI Week 14 Machine Learning: Introduction to Data Mining Lee McCluskey, room 3/10
Data Mining Knowledge on rough set theory SUSHIL KUMAR SAHU.
1 N -Queens via Relaxation Labeling Ilana Koreh ( ) Luba Rashkovsky ( )
INVENTORY CONTROL AS IDENTIFICATION PROBLEM BASED ON FUZZY LOGIC ALEXANDER ROTSHTEIN Dept. of Industrial Engineering and Management, Jerusalem College.
Combining multiple learners Usman Roshan. Bagging Randomly sample training data Determine classifier C i on sampled data Goto step 1 and repeat m times.
CHECKERS: TD(Λ) LEARNING APPLIED FOR DETERMINISTIC GAME Presented By: Presented To: Amna Khan Mis Saleha Raza.
Personalized Course Navigation Based on Grey Relational Analysis Han-Ming Lee, Chi-Chun Huang, Tzu- Ting Kao (Dept. of Computer Science and Information.
Date : 2013/03/18 Author : Jeffrey Pound, Alexander K. Hudek, Ihab F. Ilyas, Grant Weddell Source : CIKM’12 Speaker : Er-Gang Liu Advisor : Prof. Jia-Ling.
METU Informatics Institute Min720 Pattern Classification with Bio-Medical Applications Lecture notes 9 Bayesian Belief Networks.
MACHINE LEARNING 10 Decision Trees. Motivation  Parametric Estimation  Assume model for class probability or regression  Estimate parameters from all.
Distributed Models for Decision Support Jose Cuena & Sascha Ossowski Pesented by: Gal Moshitch & Rica Gonen.
Objectives: Terminology Components The Design Cycle Resources: DHS Slides – Chapter 1 Glossary Java Applet URL:.../publications/courses/ece_8443/lectures/current/lecture_02.ppt.../publications/courses/ece_8443/lectures/current/lecture_02.ppt.
Solving Tsumego on Computers M2 Hirokazu Ishii Chikayama & Taura Lab.
Using decision trees to build an a framework for multivariate time- series classification 1 Present By Xiayi Kuang.
1 An Efficient Optimal Leaf Ordering for Hierarchical Clustering in Microarray Gene Expression Data Analysis Jianting Zhang Le Gruenwald School of Computer.
1 Systematic Data Selection to Mine Concept-Drifting Data Streams Wei Fan Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery.
Cell Segmentation in Microscopy Imagery Using a Bag of Local Bayesian Classifiers Zhaozheng Yin RI/CMU, Fall 2009.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Chapter 11: Artificial Intelligence
Information Management course
Issues in Decision-Tree Learning Avoiding overfitting through pruning
Reducing Training Time in a One-shot Machine Learning-based Compiler
Introduction to Data Mining, 2nd Edition
Lecture 6: Introduction to Machine Learning
Predicting Loan Defaults
Presentation transcript:

Knowledge Acquisition from Game Records Takuya Kojima, Atsushi Yoshikawa Dept. of Computer Science and Information Engineering National Dong Hwa University Reporter : Lo Jung-Yun

2 Outline Introduction A Deductive Approach An Evolutionary Approach Conclusions

3 Introduction

4 Purpose The knowledge of human experts has two important features: quality and quantity Some systems have tried to acquire Go knowledge, most of them acquire only fixed-shaped knowledge A new algorithm which yields more flexible knowledge is therefore necessary

5 Classification of Go knowledge Classify Go knowledge according to two criteria –Form Patterns Sequence of moves maxims –Degree of validity Strict knowledge Heuristic knowledge

6 Two Approaches This paper focuses on pattern knowledge Strict Knowledge Heuristic Knowledge Deductive Approach Evolutionary Approach Several rules are acquired from a single training example Acquire a large amount of heuristic knowledge from a large amount of training examples

7 A Deductive Approach

8 System overview

9 Model introduction Knowledge base –Basic rules –Forcing rules Decision maker

10 Rule acquisition algorithm Chooses good moves to be learned Extracts relevant parts from board configuration Generalizes the position and the move

11 An Evolutionary Approach

12 Concept Each rule takes the form of a production rule There are no rules in the initial state Feed, consume, and split –with activation value

13 Algorithm

14 Rules Feeding –When five rules are matched… Consuming –Each rule consumes activation value at each step –Rule whose activation value is 0 die Splitting –If activation value is greater than threshold – split it! Original rules → “parent” Randomly add a new condition from among the objects on the current board

15 Application to Tsume-Go Maybe many rules apply in the same situation –Assign priority Priority assignment algorithm –Assignment of weight to rules –Probability of rule accuracy

16 Application to Tsume-Go Compare with two algorithm –Fixed algorithm –Semi-fixed algorithm

17 Application to Tsume-Go

18 Conclusions Explain 2 approaches: –Deductive –Evolutionary The performance is as good as 1 dan human players