Sciweavers

22 search results - page 4 / 5
» Mining top-k frequent items in a data stream with flexible s...
Sort
View
ICMCS
2006
IEEE
137views Multimedia» more  ICMCS 2006»
13 years 10 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...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 5 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
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
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,...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 8 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo