Mining Sequential Patterns: Generalizations and Performance Improvements

Ramakrishnan Srikant,Rakesh Agrawal

Lecture Notes in Computer Science（2005）

IBM Almaden Research Center

被引用4325|浏览35

摘要

The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified minimum support, where the support of a pattern is the number of data-sequences that contain the pattern. An example of a sequential pattern is“5

更多

查看译文

关键词

Hash Function,Association Rule,Sequential Pattern,Minimum Support,Frequent Itemsets