Sciweavers

143 search results - page 3 / 29
» Duplicate-Insensitive Order Statistics Computation over Data...
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Resource-aware kernel density estimators over streaming data
A fundamental building block of many data mining and analysis approaches is density estimation as it provides a comprehensive statistical model of a data distribution. For that re...
Christoph Heinz, Bernhard Seeger
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
13 years 7 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
ICDCSW
2007
IEEE
14 years 1 months ago
Event Stream Processing with Out-of-Order Data Arrival
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
Ming Li, Mo Liu, Luping Ding, Elke A. Rundensteine...
ADC
2008
Springer
156views Database» more  ADC 2008»
14 years 1 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
DC
2008
13 years 7 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch