Motion-Alert: Automatic Anomaly Detection in Massive Moving Objects
暂无分享,去创建一个
[1] Gareth J. Janacek,et al. Clustering time series from ARMA models with clipped data , 2004, KDD.
[2] Nikos Pelekis,et al. Nearest Neighbor Search on Moving Object Trajectories , 2005, SSTD.
[3] Jimeng Sun,et al. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.
[4] Markus Schneider,et al. A foundation for representing and querying moving objects , 2000, TODS.
[5] Nello Cristianini,et al. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .
[6] Philip S. Yu,et al. A Framework for Projected Clustering of High Dimensional Data Streams , 2004, VLDB.
[7] Jignesh M. Patel,et al. STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.
[8] Beng Chin Ooi,et al. Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.
[9] Shashi Shekhar,et al. A partial join approach for mining co-location patterns , 2004, GIS '04.
[10] Hanan Samet,et al. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates , 2003, VLDB.
[11] Christian S. Jensen,et al. Indexing the positions of continuously moving objects , 2000, SIGMOD '00.
[12] Cyrus Shahabi,et al. A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.
[13] Christian S. Jensen,et al. Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.
[14] Xin Zhang,et al. Fast mining of spatial collocations , 2004, KDD.
[15] Walid G. Aref,et al. SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).
[16] Jean Ponce,et al. Computer Vision: A Modern Approach , 2002 .
[17] Patrick J. Flynn,et al. A Survey Of Free-Form Object Representation and Recognition Techniques , 2001, Comput. Vis. Image Underst..
[18] Yan Huang,et al. Discovering Spatial Co-location Patterns: A Summary of Results , 2001, SSTD.
[19] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[20] Xiaohui Yu,et al. Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).
[21] Jiawei Han,et al. Discovery of Spatial Association Rules in Geographic Information Databases , 1995, SSD.
[22] Christian S. Jensen,et al. Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.
[23] Walid G. Aref,et al. SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.
[24] Ralf Hartmut Güting,et al. Moving Objects Databases , 2005 .
[25] Padhraic Smyth,et al. Trajectory clustering with mixtures of regression models , 1999, KDD '99.
[26] Changzhou Wang,et al. Supporting Movement Pattern Queries in User-Specified Scales , 2003, IEEE Trans. Knowl. Data Eng..
[27] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[28] Nick Roussopoulos,et al. K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.
[29] Yufei Tao,et al. Continuous Nearest Neighbor Search , 2002, VLDB.
[30] Giuseppe Psaila,et al. Querying Shapes of Histories , 1995, VLDB.
[31] Panos Kalnis,et al. On Discovering Moving Clusters in Spatio-temporal Data , 2005, SSTD.
[32] Divyakant Agrawal,et al. Range and kNN Query Processing for Moving Objects in Grid Model , 2003, Mob. Networks Appl..
[33] Dimitrios Gunopulos,et al. Efficient Mining of Spatiotemporal Patterns , 2001, SSTD.
[34] Yufei Tao,et al. Location-based spatial queries , 2003, SIGMOD '03.
[35] Walid G. Aref. Mining Association Rules in Large Databases , 2004 .