From Inductive Learning Towards Interactive Inductive Learning
نویسندگان
چکیده
منابع مشابه
Towards the Validation of Inductive Learning Systems
The present paper deals with inductive inference of recur-sive functions, in general, and with the problem of validating inductive learning devices, in particular. Thus, the paper aims at a contribution to the research and development area of intelligent systems validation. As those systems are typically interactive and, therefore, utilized in open loops of human{machine interactions, the probl...
متن کاملInductive Learning from Good Examples
We study what kind of data may ease the computational complexity of learning of Horn clause theories (in Gold's paradigm) and Boolean functions (in PAC-learning paradigm). We give several deenitions of good data (basic and generative representative sets), and develop data-driven algorithms that learn faster from good examples, and degenerate to learn in the limit from the \worst" possible examp...
متن کاملMechanisms for Inductive Learning: from Base-Learning to Meta-Learning
This paper briefly surveys the state of the art of a particular mechanism of learning: induction. We discuss inductive mechanisms, drawing attention to the foundation of generalisation success and its limitations. The distinction between base-learning and meta-learning approaches is pointed out in order to better identify the peculiar attributes of current learning strategies. We examine the po...
متن کاملSequential Inductive Learning
In this paper I advocate a new model for inductive learning. Called sequential induction, this model bridges classical fixed-sample learning techniques (which are efficient but ad hoc), and worst-case approaches (which provide strong statistical guarantees but are too inefficient for practical use). According to the sequential inductive model, learning is a sequence of decisions which are infor...
متن کاملInductive Learning with BCT
BCT (Binary Classification Tree) is a system that learns from examples and represents learned concepts as a binary polythetic decision tree. Polythetic trees differ from monothetic decision trees in that a logical combination of multiple (versus a single) attribute values may label each tree arc. Statistical evaluations are used to recursively partition the concept space in two and expand the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Journal of Riga Technical University. Computer Sciences
سال: 2010
ISSN: 1407-7493
DOI: 10.2478/v10143-010-0031-9