A Signature Technique for Similarity-Based Queries (Extended Abstract) (1997)
| Venue: | In Proceedings of SEQUENCES97 |
| Citations: | 25 - 7 self |
BibTeX
@INPROCEEDINGS{Faloutsos97asignature,
author = {C. Faloutsos and H. V. Jagadish and A. O. Mendelzon and T. Milo},
title = {A Signature Technique for Similarity-Based Queries (Extended Abstract)},
booktitle = {In Proceedings of SEQUENCES97},
year = {1997},
pages = {11--13},
publisher = {IEEE Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) C. Faloutsos , H. V. Jagadish AT&T Bell Labs Murray Hill, NJ 07974 fchristos,jagg@research.att.com A. O. Mendelzon Dept. of Computer Science Univ. of Toronto mendel@db.toronto.edu T. Milo Tel Aviv Univ. milo@math.tau.ac.il 1 Introduction Sequences of real-valued data arise in many applications ranging from the stock market to electro-cardiograms. Often, it is of interest to locate sequences that are similar to a specified query sequence. The notion of similarity is application dependent, and even within a single application, may vary from one query to the next. Work in this area is usually specific to one particular domain and uses one specific notion of similarity. For example, Faloutsos et al [6, 1] studied the problem of searching a database of time sequences for sequences similar to one given. They reduced sequences to points in a low-dimensional space by using Fourier transforms and used the Euclidean distance in this space to measure similarity. Retrieval by similari...
Citations
No citations identified.
