41 search results - page 4 / 9 » Parallel and Distributed Frequent Itemset Mining on Dynamic ... |
FIMI
2004
14 years 10 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
AUSAI
2003
Springer
15 years 2 months 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...
KDD
2007
ACM
15 years 9 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
FIMI
2004
14 years 10 months ago
2004
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
CLUSTER
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...