AN ONLINE FREQUENCY RATE BASED ALGORITHM FOR MINING FREQUENT SEQUENCES IN EVOLVING DATA STREAMS

Mining sequential patterns for discovering frequent sequences has been widely studied as a data mining problem. A challenging research is to extend its use to data streams. A data steam is an unbounded, continuously generated sequence of data transactions. In this paper, we propose an online single-...

Full description

Saved in:
Bibliographic Details
Published inChallenges In Information Technology Management pp. 56 - 62
Main Authors BAROUNI-EBRAHIMI, M., GHORBANI, ALI A.
Format Book Chapter
LanguageEnglish
Published WORLD SCIENTIFIC 01.05.2008
Subjects
Online AccessGet full text
ISBN9789812819062
981281907X
9789812819079
9812819061
9789814470674
9814470678
DOI10.1142/9789812819079_0009

Cover

More Information
Summary:Mining sequential patterns for discovering frequent sequences has been widely studied as a data mining problem. A challenging research is to extend its use to data streams. A data steam is an unbounded, continuously generated sequence of data transactions. In this paper, we propose an online single-pass algorithm called OFSD (Online Frequent Sequence Discovery), to mine the set of all frequent sequences in a data stream whose frequency rates satisfy a minimum user defined frequency rate (fu). The algorithm significantly reduces the number of elements in the candidate set (a set of candidate sequences that should be kept for further exploration) that efficiently increases its performance in comparison with other general solutions. The simulation results show the effects of fu variation and the application defined threshold (CM) on the frequent phrase detection process.
ISBN:9789812819062
981281907X
9789812819079
9812819061
9789814470674
9814470678
DOI:10.1142/9789812819079_0009