Adaptive load shedding for mining frequent patterns from data streams
Dang, X., Ng, W. and Ong, Kok-Leong 2006, Adaptive load shedding for mining frequent patterns from data streams, Lecture notes in computer science, vol. 4081, pp. 342-351.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
Adaptive load shedding for mining frequent patterns from data streams
Most algorithms that focus on discovering frequent patterns from data streams assumed that the machinery is capable of managing all the incoming transactions without any delay; or without the need to drop transactions. However, this assumption is often impractical due to the inherent characteristics of data stream environments. Especially under high load conditions, there is often a shortage of system resources to process the incoming transactions. This causes unwanted latencies that in turn, affects the applicability of the data mining models produced – which often has a small window of opportunity. We propose a load shedding algorithm to address this issue. The algorithm adaptively detects overload situations and drops transactions from data streams using a probabilistic model. We tested our algorithm on both synthetic and real-life datasets to verify the feasibility of our algorithm.
Notes
Book title : "Data Warehousing and Knowledge Discovery"