Exploration of continuous sequential patterns using the CPGrowth algorithm

Marcin Gorawski; Pawel Jureczek; Michal Gorawski

doi:10.1007/978-3-642-14989-4_16

Exploration of continuous sequential patterns using the CPGrowth algorithm

Marcin Gorawski
, Pawel Jureczek
, Michal Gorawski

Department of Applied Informatics (RAU/RAU7)

Silesian University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

8 Citations (Scopus)

Abstract

In the following paper we present the UCP-Tree and a new algorithm called CPGrowth for continuous pattern mining. The UCP-Tree is an aggregation tree that stores common subsequences of input sequences in the same nodes. The characteristic feature of the CPGrowth algorithm is that it does not require transitional trees at the next recursion levels. Moreover, new sequences can be inserted into the UPC-Tree without rebuilding, which is a considerable advantage considering that Trajectory Data Warehouses store massive amounts of data. In this paper we compared the efficiency of the proposed index with one of the fastest continuous pattern mining algorithms.

Original language	English
Title of host publication	Advances in Multimedia and Network Information System Technologies
Editors	Ngoc Thanh Nguyen, Aleksander Zgrzywa, Andrzej Czyzewski
Pages	165-172
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-642-14989-4_16
Publication status	Published - 2010

Publication series

Name	Advances in Intelligent and Soft Computing
Volume	80
ISSN (Print)	1867-5662

ASJC Scopus subject areas

General Computer Science

Access to Document

10.1007/978-3-642-14989-4_16

Cite this

@inbook{b666c1e11b0647e08ab8ae6186b4a990,

title = "Exploration of continuous sequential patterns using the CPGrowth algorithm",

abstract = "In the following paper we present the UCP-Tree and a new algorithm called CPGrowth for continuous pattern mining. The UCP-Tree is an aggregation tree that stores common subsequences of input sequences in the same nodes. The characteristic feature of the CPGrowth algorithm is that it does not require transitional trees at the next recursion levels. Moreover, new sequences can be inserted into the UPC-Tree without rebuilding, which is a considerable advantage considering that Trajectory Data Warehouses store massive amounts of data. In this paper we compared the efficiency of the proposed index with one of the fastest continuous pattern mining algorithms.",

author = "Marcin Gorawski and Pawel Jureczek and Michal Gorawski",

year = "2010",

doi = "10.1007/978-3-642-14989-4\_16",

language = "English",

isbn = "9783642149887",

series = "Advances in Intelligent and Soft Computing",

pages = "165--172",

editor = "Nguyen, \{Ngoc Thanh\} and Aleksander Zgrzywa and Andrzej Czyzewski",

booktitle = "Advances in Multimedia and Network Information System Technologies",

}

Exploration of continuous sequential patterns using the CPGrowth algorithm. / Gorawski, Marcin; Jureczek, Pawel; Gorawski, Michal.
Advances in Multimedia and Network Information System Technologies. ed. / Ngoc Thanh Nguyen; Aleksander Zgrzywa; Andrzej Czyzewski. 2010. p. 165-172 (Advances in Intelligent and Soft Computing; Vol. 80).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Exploration of continuous sequential patterns using the CPGrowth algorithm

AU - Gorawski, Marcin

AU - Jureczek, Pawel

AU - Gorawski, Michal

PY - 2010

Y1 - 2010

N2 - In the following paper we present the UCP-Tree and a new algorithm called CPGrowth for continuous pattern mining. The UCP-Tree is an aggregation tree that stores common subsequences of input sequences in the same nodes. The characteristic feature of the CPGrowth algorithm is that it does not require transitional trees at the next recursion levels. Moreover, new sequences can be inserted into the UPC-Tree without rebuilding, which is a considerable advantage considering that Trajectory Data Warehouses store massive amounts of data. In this paper we compared the efficiency of the proposed index with one of the fastest continuous pattern mining algorithms.

AB - In the following paper we present the UCP-Tree and a new algorithm called CPGrowth for continuous pattern mining. The UCP-Tree is an aggregation tree that stores common subsequences of input sequences in the same nodes. The characteristic feature of the CPGrowth algorithm is that it does not require transitional trees at the next recursion levels. Moreover, new sequences can be inserted into the UPC-Tree without rebuilding, which is a considerable advantage considering that Trajectory Data Warehouses store massive amounts of data. In this paper we compared the efficiency of the proposed index with one of the fastest continuous pattern mining algorithms.

UR - https://www.scopus.com/pages/publications/80052935127

U2 - 10.1007/978-3-642-14989-4_16

DO - 10.1007/978-3-642-14989-4_16

M3 - Chapter

AN - SCOPUS:80052935127

SN - 9783642149887

T3 - Advances in Intelligent and Soft Computing

SP - 165

EP - 172

BT - Advances in Multimedia and Network Information System Technologies

A2 - Nguyen, Ngoc Thanh

A2 - Zgrzywa, Aleksander

A2 - Czyzewski, Andrzej

ER -

Exploration of continuous sequential patterns using the CPGrowth algorithm

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this