Sciweavers

171 search results - page 17 / 35
» Statistical Supports for Frequent Itemsets on Data Streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 2 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 2 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
ICMCS
2006
IEEE
344views Multimedia» more  ICMCS 2006»
15 years 8 months ago
Pattern Mining in Visual Concept Streams
Pattern mining algorithms are often much easier applied than quantitatively assessed. In this paper we address the pattern evaluation problem by looking at both the capability of ...
Lexing Xie, Shih-Fu Chang
TKDE
2010
151views more  TKDE 2010»
15 years 8 days ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
ICML
1996
IEEE
16 years 2 months ago
Searching for Structure in Multiple Streams of Data
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
Tim Oates, Paul R. Cohen