Efficient indexing of interval time sequences
From MaRDI portal
Publication:975510
DOI10.1016/j.ipl.2008.08.003zbMath1191.68254OpenAlexW2086653440MaRDI QIDQ975510
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.08.003
Database theory (68P15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Information storage and retrieval of data (68P20)
Related Items (3)
Energy-driven image interpolation using Gaussian process regression ⋮ A bidirectional weighted boundary distance algorithm for time series similarity computation based on optimized sliding window size ⋮ Mining maximal frequent rectangles
Cites Work
- Bounded similarity querying for time-series data
- New clustering methods for interval data
- Computing the minimum Hausdorff distance between two point sets on a line under translation
- An algorithm for information structuring and retrieval
- Dimensionality reduction for fast similarity search in large time series databases
This page was built for publication: Efficient indexing of interval time sequences