Sequential patterns mining is an important data mining approach with broad applications. Traditional mining algorithms on database were not adapted to data stream. Recently, some approximate sequential pattern mining algorithms over data stream were presented which solved some problems except the one of wasting too many system resources in processing long sequences. According to observation and proof, a novel approximate sequential pattern mining algorithm is proposed named GraSeq. GraSeq uses directed weighted graph structure and stores the synopsis of sequences with only one scan of data stream; furthermore, a subsequences matching method is mentioned to reduce the cost of long sequences' processing and a conception validnode is introduced to improve the accuracy of mining results. Our experimental results demonstrate that this algorithm is effective and efficient. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Li, H., & Chen, H. (2007). GraSeq: A novel approximate mining approach of sequential patterns over data stream. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4632 LNAI, pp. 401–411). Springer Verlag. https://doi.org/10.1007/978-3-540-73871-8_37
Mendeley helps you to discover research relevant for your work.