Sciweavers

52 search results - page 3 / 11
» Verifying and Mining Frequent Patterns from Large Windows ov...
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 9 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 5 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
ISMIS
2009
Springer
14 years 9 days ago
Novelty Detection from Evolving Complex Data Streams with Time Windows
Abstract. Novelty detection in data stream mining denotes the identification of new or unknown situations in a stream of data elements flowing continuously in at rapid rate. This...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
WWW
2006
ACM
14 years 6 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
IDA
2008
Springer
13 years 5 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals