Efficiently mining long patterns from databases

DMCA

Efficiently mining long patterns from databases (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Roberto J. Bayardo

Citations:

455 - 3 self

BibTeX

@INPROCEEDINGS{Bayardo98efficientlymining,
    author = {Roberto J. Bayardo},
    title = {Efficiently mining long patterns from databases},
    booktitle = {},
    year = {1998},
    pages = {85--93}
}

OpenURL

Abstract

We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real data show that when the patterns are long, our algorithm is more efficient by an order of magnimaximal frequent itemset, Max-Miner’s output implicitly and concisely represents all frequent itemsets. Max-Miner is shown to result in two or more orders of magnitude in performance improvements over Apriori on some data-sets. On other data-sets where the patterns are not so long, the gains are more modest. In practice, Max-Miner is demonstrated to run in time that is roughly linear in the number of maximal frequent itemsets and the size of the database, irrespective of the size of the longest frequent itemset. tude or more. 1.

Keyphrases

long pattern frequent itemset magnimaximal frequent itemset database irrespective maximal frequent itemsets real data pattern length frequent itemsets previous algorithm pattern-mining algorithm performance improvement maximal pattern apriori scale max-miner output

DMCA