#### DMCA

## Efficient Similarity Join of Large Sets of Moving Object Trajectories

### Cached

### Download Links

Citations: | 5 - 1 self |

### Citations

533 | Fast subsequence matching in time-series databases
- Faloutsos, Ranganathan, et al.
- 1994
(Show Context)
Citation Context ...ontract: P.O.8200082518 † Research supported by the NSF grant IIS-0325144/003 Previous research efforts on efficient similarity search in time series data sets mainly follow the GEMINI framework [9], =-=[12]-=-, [17], [24]: given a similarity measure on the time series, each trajectory is transformed into a point in a high-dimensional metric space and an index is constructed in the transformed space using t... |

350 | Exact indexing of dynamic time warping,
- Keogh, Ratanamahatana
- 2005
(Show Context)
Citation Context ...t: P.O.8200082518 † Research supported by the NSF grant IIS-0325144/003 Previous research efforts on efficient similarity search in time series data sets mainly follow the GEMINI framework [9], [12], =-=[17]-=-, [24]: given a similarity measure on the time series, each trajectory is transformed into a point in a high-dimensional metric space and an index is constructed in the transformed space using the def... |

284 | A framework for generating network-based moving objects.
- Brinkhoff
- 2002
(Show Context)
Citation Context ...k in Java. All our experiments are executed on a PC with a Pentium IV 3.0 GHz CPU and 1 GB of memory. To evaluate the efficiency of the proposed algorithms, we use the network-based traffic generator =-=[6]-=- and produce moving object trajectories based on the road networks of Oldenburg (OB) and San Francisco (SF). To obtain some quantitative observations about the potential use of ourframework for data ... |

260 | Discovering similar multidimensional trajectories, in:
- Vlachos, Kollios, et al.
- 2002
(Show Context)
Citation Context ....8200082518 † Research supported by the NSF grant IIS-0325144/003 Previous research efforts on efficient similarity search in time series data sets mainly follow the GEMINI framework [9], [12], [17], =-=[24]-=-: given a similarity measure on the time series, each trajectory is transformed into a point in a high-dimensional metric space and an index is constructed in the transformed space using the defined m... |

190 |
Computing the Fréchet distance between two polygonal curves
- Alt, Godau
- 1995
(Show Context)
Citation Context ...ide efficient and scalable similarity joins of spatio-temporal trajectories. Our main contributions can be summarized as follows: • We introduce a novel distance measure based on the Fréchet distance =-=[1]-=-, which is highly effective in identifying similar trajectories. • We propose lower and upper bounding approximations of the exact distance measure, which are straightforwardly applicable to the spati... |

155 | Robust and fast similarity search for moving object trajectories.
- Chen, Ozsu, et al.
- 2005
(Show Context)
Citation Context ...p., contract: P.O.8200082518 † Research supported by the NSF grant IIS-0325144/003 Previous research efforts on efficient similarity search in time series data sets mainly follow the GEMINI framework =-=[9]-=-, [12], [17], [24]: given a similarity measure on the time series, each trajectory is transformed into a point in a high-dimensional metric space and an index is constructed in the transformed space u... |

145 | Incremental distance join algorithms for spatial databases,”
- Hjaltason, Samet
- 1998
(Show Context)
Citation Context ... amounts of location-in-time information for moving objects. An important operation on spatio-temporal trajectories, which is fundamental to many data mining applications, is the similarity join [5], =-=[15]-=-. Given a user defined similarity measure, a similarity join identifies all pairs of objects that satisfy the join predicate in which the condition is specified by the measure. Efficient similarity jo... |

135 |
Novel approaches in query processing for moving object trajectories.
- Pfoser, Jensen, et al.
- 2000
(Show Context)
Citation Context ...it the fact that trajectories are often already indexed in their native space, in order to facilitate processing of the common spatio-temporal queries such as range, nearest neighbor, etc. [7], [18], =-=[20]-=-. Existing spatio-temporal database prototypes have limited support for trajectory similarity join. Typically, joins are implemented as nested loop joins or sorted-merge joins, which require a large a... |

101 | On the marriage of Lp-norms and edit distance.
- Chen, Ng
- 2004
(Show Context)
Citation Context ...ted using dynamic programming and has a complexity of O( w ∆Tr n2 ). However, unlike DTW and EDR, wDF is a pseudo-metric and can utilize the triangular inequality for pruning during similarity search =-=[8]-=-. More importantly, wDF has led us to the derivation of two approximation distances that provide even greater pruning power, which we discuss next. 3.1 Efficiency and Approximation of wDF For long tra... |

