Combining clustering with moving sequential pattern mining: A novel and efficient technique

N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sequential pattern mining is a well-studied problem. In the context of mobile computing, moving sequential patterns that reflects the moving behavior of mobile users attracted researchers’ interests recently. In this paper a novel and efficient technique is proposed to mine moving sequential patterns. Firstly the idea of clustering is introduced to process the original moving histories into moving sequences as a preprocessing step. Then an efficient algorithm called PrefixTree is presented to mine the moving sequences. Performance study shows that PrefixTree outperforms LM algorithm, which is revised to mine moving sequences, in mining large moving sequence databases.

Cite

CITATION STYLE

APA

Ma, S., Tang, S., Yang, D., Wang, T., & Han, J. (2004). Combining clustering with moving sequential pattern mining: A novel and efficient technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3056, pp. 419–423). Springer Verlag. https://doi.org/10.1007/978-3-540-24775-3_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free