Share Email Print
cover

Proceedings Paper

SPMBR: a scalable algorithm for mining sequential patterns based on bitmaps
Author(s): Xiwei Xu; Changhai Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Now some sequential patterns mining algorithms generate too many candidate sequences, and increase the processing cost of support counting. Therefore, we present an effective and scalable algorithm called SPMBR (Sequential Patterns Mining based on Bitmap Representation) to solve the problem of mining the sequential patterns for large databases. Our method differs from previous related works of mining sequential patterns. The main difference is that the database of sequential patterns is represented by bitmaps, and a simplified bitmap structure is presented firstly. In this paper, First the algorithm generate candidate sequences by SE(Sequence Extension) and IE(Item Extension), and then obtain all frequent sequences by comparing the original bitmap and the extended item bitmap .This method could simplify the problem of mining the sequential patterns and avoid the high processing cost of support counting. Both theories and experiments indicate that the performance of SPMBR is predominant for large transaction databases, the required memory size for storing temporal data is much less during mining process, and all sequential patterns can be mined with feasibility.

Paper Details

Date Published: 24 December 2013
PDF: 5 pages
Proc. SPIE 9067, Sixth International Conference on Machine Vision (ICMV 2013), 90672I (24 December 2013); doi: 10.1117/12.2053128
Show Author Affiliations
Xiwei Xu, Weifang Vocational College (China)
Changhai Zhang, Weifang Vocational College (China)


Published in SPIE Proceedings Vol. 9067:
Sixth International Conference on Machine Vision (ICMV 2013)
Branislav Vuksanovic; Antanas Verikas; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top