An adaptive algorithm for finding frequent sets in landmark windows

Dang, Xuan Hong, Ong, Kok-Leong and Lee, Vincent 2012, An adaptive algorithm for finding frequent sets in landmark windows, in Scalable uncertainty management, Springer Berlin Heidelberg, Berlin, Germany, pp.590-597.

Attached Files
Name Description MIMEType Size Downloads

Title An adaptive algorithm for finding frequent sets in landmark windows
Author(s) Dang, Xuan Hong
Ong, Kok-Leong
Lee, Vincent
Title of book Scalable uncertainty management
Editor(s) Hüllermeier, Eyke
Link, Sebastian
Fober, Thomas
Seeger, Bernhard
Publication date 2012
Series Lecture notes in artificial intelligence; vol. 7520
Chapter number 47
Total chapters 54
Start page 590
End page 597
Total pages 8
Publisher Springer Berlin Heidelberg
Place of Publication Berlin, Germany
Summary We consider a CPU constrained environment for finding approximation of frequent sets in data streams using the landmark window. Our algorithm can detect overload situations, i.e., breaching the CPU capacity, and sheds data in the stream to “keep up”. This is done within a controlled error threshold by exploiting the Chernoff-bound. Empirical evaluation of the algorithm confirms the feasibility.
Notes 6th International Conference, SUM 2012 Marburg, Germany, September 17-19, 2012 Proceedings
ISBN 3642333613
9783642333613
ISSN 0302-9743
1611-3349
Language eng
Field of Research 080109 Pattern Recognition and Data Mining
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category B1 Book chapter
Persistent URL http://hdl.handle.net/10536/DRO/DU:30049541

Document type: Book Chapter
Collections: School of Information Technology
Open Access Checking
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 50 Abstract Views, 4 File Downloads  -  Detailed Statistics
Created: Thu, 29 Nov 2012, 07:55:50 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.