| Alternate document: Details On Efficient Runtime Support for Multiblock and Multigrid Applications: Regular Section Analysis (93) Gagan Agrawal, Alan Sussman |
(Enter summary)
Abstract: . We propose an indexing
method for time sequences for processing
similarity queries. We use the Discrete
Fourier Transform (DFT) to map time sequences
to the frequency domain, the crucial
observation being that, for most sequences
of practical interest, only the first
few frequencies are strong. Another important
observation is Parseval's theorem,
which specifies that the Fourier transform
preserves the Euclidean distance in
the time or frequency domain. Having
thus mapped sequences to a... (Update)
Cited by: More
Association-Based Similarity Testing and Its Applications - Tao Li Department
(Correct)
Similarity Range Queries in Streaming Time Series - Maria Kontaki And
(Correct)
Musical Retrieval In P2p Networks Under The - Warping Distance Ioannis
(Correct)
Active bibliography (related documents): More All
0.4: Efficient Similarity Search In Sequence Databases - Agrawal (1993)
(Correct)
0.1: Fast Subsequence Matching in Time-Series Databases - Faloutsos, Ranganathan.. (1994)
(Correct)
0.1: Efficient and Effective Querying by Image Content - Faloutsos, Equitz.. (1994)
(Correct)
Similar documents based on text: More All
0.4: A Survey of Recent Methods for Efficient Retrieval of Similar.. - Hetland (2001)
(Correct)
0.1: Watermarking Relational Databases - Rakesh Agrawal Jerry (2002)
(Correct)
0.1: Quantifiable Data Mining Using Ratio Rules - Korn, Labrinidis, Kotidis..
(Correct)
Related documents from co-citation: More All
47: Fast subsequence matching in time-series databases
- Faloutsos, Ranganathan et al. - 1994
30: Fast similarity search in the presence of noise (context) - Agrawal, Lin et al. - 1995
25: tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990
BibTeX entry: (Update)
R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. of the Fourth Int'l Conference on Foundations of Data Organization and Algorithms, Chicago, October 1993. Also in Lecture Notes in Computer Science 730, Springer Verlag, 1993, 69--84. http://citeseer.ist.psu.edu/agrawal93efficient.html More
@inproceedings{ agrawal93efficient,
author = "Rakesh Agrawal and Christos Faloutsos and Arun N. Swami",
title = "{Efficient Similarity Search In Sequence Databases}",
booktitle = "Proceedings of the 4th International Conference of Foundations of Data Organization and Algorithms ({FODO})",
publisher = "Springer Verlag",
address = "Chicago, Illinois",
editor = "D. Lomet",
pages = "69--84",
year = "1993",
url = "citeseer.ist.psu.edu/agrawal93efficient.html" }
Citations (may not include all citations):
921
Mining Association Rules between Sets of Items in Large Data..
- Agrawal, Imielinski et al. - 1993 ACM DBLP
897
Introduction to Statistical Pattern Recognition (context) - Fukunaga - 1990
666
The Design and Analysis of Spatial Data Structures (context) - Samet - 1989 ACM
508
Fractal Geometry of Nature (context) - Mandelbrot - 1977
485
The JPEG Still Picture Compression Standard (context) - Wallace - 1991 ACM DBLP
346
Applied Optimal Estimation (context) - Gelb - 1986
257
Voronoi Diagrams - A Survey of a Fundamental Geometric Data .. (context) - Aurenhammer - 1991 DBLP
230
A Survey of Image Registration Techniques
- Brown - 1992 ACM DBLP
219
Digital Signal Processing (context) - Oppenheim, Schafer - 1975 ACM DBLP
205
Efficient Similarity Search In Sequence Databases
- Agrawal, Faloutsos et al. - 1993 ACM DBLP
200
R-trees: a dynamic index structure for spatial searching (context) - Guttman - 1984 ACM DBLP
100
Database Mining: A Performance Perspective
- Agrawal, Imielinski et al. DBLP
96
der, and B. Seeger, "The R*-tree: an efficient and robust ac.. (context) - Beckmann, Kriegel et al. - 1990
95
An Interval Classifier for Database Mining Applications
- Agrawal, Ghosh et al. - 1992 ACM DBLP
94
A retrieval technique for similar shapes (context) - Jagadish - 1991 ACM DBLP
88
The Hb-Tree: a Multiattribute Indexing Method with Good Guar.. (context) - Lomet, Salzberg - 1990 ACM DBLP
84
The grid file: an adaptable, symmetric multikey file structu.. (context) - Nievergelt, Hinterberger et al. - 1984 ACM DBLP
53
The Analysis of Time Series: an Introduction (context) - Chatfield - 1984
45
Power Laws: Minutes From an Infinite Paradise (context) - Schroeder, Chaos - 1991
41
VAGUE: A User Interface to Relational Databases that Permits.. (context) - Motro - 1988 ACM DBLP
35
New techniques for best-match retrieval (context) - Shasha, Wang - 1990 ACM DBLP
34
Spatial search with polyhedra (context) - Jagadish - 1990 ACM DBLP
30
Operations on images using quad trees (context) - Hunter, Steiglitz - 1979
23
Technical Analysis of Stock Trends (context) - Edwards, Magee - 1966
21
A Bibliography on Temporal Databases (context) - Stam, Snodgrass - 1988 DBLP
14
Approximate Matching with High Dimensionality R-trees (context) - Otterman - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sal.cs.uiuc.edu/~sharad/cs491/readinglist.html): More
Hilbert R-tree: An improved R-tree using fractals - Kamel, Faloutsos (1994)
(Correct)
FastMap: A Fast Algorithm for Indexing, Data-Mining and.. - Faloutsos, Lin (1995)
(Correct)
Fast Subsequence Matching in Time-Series Databases - Faloutsos, Ranganathan.. (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC