Name
Abstract | ||
|---|---|---|
Mining sequential patterns from large databases has been recognized by many researchers as an attractive task of data mining and knowledge discovery. Previous algorithms scan the databases for many times, which is often unendurable due to the very large amount of databases. In this paper, the authors introduce an effective algorithm for mining sequential patterns from large databases. In the algorithm, the original database are not used at all for counting the support of sequences after the first pass. Rather, a tid list structure generated in the previous pass is employed for the purpose based on set intersection operations, avoiding the multiple scans of the databases. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/BF02948984 | J. Comput. Sci. Technol. |
Keywords | Field | DocType |
set opera- tion,sequential pattern,data mining,attractive task,knowledge discovery,mining sequential pattern,large amount,multiple scan,effective algorithm,previous pass,large databases,fast algorithm,previous algorithm | Intersection (set theory),Data mining,Computer science,Algorithm,Knowledge extraction,Database | Journal |
Volume | Issue | ISSN |
16 | 4 | 1000-9000 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
6 | ||