Sciweavers

259 search results - page 41 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
KDID
2004
132views Database» more  KDID 2004»
15 years 1 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
16 years 6 days ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
ICDE
2000
IEEE
112views Database» more  ICDE 2000»
16 years 1 months ago
DEMON: Mining and Monitoring Evolving Data
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
PODS
2006
ACM
217views Database» more  PODS 2006»
15 years 12 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
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
15 years 24 min ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...