Sequential Pattern Mining with Multiple Minimum Supports: a Tree Based Approach

• Main Authors: Yi-Chun Liao, 廖一寯
• Other Authors: Ya-Han Hu
• Format: Others
• Language: en_US
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/80254266005742387182

碩士 === 國立中正大學 === 資訊管理學系 === 99 === Frequent pattern mining is an important data-mining method for determining correlations among items/itemsets. Since the frequencies for various items are always varied, specifying a single minimum support cannot exactly discover interesting patterns. To solve this problem, Liu et al. propose an apriori-based method to include the concept of multiple minimum supports (MMS in short) on association rule mining. It allows user to specify MMS to reflect the different natures of items. Since the mining of sequential pattern may face the same problem, we extend the traditional definition of sequential patterns to include the concept of MMS in this study. For efficiently discovering sequential patterns with MMS, we develop a data structure, named PLMS-tree, to store all necessary information from database. After that, a pattern growth method, named PLMS-growth, is developed to discover all sequential patterns with MMS from PLMS-tree. Keywords: Sequential pattern, multiple minimum supports, pattern growth