Sciweavers

162 search results - page 1 / 33
» Parallel frequent set counting
Sort
View
PC
2002
160views Management» more  PC 2002»
13 years 4 months ago
Parallel frequent set counting
David B. Skillicorn
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
13 years 11 months ago
CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
Sudipto Das, Shyam Antony, Divyakant Agrawal, Amr ...
IDA
2011
Springer
12 years 11 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
13 years 10 months ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
INAP
2001
Springer
13 years 9 months ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson