Please use this identifier to cite or link to this item:
Title: Mining frequent 3D sequential patterns
Authors: Tan, Z.
Tung, A.K.H. 
Issue Date: 2006
Citation: Tan, Z.,Tung, A.K.H. (2006). Mining frequent 3D sequential patterns. Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM : 109-118. ScholarBank@NUS Repository.
Abstract: We propose a mining approach, MSP, to find the Maximal Sequential 3D Patterns with the constraints of minimum support and minimum confidence. Each pattern is a group of similar sequential 3D objects appearing in a given dataset. Mining sequential patterns in terms of 3D coordinates is important and meaningful in many real-life applications. MSP finds out the maximal patterns in terms of both length and frequency without loss. MSP involves three stages: generating seeds with pairwise pattern mining, vertical extension to detect all hits with a depth-first search and horizontal extension to extend the pattern length without loss of hits. Furthermore, we propose a method to automatically detect proper settings in order to adapt MSP to various datasets. The experiments on protein chains and synthetic data show MSP significantly outperforms the alternative methods. We apply MSP to protein family classification and pattern mining in spatial moving objects. The obtained patterns correctly classify the protein families on all the tested binary-class datasets. Sample patterns in protein structures and spatial moving objects are presented. © 2006 IEEE.
Source Title: Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM
ISBN: 0769525903
ISSN: 10993371
DOI: 10.1109/SSDBM.2006.34
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Nov 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.