Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SIGMOD
1998
ACM

favoriteEmaildiscussreport

93views Database» more SIGMOD 1998»

Efficiently Mining Long Patterns from Databases

13 years 8 months ago

Efficiently Mining Long Patterns from Databases

Download www.bayardo.org

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.

Roberto J. Bayardo Jr.

Real-time Traffic

Database | Longest Pattern | Longest Pattern Length | Maximal Patterns | SIGMOD 1998 |

claim paper

Related Content

» Efficient Mining of Partial Periodic Patterns in Time Series Database

» Sequential Pattern Mining in MultiDatabases via Multiple Alignment

» An Efficient Algorithm for Mining Coherent Patterns from Heterogeneous Microarrays

» Sequential PAttern mining using a bitmap representation

» The long and the short of it summarising event sequences with serial episodes

» Mining Dense Periodic Patterns in Time Series Data

» ShrFPTree An Efficient Tree Structure for Mining ShareFrequent Patterns

» CTITL Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Grow...

» Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	SIGMOD
Authors	Roberto J. Bayardo Jr.

Comments (0)