Tracking Context Changes through Meta-Learning
TL;DR: A general two-level learning model is presented that effectively adjusts to changing contexts by trying to detect (via ‘meta-learning’) contextual clues and using this information to focus the learning process.
read more
Abstract: The article deals with the problem of learning incrementally (‘on-line’) in domains where the target concepts are context-dependent, so that changes in context can produce more or less radical changes in the associated concepts. In particular, we concentrate on a class of learning tasks where the domain provides explicit clues as to the current context (e.g., attributes with characteristic values). A general two-level learning model is presented that effectively adjusts to changing contexts by trying to detect (via ‘meta-learning’) contextual clues and using this information to focus the learning process. Context learning and detection occur during regular on-line learning, without separate training phases for context recognition. Two operational systems based on this model are presented that differ in the underlying learning algorithm and in the way they use contextual information: METAL(B) combines meta-learning with a Bayesian classifier, while METAL(IB) is based on an instance-based learning algorithm. Experiments with synthetic domains as well as a number of ‘real-world” problems show that the algorithms are robust in a variety of dimensions, and that meta-learning can produce substantial increases in accuracy over simple object-level learning in situations with changing contexts.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey on concept drift adaptation
TL;DR: The survey covers the different facets of concept drift in an integrated way to reflect on the existing scattered state of the art and aims at providing a comprehensive introduction to the concept drift adaptation for researchers, industry analysts, and practitioners.
Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts
J. Zico Kolter,Marcus A. Maloof +1 more
TL;DR: It is concluded that *DWM* outperformed other learners that only incrementally learn concept descriptions, that maintain and use previously encountered examples, and that employ an unweighted, fixed-size ensemble of experts.
•Proceedings Article
Meta-Learning by Landmarking Various Learning Algorithms
Bernhard Pfahringer,Hilan Bensusan,Christophe Giraud-Carrier +2 more
- 29 Jun 2000
TL;DR: Experiments show that landmarking selects, with moderate but reasonable level of success, the best performing of a set of learning algorithms.
396
•Posted Content
Taking Human out of Learning Applications: A Survey on Automated Machine Learning
Quanming Yao,Mengshuo Wang,Hugo Jair Escalante,Isabelle Guyon,Yi-Qi Hu,Yu-Feng Li,Wei-Wei Tu,Qiang Yang,Yang Yu +8 more
TL;DR: An up to date survey on AutoML and proposes a general AutoML framework that not only covers most existing approaches to date but also can guide the design for new methods.
356
Introduction to the Special Issue on Meta-Learning
TL;DR: It is shown how meta-learning can be simply defined as the process of exploiting knowledge about learning that enables us to understand and improve the performance of learning algorithms.
References
Instance-Based Learning Algorithms
TL;DR: This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
•Posted Content
Estimating Continuous Distributions in Bayesian Classifiers
George H. John,Pat Langley +1 more
TL;DR: This paper abandon the normality assumption and instead use statistical methods for nonparametric density estimation for kernel estimation, which suggests that kernel estimation is a useful tool for learning Bayesian models.
3.3K
•Proceedings Article
Estimating continuous distributions in Bayesian classifiers
George H. John,Pat Langley +1 more
- 18 Aug 1995
TL;DR: In this paper, the authors use statistical methods for nonparametric density estimation for a naive Bayesian classifier, comparing two methods of density estimation: assuming normality and modeling each conditional distribution with a single Gaussian; and using non-parametric kernel density estimation.
2.7K
Related Papers (5)
W. Nick Street,Yong Seog Kim +1 more
- 26 Aug 2001
Geoff Hulten,Laurie Spencer,Pedro Domingos +2 more
- 26 Aug 2001