Sciweavers

75 search results - page 3 / 15
» A Sliding Window Algorithm for Relational Frequent Patterns ...
Sort
View
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
13 years 11 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
JIIS
2008
133views more  JIIS 2008»
13 years 5 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
ICMCS
2006
IEEE
137views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Online Mining of Recent Music Query Streams
Mining multimedia data is one of the most important issues in data mining. In this paper, we propose an online one-pass algorithm to mine the set of frequent temporal patterns in ...
Hua-Fu Li, Chin-Chuan Ho, Man-Kwan Shan, Suh-Yin L...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 5 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»
13 years 5 months 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,...