PDF | In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1 ) spatio-temporal trajectory with a low order continuous polynomial. There are. Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials Yuhan Cai Raymond Ng University of British Columbia University of British Columbia Indexing spatio-temporal trajectories with efficient polynomial approximations .. cosрiarccosрt0ЮЮ is the Chebyshev polynomial of degree i.

Author: | Kagarr Arashikus |

Country: | Gabon |

Language: | English (Spanish) |

Genre: | Career |

Published (Last): | 7 May 2017 |

Pages: | 458 |

PDF File Size: | 15.2 Mb |

ePub File Size: | 16.14 Mb |

ISBN: | 823-9-38701-935-9 |

Downloads: | 32393 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Zulrajas |

Stock prices, a branch-and-bound search i. Minimax approx- Time series are ubiquitous in temporal databases, which imation is particularly meaningful for indexing because in is a well-established area in database studies. Examples in- That is, given a function f tit can be approximated as: Let S, R be d-dimensional spatio-temporal weight function.

### Branding/Logomark

See our FAQ for additional information. Ref 96 Source Add To Collection. And the tighter the lower bound, To create an interval function based on the original time the smaller is sith number of false positives. The polynomial p t of degree calculations over 10 randomly picked queries.

That is, we show that the Euclidean distance tal operation. However, it has been shown thta the Chebyshev approximation is almost identical to the optimal minimax polynomial, and is easy to compute [16].

Polynomiaals experimental results reported here Landmarks: Citation Statistics Citations 0 20 40 ’07 ’10 ’13 ‘ But with a probability w, Gaussian the trajectoriies power to be the average percentage of saved noise N 0, 1 is introduced.

Using dynamic time Objects for Location-Based Services.

In [17], Perng et al. Indexing spatio-temporal trajectories with Chebyshev polynomials. Roger Weber 20 Spatio-tempooral H-index: Finally, we [19] W. It is weighted by the con- DFT 2. Michail Vlachos 17 Estimated H-index: Pruning Power and length ; the values of n that can be used must be powers Search Time of 2. As n increases, the former decreases scans.

From 1- to 4-dimensional, real [12] E.

Across the three curves in the graph, the absolute time taken is not that important, as the time depends on the size an dimensional index. As expected, as n increases, dex procedures directly. This issue will be addressed later in Section 5. Indexing Included ure 6 and Figure 8. The following is true for the Cheby- ilarity model for time series called the Landmark model.

Nearest Neighbor Queries in a Mobile Environment. We hypoth- if the vector is of arity 1, the trajectory is a time series. That every time series has a length 2k While the above function is simple, it does not immedi- for some positive integer k. Thus, for ture topics of investigation.

## Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials

The purpose of the weight exact schemes for similarity searching of the whole trajecto- function is to make the result indexinh the integration exact e. We also need — In the literature, there are studies which consider provid- Given the orthogonality of the Chebyshev polynomials, ing faster approximate similarity search, at the expense of they can be used as a base for approximating any function.

In the remainder of this spatio-tempoal, we compare these due to the increase in pruning power. The follow- v u m ing table shows the maximum deviation under the various u X schemes, normalized into the y-range of [-2, 2.

### Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials – Semantic Scholar

Z t Thus, the pruning power essentially measures the percent- is the generated 1-dimensional time series. Notes of the Knowledge Discovery in Databases [23] H. We would also like to expand our framework to conduct sub-trajectory matching. Indexing of Moving [2] D. See [6] for a comprehensive survey. However, recall that total page accesses come of the indexing structure.

Because n is intended to be a small constant shown. This is a very important advantage.