Efficient Sequential Pattern Mining by Breadth-First Approach
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 92 === Since the GSP algorithm is proposed to mine sequential patterns in sequence databases, many methods have been proposed and mostly focused on mining the complete set of frequent patterns. The CloSpan algorithm first suggested that the closed set of sequential pat...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14108498328012924958 |