Sciweavers

313 search results - page 36 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 7 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
2005
ACM
132views Data Mining» more  PAKDD 2005»
14 years 8 days ago
On Multiple Query Optimization in Data Mining
Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
Marek Wojciechowski, Maciej Zakrzewicz
JIS
2006
105views more  JIS 2006»
13 years 6 months ago
Automated support specification for efficient mining of interesting association rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules ...
Wen-Yang Lin, Ming-Cheng Tseng
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 10 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
CNSR
2007
IEEE
128views Communications» more  CNSR 2007»
14 years 1 months ago
A Novel Approach for Frequent Phrase Mining in Web Search Engine Query Streams
In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent...
M. Barouni-Ebrahimi, Ali A. Ghorbani