Harnessing the Strengths of Anytime Algorithms for Constant Data Streams
Anytime algorithms have been proposed for many different applications e.g. in data mining. Their strengths are the ability to first provide a result after a very short initialization and second to improve their result with additional time. Therefore, anytime algorithms have so far been used when the available processing time varies, e.g. on varying data streams. In this paper we propose to employ anytime algorithms on constant data streams, i.e. for tasks with constant time allowance. We introduce two approaches that harness the strengths of anytime algorithms on constant data streams and thereby improve the over all quality of the result with respect to the corresponding budget algorithm. We derive formulas for the expected performance gain and demonstrate the effectiveness of our novel approaches using existing anytime algorithms on benchmark data sets.
|Authors:||Kranen P., Seidl T.|
|Published in:||Data Mining and Knowledge Discovery Journal (Springer DMKD), Special Issue on Selected Papers from ECML PKDD 2009, Vol. 19, No. 2,|
|Publisher:||Springer - Netherlands|
|Url:||DMKD Journal - full text|
|Type:||Journal Articles (peer reviewed)|
|Research topic:||Data Analysis and Knowledge Extraction|