Efficient indexing of interval time sequences☆
References (19)
- et al.
Bounded similarity querying for time-series data
Information and Computation
(2004) Computing the minimum Hausdorff distance between two point sets on a line under translation
Information Processing Letters
(1991)- R. Agrawal, C. Faloutsos, A. Swami, Efficient similarity search in sequence databases, in: Proc. of FODO Conf.,...
- C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proc. of the ACM...
- D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proc. of ACM SIGMOD Conf., Tucson, AZ,...
- B.-K. Yi, H. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: IEEE Proc....
- et al.
Locally adaptive dimensionality reduction for indexing large time series databases
ACM Transactions on Database Systems
(2002) - B.-K. Yi, C. Faloutsos, Fast time sequence indexing for arbitrary lp norms, in: Proc. of VLDB Conf., Cairo, Egypt,...
- et al.
Dimensionality reduction for fast similarity search in large time series databases
Knowledge and Information Systems
(2001)
There are more references available in the full text version of this article.
Cited by (6)
Efficient bitmap-based indexing of time-based interval sequences
2012, Information SciencesMining maximal frequent rectangles
2022, Advances in Data Analysis and ClassificationA Bidirectional Weighted Boundary Distance Algorithm For Time Series Similarity Computation Based On Optimized Sliding Window Size
2021, Journal of Industrial and Management OptimizationA new semimetric for interval data
2019, International Journal of Recent Technology and EngineeringAn incremental algorithm for mining closed frequent intervals
2018, Advances in Intelligent Systems and ComputingEnergy-driven image interpolation using gaussian process regression
2012, Journal of Applied Mathematics
- ☆
Preliminary version appeared in Proc. of DASFAA 2004.
Copyright © 2008 Elsevier B.V. All rights reserved.