Mining Quantitative Temporal Dependencies Between Interval-Based Streams

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

Abstract

Data streams gathered from sensor systems can contain a significant amount of noise and are challenging to sequential pattern mining algorithms. A majority of existing approaches deals with such data as time point events to find before/after relations that induces loss of information when dealing with events lasting in time, i.e intervals. Other interval-based approaches focus on qualitative patterns and are sensitive to temporal variability. We consider that quantitative patterns maintaining lag information permit to deal better with this problem. In this work, we propose an efficient algorithm devised to extract quantitative patterns from interval streams: Interval Time Lag Discovery (ITLD). It is based on an intersection-based confidence that is automatically assessed with a statistical χ2 test. Experimental results, on both synthetic and real-life data, show that our method is more suitable for sensor interval streams and provides more precise information in comparison with existing approaches.

Cite

CITATION STYLE

APA

El Ouassouli, A., Robinault, L., & Scuturici, V. M. (2019). Mining Quantitative Temporal Dependencies Between Interval-Based Streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11708 LNCS, pp. 151–165). Springer. https://doi.org/10.1007/978-3-030-27520-4_11

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