Ch 9. Machine Learning Symbol-based.ppt

Machine Learning Ch 9. Machine Learning: Symbol-based 9.0 Introduction 9.1 A Framework for Symbol-Based Learning 9.2 Version Space Search The Candidate Elimination Algorithm 9.3 ID3 Decision Tree Induction Algorithm 9.5 Knowledge and Learning Explanation-Based Learning 9.6 Unsupervised Learning Conceptual clustering 9.0 Introduction Learning through the course of their interactions with the world through the experience of their own internal states and processes Is important for practical applications of AI Knowledge engineering bottleneck major obstacle to the widespread use of intelligent systems the cost and difficulty of building expert systems using traditional knowledge acquisition techniques one solution For program to begin with a minimal amount of knowledge And learn from examples, high-level advice, own explorations of the domain 9.0 Introduction Definition of learning Views of Learning Generalization from experience Induction: must generalize correctly to unseen instances of domain Inductive biases: selection criteria (must select the most effective aspects of their experience) Changes in the learner acquisition of explicitly represented domain knowledge, based on its experience, the learner constructs or modifies expressions in a formal language (e.g. logic). 9.0 Introduction Learning Algorithms vary in goals, available training data, learning strategies and knowledge representation languages All algorithms learn by searching through a space of possible concepts to find an acceptable generalization (concept space Fig. 9.5) Inductive learning learning a generalization from a set of examples concept learning is a typical inductive learning infer a definition from given examples of some concept (e.g. cat, soybean disease) allow to correctly recognize future instances of that concept Two algorithms: version space search and ID3 9.0 Introduction Similarity-based vs. Explanation-based Similarity-based (data-driven) using no prior knowledge of the domain