2018
DOI: 10.1016/j.patcog.2017.11.009
|View full text |Cite
|
Sign up to set email alerts
|

Accumulating regional density dissimilarity for concept drift detection in data streams

Abstract: In a non-stationary environment, newly received data may have different knowledge patterns to the data used to train learning models. As time passes, the performance of learning models becomes increasingly unreliable. This problem is known as concept drift and is a common issue in real-world domains. Concept drift detection has attracted increasing attention in recent years, however, hardly any existing methods pay attention to small regional drifts, and their drift detection accuracy may vary due to different… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
42
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 99 publications
(42 citation statements)
references
References 50 publications
0
42
0
Order By: Relevance
“…NN-DVI: This method proposed by the authors of [21] uses a regional-density estimation as a drift detection method, named nearest neighbour-based density variation identification (NN-DVI). This method consists of three components: (i) k-nearest neighbour-based space-partitioning schema (NNPS), which transforms unmeasurable discrete data instances into a set of shared subspaces for density estimation; (ii) the density discrepancies are accumulated by a distance function in these subspaces and quantifies the overall differences; (iii) the statistical test defines the confidence interval to detect drift.…”
Section: Existing Concept Drift Detection Methodsmentioning
confidence: 99%
“…NN-DVI: This method proposed by the authors of [21] uses a regional-density estimation as a drift detection method, named nearest neighbour-based density variation identification (NN-DVI). This method consists of three components: (i) k-nearest neighbour-based space-partitioning schema (NNPS), which transforms unmeasurable discrete data instances into a set of shared subspaces for density estimation; (ii) the density discrepancies are accumulated by a distance function in these subspaces and quantifies the overall differences; (iii) the statistical test defines the confidence interval to detect drift.…”
Section: Existing Concept Drift Detection Methodsmentioning
confidence: 99%
“…The 0 − 1 encoding scheme can applied to obtain multi-output target matrix C ∈ ℜ T ×m where m is the number of target. This issue limits the feasibility of cross-validation or direct train-test partition methods as an evaluation protocol because those methods assume that the overall data batches are fully observable and risks on loss of data temporal order [14,13].…”
Section: Problem Formulationmentioning
confidence: 99%
“…The whole concept drift detection process has evolved over time by making such choices and enhancing the process incrementally. Researchers have proposed many concept drift detection methods [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] in recent times, which have handled this problem in different ways for different situations.…”
Section: Concept Drift Detectionmentioning
confidence: 99%