This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in ISI Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via ISI Web of Science (2) Citing Articles via Google Scholar Google Scholar Articles by Chang, J. H. Articles by Lee, W. S. Search for Related Content Social Bookmarking                   What's this?

Efficient mining method for retrieving sequential patterns over online data streams

Yonsei University, 134 Shinchon-dong Seodaemun-gu Seoul, 120-749, Korea, jhchang{at}amadeus.yonsei.ac.kr

Won Suk Lee

Yonsei University, 134 Shinchon-dong Seodaemun-gu Seoul, 120-749, Korea

With the usefulness of data mining in various fields of information science, various mining methods have been proposed in previous research. Recently, in these fields, data has taken the form of continuous data streams rather than finite stored data sets. In this paper, a mining method of sequential patterns over an online sequence data stream is proposed, which is useful for retrieving embedded knowledge in the data stream. The proposed method can minimize memory usage of the mining process while an error is allowed in its mining result, and supports flexible trade-off between memory usage and mining accuracy. However, the error is minimized by an accurate estimation method for the count of a sequence, which considers the ordering information of items. The proposed method can catch a recent change in a sequence data stream in a short time, by a decaying mechanism gracefully discarding old information that may be no longer useful.

Key Words: sequential pattern • data stream • embedded knowledge • significant sequence • information retrieval

CiteULike    Connotea    Del.icio.us    Digg    Reddit    Technorati    What's this?