Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient Matrix Profile Computation Using Different Distance Functions

Reza Akbarinia 1, 2 Bertrand Cloez 3
2 ZENITH - Scientific Data Management
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Matrix profile has been recently proposed as a promising technique to the problem of all-pairs-similarity search on time series. Efficient algorithms have been proposed for computing it, e.g., STAMP [13], STOMP [15] and SCRIMP++ [10]. All these algorithms use the z-normalized Euclidean distance to measure the distance between subsequences. However, as we observed, for some datasets other Euclidean measurements are more useful for knowledge discovery from time series. In this paper, we propose efficient algorithms for computing matrix profile for a general class of Euclidean distances. We first propose a simple but efficient algorithm called AAMP for computing matrix profile with the "pure" (non-normalized) Euclidean distance. Then, we extend our algorithm for the p- norm distance. We also propose an algorithm, called ACAMP, that uses the same principle as AAMP, but for the case of z-normalized Euclidean distance. We implemented our algorithms, and evaluated their performance through experimentation. The experiments show excellent performance results. For example, they show that AAMP is very efficient for com- putting matrix profile for non-normalized Euclidean distances. The results also show that the ACAMP algorithm is significantly faster than SCRIMP++ (the state of the art matrix profile algorithm) for the case of z-normalized Euclidean distance.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Migration Prodinra Connect in order to contact the contributor
Submitted on : Friday, June 5, 2020 - 3:34:09 AM
Last modification on : Wednesday, November 3, 2021 - 7:44:46 AM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License


  • HAL Id : hal-02788459, version 1
  • PRODINRA : 495329


Reza Akbarinia, Bertrand Cloez. Efficient Matrix Profile Computation Using Different Distance Functions. 2020. ⟨hal-02788459⟩



Les métriques sont temporairement indisponibles