Finding the longest common sub-pattern in sequences of temporal intervals

DOI10.1007/s10618-015-0404-3zbMath1405.68464OpenAlexW2013170360MaRDI QIDQ1715886

Orestis Kostakis, Panagiotis Papapetrou

Publication date: 29 January 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-015-0404-3

zbMATH Keywords

temporal intervalsevent-interval sequenceslongest common sub-pattern

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (1)

On searching and indexing sequences of temporal intervals

Cites Work

• Maintaining knowledge about temporal intervals
• Random sampling with a reservoir
• Actions and Events in Interval Temporal Logic
• Mining Compressing Sequential Patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding the longest common sub-pattern in sequences of temporal intervals