Mining sequential patterns from multidimensional sequence data

Chung Ching Yu, Yen Liang Chen

研究成果: 雜誌貢獻期刊論文同行評審

78 引文 斯高帕斯(Scopus)


The problem addressed in this paper is to discover the frequently occurred sequential patterns from databases. Although much work has been devoted to this subject, to the best of our knowledge, no previous research was able to find sequential patterns from d-dimensional sequence data, where d > 2. Without such a capability, many practical data would be impossible to mine. For example, an online stock-trading site may have a customer database, where each customer may visit a Web site in a series of days; each day takes a series of sessions and each session visits a series of Web pages. Then, the data for each customer forms a 3-dimensional list, where the first dimension is days, the second is sessions, and the third is visited pages. To mine sequential patterns from this kind of sequence data, two efficient algorithms have been developed in this paper.

頁(從 - 到)136-140
期刊IEEE Transactions on Knowledge and Data Engineering
出版狀態已出版 - 1月 2005


深入研究「Mining sequential patterns from multidimensional sequence data」主題。共同形成了獨特的指紋。