scispace - formally typeset
Open AccessJournal ArticleDOI

Learning in the presence of concept drift and hidden contexts

TLDR
A family of learning algorithms that flexibly react to concept drift and can take advantage of situations where contexts reappear are described, including a heuristic that constantly monitors the system's behavior.
Abstract
On-line learning in domains where the target concept depends on some hidden context poses serious problems. A changing context can induce changes in the target concepts, producing what is known as concept drift. We describe a family of learning algorithms that flexibly react to concept drift and can take advantage of situations where contexts reappear. The general approach underlying all these algorithms consists of (1) keeping only a window of currently trusted examples and hypotheses; (2) storing concept descriptions and reusing them when a previous context re-appears; and (3) controlling both of these functions by a heuristic that constantly monitors the system's behavior. The paper reports on experiments that test the systems' perfomance under various conditions such as different levels of noise and different extent and rate of concept drift.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Solving Nonstationary Classification Problems With Coupled Support Vector Machines

TL;DR: This work introduces the time-adaptive support vector machine (TA-SVM), a new method for generating adaptive classifiers, capable of learning concepts that change with time, and analyzes the regularizing effect of changing the number of classifiers in the sequence or adapting the strength of the coupling.
Journal ArticleDOI

KSAP: An approach to bug report assignment using KNN search and heterogeneous proximity

TL;DR: This is the first paper to demonstrate how to automatically build heterogeneous network of a bug repository and extract meta-paths of developer collaborations from theheterogeneous network for bug report assignment.
Proceedings Article

Continual Learning with Bayesian Neural Networks for Non-Stationary Data

TL;DR: This work addresses continual learning for non-stationary data, using Bayesian neural networks and memory-based online variational Bayes, by introducing a novel method for sequentially updating both components of the posterior approximation.
Proceedings ArticleDOI

An ensemble based incremental learning framework for concept drift and class imbalance

TL;DR: Two modified frameworks for an algorithm that can be used to incrementally learn from imbalanced data coming from a nonstationary environment are proposed.
Proceedings ArticleDOI

Tracking concept drift in malware families

TL;DR: This paper investigates the assumption that malware population is stationary i.e. probability distribution of the observed characteristics of malware populations don't change over time, and proposes two measures for tracking concept drift in malware families when feature sets are very large-relative temporal similarity and metafeatures.
References
More filters
Proceedings ArticleDOI

A theory of the learnable

TL;DR: This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Journal ArticleDOI

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.
Book

Machine Learning: An Artificial Intelligence Approach

TL;DR: This book contains tutorial overviews and research papers on contemporary trends in the area of machine learning viewed from an AI perspective, including learning from examples, modeling human learning strategies, knowledge acquisition for expert systems, learning heuristics, discovery systems, and conceptual data analysis.
Journal ArticleDOI

Learnability and the Vapnik-Chervonenkis dimension

TL;DR: This paper shows that the essential condition for distribution-free learnability is finiteness of the Vapnik-Chervonenkis dimension, a simple combinatorial parameter of the class of concepts to be learned.
Journal ArticleDOI

Queries and Concept Learning

TL;DR: This work considers the problem of using queries to learn an unknown concept, and several types of queries are described and studied: membership, equivalence, subset, superset, disjointness, and exhaustiveness queries.