Peca, IulianFuchs, GeorgVrotsou, KaterinaAndrienko, NataliaAndrienko, GennadyKresimir Matkovic and Giuseppe Santucci2013-11-082013-11-082012978-3-905673-89-0https://doi.org/10.2312/PE/EuroVAST/EuroVA12/019-023Clustering of massive data is an important analysis tool but also challenging since the data often does not fit in RAM. Many clustering algorithms are thus severely memory-bound. This paper proposes a deterministic density clustering algorithm based on DBSCAN that allows to discover arbitrary shaped clusters of spatio-temporal events that (1) achieves scalability to very large datasets not fitting in RAM and (2) exhibits significant execution time improvements for processing the full dataset compared to plain DBSCAN. The proposed algorithm's integration with interactive visualization methods allows for visual inspection of clustering results in the context of the analysis task; several alternatives are discussed by means of an application example about traffic data analysis.Categories and Subject Descriptors (according to ACM CCS): I.5.3 [Pattern Recognition]: Clustering-Algorithms