162 search results - page 5 / 33 » Parallel frequent set counting |
WISE
2002
Springer
14 years 15 days ago
2002
Springer
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
AUSAI
2003
Springer
14 years 25 days ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
FIMI
2004
13 years 9 months ago
2004
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...