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

Balanced Efficient Lifelong Learning (B-ELLA) for Cyber Attack Detection

TL;DR: This paper outlines and proposes a new approach to cyber attack detection on the basis of the practical application of the efficient lifelong learning cybersecurity system, an extension of the Efficient Lifelong Learning (ELLA) framework.
Journal ArticleDOI

An Approach For Concept Drift Detection in a Graph Stream Using Discriminative Subgraphs

TL;DR: This work proposes a novel unsupervised concept-drift detection method on graph streams called Discriminative Subgraph-based Drift Detector (DSDD), which starts by discovering discriminative subgraphs for each graph in the stream.
Journal ArticleDOI

SCR: simulated concept recurrence – a non‐supervised tool for dealing with shifting concept

TL;DR: This article presents a semi‐supervised method and analyzes the possibilities of using the simulated concept recurrence against concept drift and also expanding the previously presented functionality of the algorithm from the sole concept characterization to both concept drift detection and concept characterization.
Journal ArticleDOI

Classification of Peer-to-Peer Traffic Using A Two-Stage Window-Based Classifier With Fast Decision Tree and IP Layer Attributes

TL;DR: This paper presents a new approach using data mining techniques, and in particular a two-stage architecture, for classification of Peer-to-Peer P2P traffic in IP networks where in the first stage the traffic is filtered using standard port numbers and layer 4 port matching to label well-known P 2P and NonP2P Traffic.
DissertationDOI

Learning Comprehensible Theories from Structured Data

Kee Siong Ng
TL;DR: This thesis is concerned with the problem of learning comprehensible theories from structured data and covers primarily classification and regression learning and the usefulness of the learning system developed is demontrated with applications in two important domains: bioinformatics and intelligent agents.
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.