Efficient indexing of interval time sequences
From MaRDI portal
Recommendations
Cites work
- An algorithm for information structuring and retrieval
- Bounded similarity querying for time-series data
- Computing the minimum Hausdorff distance between two point sets on a line under translation
- Dimensionality reduction for fast similarity search in large time series databases
- New clustering methods for interval data
Cited in
(11)- On searching and indexing sequences of temporal intervals
- 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
- A distributed indexing method for timeline similarity query
- Using multiple indexes for efficient subsequence matching in time-series databases
- Similar sequence matching supporting variable-length and variable-tolerance continuous queries on time-series data stream
- scientific article; zbMATH DE number 1700003 (Why is no real title available?)
- scientific article; zbMATH DE number 2089862 (Why is no real title available?)
- scientific article; zbMATH DE number 1825103 (Why is no real title available?)
- scientific article; zbMATH DE number 6792413 (Why is no real title available?)
This page was built for publication: Efficient indexing of interval time sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975510)