Finding Arbitrary Shaped Clusters with Related Extents in Space and Time
暂无分享,去创建一个
Gennady L. Andrienko | Natalia V. Andrienko | Christian Pölitz | G. Andrienko | N. Andrienko | Christian Pölitz
[1] Gennady L. Andrienko,et al. Interactive spatio-temporal cluster analysis of VAST challenge 2008 datasets , 2009, VAKD '09.
[2] H. Edelsbrunner,et al. Efficient algorithms for agglomerative hierarchical clustering methods , 1984 .
[3] Andrew W. Moore,et al. Detecting space-time clusters : prior work and new directions , 2004 .
[4] Derya Birant,et al. ST-DBSCAN: An algorithm for clustering spatial-temporal data , 2007, Data Knowl. Eng..
[5] Andrzej Kijko,et al. Space-time Interaction Amongst Clusters of Mining Induced Seismicity , 1996 .
[6] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[7] Gennady L. Andrienko,et al. Interactive analysis of event data using space-time cube , 2004, Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004..
[8] W. Tobler. A Computer Movie Simulating Urban Growth in the Detroit Region , 1970 .
[9] Vijay S. Iyengar,et al. On detecting space-time clusters , 2004, KDD.
[10] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[11] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.