2009
DOI: 10.1007/978-3-642-05224-8_24
|View full text |Cite
|
Sign up to set email alerts
|

Mining Multi-label Concept-Drifting Data Streams Using Dynamic Classifier Ensemble

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
49
0
1

Year Published

2009
2009
2017
2017

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(50 citation statements)
references
References 15 publications
0
49
0
1
Order By: Relevance
“…The first approach to MLC in data streams was a batch-incremental method that trains stacked BR classifiers (Qu et al 2009). Some methods for multi-class classification, such as Hoeffding Trees (HT) (Domingos and Hulten 2000), have also been adapted to the multi-label classification task (Read et al 2012).…”
Section: Multi-label Classification On Data Streamsmentioning
confidence: 99%
See 1 more Smart Citation
“…The first approach to MLC in data streams was a batch-incremental method that trains stacked BR classifiers (Qu et al 2009). Some methods for multi-class classification, such as Hoeffding Trees (HT) (Domingos and Hulten 2000), have also been adapted to the multi-label classification task (Read et al 2012).…”
Section: Multi-label Classification On Data Streamsmentioning
confidence: 99%
“…Most research into multi-label classification has been performed in the batch learning context. However, some effort has also been made to explore multi-label classification in the streaming setting (Qu et al 2009;Read et al 2012;), following the popularity of big data in the research community, as well as in industry. With an appropriate method, working in the streaming context allows for real-time analysis of large amounts of data, e.g., emails, blogs, RSS feeds, social networks, etc.…”
Section: Introductionmentioning
confidence: 99%
“…These requirements can in fact be met by variety of learning schemes, including even batch learners (e.g., [1]), where batches are constantly gathered over time, and newer models replace older ones as memory fills up. Nevertheless, incremental methods remain strongly preferred in the data streams literature, and particularly the Hoeffding tree (HT) and its variations [2,3], k-nearest neighbors (kNN) [4].…”
Section: Introductionmentioning
confidence: 99%
“…• 분류 [19,20,21,22] 스트림 데이터에 대한 실시간 의사 결정 지원 • 군집화 [23,24,25,26] 스트림 데이터의 유사성을 기반으로 실시간 그룹화 및 이상치 결정 지원 • 패턴 분석 [27,28,29] 스트림 데이터에 대한 빈발 패턴 및 이상치 결정 지원 질의 처리…”
unclassified