BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Visual Data Mining in Large Geospatial Point Sets
IEEE Computer Graphics and Applications
Exploratory spatio-temporal data mining and visualization
Journal of Visual Languages and Computing
Hi-index | 0.00 |
In this paper we present a system for mining very large spatio-temporal datasets. The system comprises two main layers: the mining layer and the visualization layer. The mining layer implements a new approach based on a 2-pass strategy to efficiently support the data-mining process, address the spatial and temporal dimensions of the dataset, and visualize and interpret results. In the first pass, the data objects are grouped according to their close similarity. In the second pass these groups are clustered to produce new models or patterns. The main reason for this 2-pass strategy is that the datasets are too large for traditional mining and cannot support the interactivity required by the visualization layer.