|
Title
|
|
|
|
ClaSP : an efficient algorithm for mining frequent closed sequences
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In this paper, we propose a new algorithm, called ClaSP for mining frequent closed sequential patterns in temporal transaction data. Our algorithm uses several efficient search space pruning methods together with a vertical database layout. Experiments on both synthetic and real datasets show that ClaSP outperforms currently well known state of the art methods, such as CloSpan. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
|
|
|
Publication
|
|
|
|
Berlin
:
2013
|
|
|
ISSN
|
|
|
|
0302-9743
[print]
1611-3349
[online]
|
|
|
DOI
|
|
|
|
10.1007/978-3-642-37453-1_5
|
|
|
Volume/pages
|
|
|
|
7818
(2013)
, p. 50-61
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|