Reference health
Robust and fast similarity search for moving object trajectories
8 of 22 checkable references need attention · checked 2026-07-26
At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.
19 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
References needing attention
does not resolve to a known work10.5555/645415.652239
does not resolve to a known work10.5555/1316689.1316758
does not resolve to a known work10.5555/647484.726176
does not resolve to a known work10.5555/645484.656234
does not resolve to a known work10.5555/1287369.1287405
does not resolve to a known work10.5555/647815.738434
does not resolve to a known work10.5555/876875.878994
does not resolve to a known work10.5555/648060.747275
The 14 checked references that resolve
resolves10.1007/978-3-540-39984-1_25
BFT: Bit Filtration Technique for Approximate String Join in Biological Databases
resolves10.1109/69.940735
A spatio-temporal semantic model for multimedia database systems and multimedia information systems
resolves10.1109/34.862197
Classification with nonmetric distances: image retrieval and class representation
resolves10.1145/375663.375680
Locally adaptive dimensionality reduction for indexing large time series databases
resolves10.1145/253260.253332
Efficiently supporting ad hoc queries in large datasets of time sequences
resolves10.1137/1.9781611972740.2
Making Time-series Classification More Accurate Using Learned Constraints
resolves10.1145/956750.956777
Indexing multi-dimensional time-series with support for multiple distance measures
The 19 references without a DOI — listed, not checked
no DOI — not checkedA. Andoni , M. Deza , A. Gupta , P. Indyk , and S. Raskhodnikova . Lower bounds for embedding edit distance into normed spaces . In Proc. Symp. on Discrete Algorithms , 2003 . A. Andoni, M. Deza, A. Gupta, P. Indyk, and S. Raskhodnikova. Lower bounds for embedding edit distance into normed spaces. In Proc. Symp. on Discrete Algorithms, 2003.
no DOI — not checkedL. Chen Similarity-based Search Over Time Series and Trajectory Data . Ph. D. thesis , University of Waterloo , 2005 , http://db.uwaterloo.ca/~16chen/. L. Chen Similarity-based Search Over Time Series and Trajectory Data. Ph.D. thesis, University of Waterloo, 2005, http://db.uwaterloo.ca/~16chen/.
no DOI — not checkedG. Cormode and S. Muthukrishnan . The string edit distance matching problem with moves . In Proc. Symp. on Discrete Algorithms , 2002 . G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. In Proc. Symp. on Discrete Algorithms, 2002.
no DOI — not checkedL. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (Almost) for free . In Proc. VLDB 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (Almost) for free. In Proc. VLDB 2001.
no DOI — not checkedJ. Gips , M. Betke , and P. Fleming . The camera mouse: Preliminary invertigation of automated visaul tracking for computer access . In Proc. Conf. on Rehab. Eng. and Assis. Tech. Soc. of North America , 2000 . J. Gips, M. Betke, and P. Fleming. The camera mouse: Preliminary invertigation of automated visaul tracking for computer access. In Proc. Conf. on Rehab. Eng. and Assis. Tech. Soc. of North America, 2000.
no DOI — not checkedA. K. Jain and R. C. Dubes . Algorithms for Clustering Data . Prentice-Hall , 1988 . A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1988.
no DOI — not checkedP. Jokinen and E. Ukkonen . Two algorithms for approximate string matching in static texts . In Proc. Conf. of Mathematical Foundations of Computer Science , 1991 . P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. Conf. of Mathematical Foundations of Computer Science, 1991.
no DOI — not checkedK. P. Chan and A. W-C Fu . Efficient time series matching by wavelets . In Proc. ICDE , 1999 . K. P.Chan and A. W-C Fu. Efficient time series matching by wavelets. In Proc. ICDE, 1999.
no DOI — not checkedS.-L. Lee , S.-J. Chun , D.-H. Kim , J.-H. Lee , and C.-W. Chung . Similarity search for multidimensional data sequences . In Proc. ICDE , 2000 . S.-L. Lee, S.-J. Chun, D.-H. Kim, J.-H. Lee, and C.-W. Chung. Similarity search for multidimensional data sequences. In Proc. ICDE, 2000.
no DOI — not checkedV. I. Levenshtein . Binary codes capable of correcting deletions , insertions, and reversals. Cybernetics and Control Theory, 10(8) , 1966 . V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, 10(8), 1966.
no DOI — not checkedJ. L. Little and Z. Gu . Video retrieval by spatial and temporal sturcture of trajectories . In Proc. Symp. on Storage and Retrieval for Image and Video Databases , 2001 . J. L. Little and Z. Gu. Video retrieval by spatial and temporal sturcture of trajectories. In Proc. Symp. on Storage and Retrieval for Image and Video Databases, 2001.
no DOI — not checkedD. Pfoser , C. S. Jensen , and Y. Theodoridis . Novel approaches in query processing for moving object trajectories . In Proc. VLDB , 2000 . D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In Proc. VLDB, 2000.
no DOI — not checkedV. Roth , J. Laub , J. Buhmann , and K.-R. Muller . Going metric : Denoising pairwise data . In Proc. Conf. on Neural Info. Processing Systems , 2002 . V. Roth, J. Laub, J. Buhmann, and K.-R. Muller. Going metric: Denoising pairwise data. In Proc. Conf. on Neural Info. Processing Systems, 2002.
no DOI — not checkedA. Tversky . Features of similarity. Psychological Review , 84 , 1977 . A. Tversky. Features of similarity. Psychological Review, 84, 1977.
no DOI — not checkedM. Vlachos . Personal communication . 2004 . M. Vlachos. Personal communication. 2004.
no DOI — not checkedM. Vlachos , J. Lin , E. Keogh , and D. Gunopulos . A wavelet-based anytime algorithm for k-means clustering of time series . In Proc. Wksp. on Clustering High Dim. Data and its Appl. , 2003 . M. Vlachos, J. Lin, E. Keogh, and D. Gunopulos. A wavelet-based anytime algorithm for k-means clustering of time series. In Proc. Wksp. on Clustering High Dim. Data and its Appl., 2003.
no DOI — not checkedR. Weber , H.-J Schek , and S. Blott . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Proc. VLDB , 1998 . R. Weber, H.-J Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. VLDB, 1998.
no DOI — not checkedB-K Yi and C. Faloutsos . Fast time sequence indexing for arbitrary Lp norms . In Proc. VLDB , 2000 . B-K Yi and C. Faloutsos. Fast time sequence indexing for arbitrary Lp norms. In Proc. VLDB, 2000.
no DOI — not checkedB-K Yi , H. Jagadish , and C. Faloutsos . Efficient retrieval of similar time sequences under time warping . In Proc. ICDE , 1998 . B-K Yi, H. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In Proc. ICDE, 1998.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-26 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1145/1066157.1066213"><img src="https://citestamp.com/citestamped/10.1145/1066157.1066213/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1145/1066157.1066213)