Volume 36, Issue 5 e12448
ORIGINAL ARTICLE

Extended vertical lists for temporal pattern mining from multivariate time series

Anton Kocheturov

Corresponding Author

Anton Kocheturov

Center for Applied Optimization, Industrial and Systems Engineering, University of Florida, Gainesville, Florida

Present Address: Anton Kocheturov, Corporate Technology, Siemens Corporation Princeton, NJ, USA.

Petar Momcilov, Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas

Correspondence

Anton Kocheturov, Corporate Technology, Siemens Corporation, Princeton, NJ, USA.

Email: [email protected]

Search for more papers by this author
Petar Momcilovic

Petar Momcilovic

Industrial and Systems Engineering, University of Florida, Gainesville, Florida

Present Address: Anton Kocheturov, Corporate Technology, Siemens Corporation Princeton, NJ, USA.

Petar Momcilov, Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas

Search for more papers by this author
Azra Bihorac

Azra Bihorac

Division of Nephrology, Hypertension, and Renal Transplantation, University of Florida, Gainesville, Florida

Search for more papers by this author
Panos M. Pardalos

Panos M. Pardalos

Center for Applied Optimization, Industrial and Systems Engineering, University of Florida, Gainesville, Florida

Search for more papers by this author
First published: 09 September 2019
Citations: 6

Abstract

In this paper, the problem of mining complex temporal patterns in the context of multivariate time series is considered. A new method called the Fast Temporal Pattern Mining with Extended Vertical Lists is introduced. The method is based on an extension of the level-wise property, which requires a more complex pattern to start at positions within a record where all of the subpatterns of the pattern start. The approach is built around a novel data structure called the Extended Vertical List that tracks positions of the first state of the pattern inside records and links them to appropriate positions of a specific subpattern of the pattern called the prefix. Extensive computational results indicate that the new method performs significantly faster than the previous version of the algorithm for Temporal Pattern Mining; however, the increase in speed comes at the expense of increased memory usage.

CONFLICT OF INTEREST

The authors declare no potential conflict of interests.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.