Answers are grounded in this paper and cite their sources.
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 magnitude or more.
No takes yet. Share an insight, caveat, or question.
Roberto J. Bayardo (1998) studied this question.