Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency
DOI10.1007/S10618-021-00736-WzbMATH Open1473.68068OpenAlexW3131184050WikidataQ125185068 ScholiaQ125185068MaRDI QIDQ2036734FDOQ2036734
Mykola Pechenizkiy, Ben Halstead, Yun Sing Koh, Albert Bifet, Patricia J. Riddle, Russel Pears
Publication date: 30 June 2021
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-021-00736-w
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Information storage and retrieval of data (68P20) Online algorithms; streaming algorithms (68W27)
Cites Work
- The Measurement of Observer Agreement for Categorical Data
- A survey on concept drift adaptation
- Optimal Resource Augmentations for Online Knapsack
- Evaluation methods and decision theory for classification of streaming data with temporal dependence
- Advances in Artificial Intelligence – SBIA 2004
- Combining block-based and online methods in learning ensembles from concept drifting data streams
- Extracting hidden context
- Characterizing concept drift
Uses Software
This page was built for publication: Recurring concept memory management in data streams: exploiting data stream concept evolution to improve performance and transparency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036734)