Recovering DTW distance between noise superposed NHPP

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unmarked event data is increasingly popular in temporal modeling, containing only the timestamp of each event occurrence without specifying the class or description of the events. A sequence of event is usually modeled as the realization from a latent intensity series. When the intensity varies, the events follow the Non-Homogeneous Poisson Process (NHPP). To analyze a sequence of such kind of events, an important task is to measure the similarity between two sequences based on their intensities. To avoid the difficulties of estimating the latent intensities, we measure the similarity using timestamps by Dynamic Time Warping (DTW), which can also resolve the issue that observations between two sequences are not aligned in time. Furthermore, real event data always has superposed noise, e.g. when comparing the purchase behaviour of two customers, we can be mislead if one customer visits market more often because of some occasional shopping events. We shall recover the DTW distance between two noise-superposed NHPP sequences to evaluate the similarity between them. We proposed two strategies, which are removing noise events on all possibilities before calculating the DTW distance, and integrating the noise removal into the DTW calculation in dynamic programming. We compare empirical performance of all the methods and quantitatively show that the proposed methods can recover the DTW distance effectively and efficiently.

Cite

CITATION STYLE

APA

Chang, Y., Li, Z., Zhang, B., Luo, L., Sowmya, A., Wang, Y., & Chen, F. (2019). Recovering DTW distance between noise superposed NHPP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11440 LNAI, pp. 229–241). Springer Verlag. https://doi.org/10.1007/978-3-030-16145-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free