76 | Indexing large trajectory data sets with SETI.
- CHAKKA, EVERSPAUGH, et al.
- 2003
(Show Context)
Citation Context ...e can exploit the fact that trajectories are often already indexed in their native space, in order to facilitate processing of the common spatio-temporal queries such as range, nearest neighbor, etc. =-=[7]-=-, [18], [20]. Existing spatio-temporal database prototypes have limited support for trajectory similarity join. Typically, joins are implemented as nested loop joins or sorted-merge joins, which requi... |

51 | Computing discrete Fréchet distance
- Eiter, Mannila
- 1994
(Show Context)
Citation Context ...rete time stamps, and the location of a moving object between these points is obtained via interpolation when needed. Hence it suffices to define a discrete version of the Fréchet distance as follows =-=[11]-=-: Dog at ti (b) e Man at ti Figure 1: Illustration of Fréchet Distance dog-trajectory man-trajectory Let Tr1 = (p1 1 ,..., p1n ) and Tr2 = (p2 1 ,..., p2n ) be two trajectories. A coupling C between T... |

43 | DOMINO: Databases fOr MovINg Objects tracking.
- Wolfson, Sistla, et al.
- 1999
(Show Context)
Citation Context ... have limited support for trajectory similarity join. Typically, joins are implemented as nested loop joins or sorted-merge joins, which require a large amount of expensive distance computation [14], =-=[28]-=-. The main focus of this work is to provide efficient and scalable similarity joins of spatio-temporal trajectories. Our main contributions can be summarized as follows: • We introduce a novel distanc... |

41 |
R-Trees: Theory and Applications.
- Manolopoulos, Nanopoulos, et al.
- 2005
(Show Context)
Citation Context ...idea of early abandoning [17], [23], [27]. In this respect, we applied our wDF distance and combine similarity joins and spatio-temporal indices in the native space of moving object trajectories [7], =-=[18]-=-, [20] 7 Concluding Remarks & Future Work In this paper, we introduced a new similarity measure wDF for location-related time series data, based on Fréchet distance [1]. In order to compute the distan... |

29 | SECONDO: An extensible dbms platform for research prototyping and teaching.
- Guting, Almedia, et al.
- 2005
(Show Context)
Citation Context ...otypes have limited support for trajectory similarity join. Typically, joins are implemented as nested loop joins or sorted-merge joins, which require a large amount of expensive distance computation =-=[14]-=-, [28]. The main focus of this work is to provide efficient and scalable similarity joins of spatio-temporal trajectories. Our main contributions can be summarized as follows: • We introduce a novel d... |

29 | FTW: Fast Similarity Search Under the Time Warping Distance”,
- Sakurai, Yoshikawa, et al.
- 2005
(Show Context)
Citation Context ...distance between points. However, the amount of distance computation involved can be greatly reduced because of the coarser representation. This can be illustrated by using the warping matrix concept =-=[21]-=- to describe the relevant coupling between two trajectories. The values in the cells of the warping matrix denote the distances between the corresponding matching MBRs/points. Figure 3 (b) shows the w... |

28 | Rotation invariant distance measures for trajectories.
- VLACHOS, GUNOPULOS, et al.
- 2004
(Show Context)
Citation Context ...ilarity join of trajectories. We note that the constructing MBRs over time series data for lower bounding has been explored for other similarity measuresalong with the idea of early abandoning [17], =-=[23]-=-, [27]. In this respect, we applied our wDF distance and combine similarity joins and spatio-temporal indices in the native space of moving object trajectories [7], [18], [20] 7 Concluding Remarks & F... |

23 | Atomic wedgie: Efficient query filtering for streaming times series.
- Wei, Keogh, et al.
- 2005
(Show Context)
Citation Context ...e potentially useful and black cells are on final path Moreover, we can do even better with the approximation distances by further limiting the search space, using an idea similar to early abandoning =-=[27]-=-. Consider the warping matrix MApprox in Figure 3 (b) for calculating LBDδwDF between Tr1 and Tr2. Initially, it only consists of “x” cells and white cells and all the white cells are assigned a value... |

22 | Query processing for distance metrics
- Wang, Shasha
- 1990
(Show Context)
Citation Context ... we focus on the nearest neighbor join only. The next two sets of experiments compare the efficiency of three different approaches: (1) our framework using the wDF distance, (2) the metric-based join =-=[26]-=- (essentially a sequential scan over the entire data set but uses the triangular inequality for pruning as much as possible) with wDF as the distance metric and (3) similarity join on DTW distance wit... |

