Instance-based learning algorithms
DW Aha, D Kibler, MK Albert - Machine learning, 1991 - Springer
Storing and using specific instances improves the performance of several supervised
learning algorithms. These include algorithms that learn decision trees, classification rules …
learning algorithms. These include algorithms that learn decision trees, classification rules …
SUSTAIN: a network model of category learning.
Abstract SUSTAIN (Supervised and Unsupervised STratified Adaptive Incremental Network)
is a model of how humans learn categories from examples. SUSTAIN initially assumes a …
is a model of how humans learn categories from examples. SUSTAIN initially assumes a …
Case‐based reasoning: an overview
RL De Mantaras, E Plaza - AI communications, 1997 - content.iospress.com
This paper contains a brief overview of Case‐Based Reasoning (CBR) with an emphasis on
European activities in the field. The main objective was to have a balance between brevity …
European activities in the field. The main objective was to have a balance between brevity …
Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms
DW Aha - International journal of man-machine studies, 1992 - Elsevier
Incremental variants of the nearest neighbor algorithm are a potentially suitable choice for
incremental learning tasks. They have fast learning rates, low updating costs, and have …
incremental learning tasks. They have fast learning rates, low updating costs, and have …
Instance‐based prediction of real‐valued attributes
D Kibler, DW Aha, MK Albert - Computational Intelligence, 1989 - Wiley Online Library
Instance‐based representations have been applied to numerous classification tasks with
some success. Most of these applications involved predicting a symbolic class based on …
some success. Most of these applications involved predicting a symbolic class based on …
The omnipresence of case-based reasoning in science and application
DW Aha - Knowledge-based systems, 1998 - Elsevier
A surprisingly large number of research disciplines have contributed towards the
development of knowledge on lazy problem solving, which is characterized by its storage of …
development of knowledge on lazy problem solving, which is characterized by its storage of …
[PDF][PDF] Case-based learning algorithms
DW Aha - Proceedings of the 1991 DARPA case-based …, 1991 - cs.auckland.ac.nz
Case-based learning CBL algorithms are CBR systems that focus on the topic of learning.
This paper notes why CBL algorithms are good choices for many supervised learning tasks …
This paper notes why CBL algorithms are good choices for many supervised learning tasks …
[BOOK][B] Handbook of fuzzy computation
E Ruspini, P Bonissone, W Pedrycz - 2020 - books.google.com
This handbook provides information about fundamental aspects of the field and explores the
myriad applications of fuzzy logic techniques and methods. It presents basic conceptual …
myriad applications of fuzzy logic techniques and methods. It presents basic conceptual …
[PDF][PDF] Noise-tolerant instance-based learning algorithms.
DW Aha, DF Kibler - IJCAI, 1989 - Citeseer
Several published reports show that instancebased learning algorithms yield high
classification accuracies and have low storage requirements during supervised learning …
classification accuracies and have low storage requirements during supervised learning …
[BOOK][B] A study of instance-based algorithms for supervised learning tasks: Mathematical, empirical, and psychological evaluations
DW Aha - 1990 - search.proquest.com
This dissertation introduces a framework for specifying instance-based algorithms that can
solve supervised learning tasks. These algorithms input a sequence of instances and yield a …
solve supervised learning tasks. These algorithms input a sequence of instances and yield a …