PrefixUnion: Mining traversal patterns efficiently in virtual environments

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Sequential pattern mining is an important data mining problem with broad applications. Especially, it is also an interesting problem in virtual environments. In this paper, we propose a projection-based, sequential pattern-growth approach, called PrefixUnion. Meanwhile, we also introduce the relationships among transactions, views and objects. According to these relationships, we suggest two mining criteria - inter-pattern growth and intra-pattern growth, which utilize these characteristics to offer ordered growth and reduced projected database. As a result, the large-scale VRML models could be accessed more efficiently, allowing for a real-time walk-through in the scene. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hung, S. S., Kuo, T. C., & Liu, D. S. M. (2005). PrefixUnion: Mining traversal patterns efficiently in virtual environments. In Lecture Notes in Computer Science (Vol. 3516, pp. 830–833). Springer Verlag. https://doi.org/10.1007/11428862_117

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