Moving Object Linking Based on Historical Trace
暂无分享,去创建一个
Xiaofang Zhou | Wen Hua | Fengmei Jin | Jiajie Xu | Xiaofang Zhou | Jiajie Xu | Wen Hua | Fengmei Jin
[1] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.
[2] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[3] Georgios Evangelidis,et al. The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation , 1997, The VLDB Journal.
[4] Nikos Mamoulis,et al. Mining frequent spatio-temporal sequential patterns , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[5] Qi Tian,et al. Super-Bit Locality-Sensitive Hashing , 2012, NIPS.
[6] Jiawei Han,et al. Swarm: Mining Relaxed Temporal Moving Object Clusters , 2010, Proc. VLDB Endow..
[7] David B. Lomet,et al. The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.
[8] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[9] Heng Tao Shen,et al. Convoy Queries in Spatio-Temporal Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[10] Roberto J. Bayardo,et al. Scaling up all pairs similarity search , 2007, WWW '07.
[11] César A. Hidalgo,et al. Unique in the Crowd: The privacy bounds of human mobility , 2013, Scientific Reports.
[12] Jiawei Han,et al. Mining periodic behaviors for moving objects , 2010, KDD.
[13] Jiawei Han,et al. Mining event periodicity from incomplete observations , 2012, KDD.
[14] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[15] Dino Pedreschi,et al. Trajectory pattern mining , 2007, KDD '07.
[16] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[17] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[18] Nagiza F. Samatova,et al. Fast Matching for All Pairs Similarity Search , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.
[19] Alexandr Andoni,et al. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[20] Kai Zheng,et al. Calibrating trajectory data for similarity-based analysis , 2013, SIGMOD '13.
[21] Nicholas Jing Yuan,et al. On discovery of gathering patterns from trajectories , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[22] Nikos Mamoulis,et al. Discovery of Periodic Patterns in Spatiotemporal Sequences , 2007, IEEE Transactions on Knowledge and Data Engineering.
[23] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[24] Karl Pearson F.R.S.. LIII. On lines and planes of closest fit to systems of points in space , 1901 .
[25] Reynold Cheng,et al. Earth Mover's Distance based Similarity Search at Scale , 2013, Proc. VLDB Endow..
[26] Sang-goo Lee,et al. An Efficient Similarity Join Algorithm with Cosine Similarity Predicate , 2010, DEXA.
[27] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.
[28] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[29] George Karypis,et al. L2AP: Fast cosine similarity search with prefix L-2 norm bounds , 2014, 2014 IEEE 30th International Conference on Data Engineering.
[30] Marios Hadjieleftheriou,et al. R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.