Relational stream mining involves learning a model on relational entities, which are enriched with information from further streams that reference them. To incorporate such information into the entities in an efficient incremental way, we propose a multi-threaded framework with a weighting function that prioritizes the entities delivered to the learner for learning and adaption to drift. We further propose a generator for drifting relational streams, and use it to show that our framework reaches substantial reduction of computation time.
%0 Book Section
%1 noKey
%A Matuszyk, Pawel
%A Spiliopoulou, Myra
%B Advances in Knowledge Discovery and Data Mining
%D 2013
%E Pei, Jian
%E Tseng, Vincent S.
%E Cao, Longbing
%E Motoda, Hiroshi
%E Xu, Guandong
%I Springer Berlin Heidelberg
%K IMPRINT kmd
%P 497-508
%R 10.1007/978-3-642-37456-2_42
%T Framework for Storing and Processing Relational Entities in Stream Mining
%U http://dx.doi.org/10.1007/978-3-642-37456-2_42
%V 7819
%X Relational stream mining involves learning a model on relational entities, which are enriched with information from further streams that reference them. To incorporate such information into the entities in an efficient incremental way, we propose a multi-threaded framework with a weighting function that prioritizes the entities delivered to the learner for learning and adaption to drift. We further propose a generator for drifting relational streams, and use it to show that our framework reaches substantial reduction of computation time.
%@ 978-3-642-37455-5
@incollection{noKey,
abstract = {Relational stream mining involves learning a model on relational entities, which are enriched with information from further streams that reference them. To incorporate such information into the entities in an efficient incremental way, we propose a multi-threaded framework with a weighting function that prioritizes the entities delivered to the learner for learning and adaption to drift. We further propose a generator for drifting relational streams, and use it to show that our framework reaches substantial reduction of computation time.},
added-at = {2014-06-20T11:59:04.000+0200},
author = {Matuszyk, Pawel and Spiliopoulou, Myra},
biburl = {https://www.bibsonomy.org/bibtex/277fcc690b4a753445645ea8b2412cb6c/kmd-ovgu},
booktitle = {Advances in Knowledge Discovery and Data Mining},
doi = {10.1007/978-3-642-37456-2_42},
editor = {Pei, Jian and Tseng, Vincent S. and Cao, Longbing and Motoda, Hiroshi and Xu, Guandong},
interhash = {b932513679018475241648ad7a50fe23},
intrahash = {77fcc690b4a753445645ea8b2412cb6c},
isbn = {978-3-642-37455-5},
keywords = {IMPRINT kmd},
language = {English},
pages = {497-508},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2014-09-04T16:48:28.000+0200},
title = {Framework for Storing and Processing Relational Entities in Stream Mining},
url = {http://dx.doi.org/10.1007/978-3-642-37456-2_42},
volume = 7819,
year = 2013
}