352 search results - page 29 / 71 » Non-derivable itemset mining |
110
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
JCST
2008
14 years 11 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
103
click to vote
KDD
2007
ACM
16 years 7 days 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
2003
15 years 1 months ago
2003
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
104
click to vote
DAMON
2009
Springer
15 years 6 months ago
2009
Springer
We present two efficient Apriori implementations of Frequent Itemset Mining (FIM) that utilize new-generation graphics processing units (GPUs). Our implementations take advantage ...