An Efficient Algorithm for Instance-Based Learning on Data Streams. Beringer, J. & Hüllermeier, E. In Advances in Data Mining. Theoretical Aspects and Applications, pages 34–48, Berlin, Heidelberg, 2007. Springer. doi abstract bibtex The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields. A key problem in stream mining is to extend existing machine learning and data mining methods so as to meet the increased requirements imposed by the data stream scenario, including the ability to analyze incoming data in an online, incremental manner, to observe tight time and memory constraints, and to appropriately respond to changes of the data characteristics and underlying distributions, amongst others. This paper considers the problem of classification on data streams and develops an instance-based learning algorithm for that purpose. The experimental studies presented in the paper suggest that this algorithm has a number of desirable properties that are not, at least not as a whole, shared by currently existing alternatives. Notably, our method is very flexible and thus able to adapt to an evolving environment quickly, a point of utmost importance in the data stream context. At the same time, the algorithm is relatively robust and thus applicable to streams with different characteristics.
@inproceedings{beringer_efficient_2007,
address = {Berlin, Heidelberg},
title = {An {Efficient} {Algorithm} for {Instance}-{Based} {Learning} on {Data} {Streams}},
isbn = {978-3-540-73435-2},
doi = {10.1007/978-3-540-73435-2_4},
abstract = {The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields. A key problem in stream mining is to extend existing machine learning and data mining methods so as to meet the increased requirements imposed by the data stream scenario, including the ability to analyze incoming data in an online, incremental manner, to observe tight time and memory constraints, and to appropriately respond to changes of the data characteristics and underlying distributions, amongst others. This paper considers the problem of classification on data streams and develops an instance-based learning algorithm for that purpose. The experimental studies presented in the paper suggest that this algorithm has a number of desirable properties that are not, at least not as a whole, shared by currently existing alternatives. Notably, our method is very flexible and thus able to adapt to an evolving environment quickly, a point of utmost importance in the data stream context. At the same time, the algorithm is relatively robust and thus applicable to streams with different characteristics.},
language = {en},
booktitle = {Advances in {Data} {Mining}. {Theoretical} {Aspects} and {Applications}},
publisher = {Springer},
author = {Beringer, Jürgen and Hüllermeier, Eyke},
editor = {Perner, Petra},
year = {2007},
pages = {34--48},
}
Downloads: 0
{"_id":"RBu3BfDjsdAgqrtw5","bibbaseid":"beringer-hllermeier-anefficientalgorithmforinstancebasedlearningondatastreams-2007","author_short":["Beringer, J.","Hüllermeier, E."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"Berlin, Heidelberg","title":"An Efficient Algorithm for Instance-Based Learning on Data Streams","isbn":"978-3-540-73435-2","doi":"10.1007/978-3-540-73435-2_4","abstract":"The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields. A key problem in stream mining is to extend existing machine learning and data mining methods so as to meet the increased requirements imposed by the data stream scenario, including the ability to analyze incoming data in an online, incremental manner, to observe tight time and memory constraints, and to appropriately respond to changes of the data characteristics and underlying distributions, amongst others. This paper considers the problem of classification on data streams and develops an instance-based learning algorithm for that purpose. The experimental studies presented in the paper suggest that this algorithm has a number of desirable properties that are not, at least not as a whole, shared by currently existing alternatives. Notably, our method is very flexible and thus able to adapt to an evolving environment quickly, a point of utmost importance in the data stream context. At the same time, the algorithm is relatively robust and thus applicable to streams with different characteristics.","language":"en","booktitle":"Advances in Data Mining. Theoretical Aspects and Applications","publisher":"Springer","author":[{"propositions":[],"lastnames":["Beringer"],"firstnames":["Jürgen"],"suffixes":[]},{"propositions":[],"lastnames":["Hüllermeier"],"firstnames":["Eyke"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Perner"],"firstnames":["Petra"],"suffixes":[]}],"year":"2007","pages":"34–48","bibtex":"@inproceedings{beringer_efficient_2007,\n\taddress = {Berlin, Heidelberg},\n\ttitle = {An {Efficient} {Algorithm} for {Instance}-{Based} {Learning} on {Data} {Streams}},\n\tisbn = {978-3-540-73435-2},\n\tdoi = {10.1007/978-3-540-73435-2_4},\n\tabstract = {The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields. A key problem in stream mining is to extend existing machine learning and data mining methods so as to meet the increased requirements imposed by the data stream scenario, including the ability to analyze incoming data in an online, incremental manner, to observe tight time and memory constraints, and to appropriately respond to changes of the data characteristics and underlying distributions, amongst others. This paper considers the problem of classification on data streams and develops an instance-based learning algorithm for that purpose. The experimental studies presented in the paper suggest that this algorithm has a number of desirable properties that are not, at least not as a whole, shared by currently existing alternatives. Notably, our method is very flexible and thus able to adapt to an evolving environment quickly, a point of utmost importance in the data stream context. At the same time, the algorithm is relatively robust and thus applicable to streams with different characteristics.},\n\tlanguage = {en},\n\tbooktitle = {Advances in {Data} {Mining}. {Theoretical} {Aspects} and {Applications}},\n\tpublisher = {Springer},\n\tauthor = {Beringer, Jürgen and Hüllermeier, Eyke},\n\teditor = {Perner, Petra},\n\tyear = {2007},\n\tpages = {34--48},\n}\n\n\n\n","author_short":["Beringer, J.","Hüllermeier, E."],"editor_short":["Perner, P."],"key":"beringer_efficient_2007","id":"beringer_efficient_2007","bibbaseid":"beringer-hllermeier-anefficientalgorithmforinstancebasedlearningondatastreams-2007","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":[],"search_terms":["efficient","algorithm","instance","based","learning","data","streams","beringer","hüllermeier"],"title":"An Efficient Algorithm for Instance-Based Learning on Data Streams","year":2007}