21 |
Indexing multidimensional time-series,”
- Vlachos, Hadjieleftheriou, et al.
- 2006
(Show Context)
Citation Context ...g window. The importance of the temporal dimension is emphasized by the matching window. An idea similar to ours (temporal matching window constraint) has also been used for other similarity measures =-=[25]-=-, where a window size of 5% − 20% of the entire trajectory duration ∆Tr is reported sufficient for most application in terms of finding similar trajectories. Further stretching the temporal matching w... |

18 | Global distance-based segmentation of trajectories
- Anagnostopoulos, Vlachos, et al.
- 2006
(Show Context)
Citation Context ...th, and a particular leaf node may contain segments from different trajectories. The problem of optimally splitting the trajectories to support efficient data mining has recently been investigated in =-=[3]-=- and is beyond the scope of this paper. 3 Spatio-Temporal Distance of Trajectories In this Section, we introduce our new distance measure based on the classical Fréchet distance [1]. We observe that t... |

18 | Index-based most similar trajectory search.
- Frentzos, Gratsias, et al.
- 2007
(Show Context)
Citation Context ...a query sequence, which makes the efficient extension to similarity join questionable. The issue of what is a semantically appropriate distance measure for trajectory similarity is addressed in [19]. =-=[13]-=- considers similarity search for trajectories using spatio-temporal indices and proposes a novel distance measure, however the work does not address the similarity join of trajectories. We note that t... |

17 |
Similarity search in trajectory databases”, in
- Pelekis, Kopanakis, et al.
- 2007
(Show Context)
Citation Context ...(LCSS) [24]. The commonality is that they all follow the transformed space approach, and are not designed to utilize the spatio-temporal indices available in the native space. Recently,Pelekis et al. =-=[19]-=- identified several different similarity distance for trajectories, and argued that each of them is more appropriate than the others in different settings. 2.2 R-tree Based Indexing of Trajectories Th... |

14 |
The k-Nearest Neighbour Join: Turbo charging the KDD process
- Böhm, Krebs
- 2004
(Show Context)
Citation Context ... vast amounts of location-in-time information for moving objects. An important operation on spatio-temporal trajectories, which is fundamental to many data mining applications, is the similarity join =-=[5]-=-, [15]. Given a user defined similarity measure, a similarity join identifies all pairs of objects that satisfy the join predicate in which the condition is specified by the measure. Efficient similar... |

13 |
Efficient Trajectory Joins using Symbolic Representations.
- Bakalov, Hadjieleftheriou, et al.
- 2005
(Show Context)
Citation Context ...than the given distance threshold during the filtering stage, and refine the answers using the exact wDF distance. We also note that our framework can straightforwardly support the time interval join =-=[4]-=-, where the kNN or range predicate is defined using only some portions (segments) of trajectories within a specified time interval of interest. In this case we retrieve only the index nodes and leaf n... |

11 | Dynamics-aware similarity of moving objects trajectories
- TRAJCEVSKI, DING, et al.
- 2007
(Show Context)
Citation Context ...on of the man and the dog are always within a distance of ε. However, this measure pertains only to the routes of the man and the dog, completely ignoring the dynamics of their representative motions =-=[22]-=-. As illustrated in Figure 1, the locations of the man and the dog at some time instancecan be much larger than ε. Popularly, this means that the minimum length of leash is the fine measure of their ... |

8 |
Guibas: Discrete Geometric Shapes
- Alt, L
- 1997
(Show Context)
Citation Context ...ts and have a questionable applicability to sptio-temporal indices in the native space. To exemplify this, we paraphrase the popular man walking dog example [1] in Figure 1. If the Hausdorff distance =-=[2]-=- is used, one can assert that the motion of the man and the dog are always within a distance of ε. However, this measure pertains only to the routes of the man and the dog, completely ignoring the dyn... |

5 |
The UCR Time Series dataset
- Keogh, Xi, et al.
- 2006
(Show Context)
Citation Context ...ome quantitative observations about the potential use of ourframework for data mining applications, we use the wDF distance for classification in data sets provided by the UCR Time Series Collection =-=[16]-=-. We index the trajectories with a 3-dimensional R-tree and uniformly split each trajectory into segments. The resulting segments are then inserted into the R-tree, where each data entry in the leaf n... |

2 |
Efficient similarity join of spatio-temporal trajectories
- Ding, Trajcevski, et al.
- 2007
(Show Context)
Citation Context ...Hence, we have: PROPOSITION 3.1. δwDF defines a pseudo-metric on the set of spatio-temporal trajectories. Due to space limit, the proofs of the claims are omitted from this paper and are presented in =-=[10]-=-. The wDF distance can be computed using dynamic programming and has a complexity of O( w ∆Tr n2 ). However, unlike DTW and EDR, wDF is a pseudo-metric and can utilize the triangular inequality for pr... |