Efficient pattern matching of time series data
From MaRDI portal
Recommendations
- Efficient similarity search for time series data based on the minimum distance
- Efficient similarity search for multi-dimensional time sequences
- scientific article; zbMATH DE number 1786224
- Efficient indexing of interval time sequences
- Similarity search based on shape k-d tree for multidimensional time sequence
Cited in
(13)- 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
- Micro similarity queries in time series database
- Efficient similarity search for time series data based on the minimum distance
- A pattern matching method based on point distribution for multivariate time series
- Similarity search based on shape k-d tree for multidimensional time sequence
- Efficient similarity search for multi-dimensional time sequences
- An Efficient Hash-Based Algorithm for Sequence Data Searching
- An efficient similarity search for multivariate time series
- Pattern-based characterization of time series
- Efficient time-series subsequence matching using duality in constructing windows
- Feature matching in time series modeling
- Efficient indexing of interval time sequences
This page was built for publication: Efficient pattern matching of time series data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3047798)