Vehicle trajectory similarity: Models, methods, and applications

RSD Sousa, A Boukerche, AAF Loureiro - ACM Computing Surveys …, 2020 - dl.acm.org
The increasing availability of vehicular trajectory data is at the core of smart mobility
solutions. Such data offer us unprecedented information for the development of trajectory …

[HTML][HTML] Perspective: Materials informatics and big data: Realization of the “fourth paradigm” of science in materials science

A Agrawal, A Choudhary - Apl Materials, 2016 - pubs.aip.org
Our ability to collect “big data” has greatly surpassed our capability to analyze it,
underscoring the emergence of the fourth paradigm of science, which is datadriven …

KNN-BLOCK DBSCAN: Fast clustering for large-scale data

Y Chen, L Zhou, S Pei, Z Yu, Y Chen… - IEEE transactions on …, 2019 - ieeexplore.ieee.org
Large-scale data clustering is an essential key for big data problem. However, no current
existing approach is “optimal” for big data due to high complexity, which remains it a great …

A survey on parallel clustering algorithms for big data

Z Dafir, Y Lamari, SC Slaoui - Artificial Intelligence Review, 2021 - Springer
Data clustering is one of the most studied data mining tasks. It aims, through various
methods, to discover previously unknown groups within the data sets. In the past years …

Theoretically-efficient and practical parallel DBSCAN

Y Wang, Y Gu, J Shun - Proceedings of the 2020 ACM SIGMOD …, 2020 - dl.acm.org
The DBSCAN method for spatial clustering has received significant attention due to its
applicability in a variety of data analysis tasks. There are fast sequential algorithms for …

A scalable and fast OPTICS for clustering trajectory big data

Z Deng, Y Hu, M Zhu, X Huang, B Du - Cluster Computing, 2015 - Springer
Clustering trajectory data is an important way to mine hidden information behind moving
object sampling data, such as understanding trends in movement patterns, gaining high …

Fast parallel algorithms for euclidean minimum spanning tree and hierarchical spatial clustering

Y Wang, S Yu, Y Gu, J Shun - … of the 2021 international conference on …, 2021 - dl.acm.org
This paper presents new parallel algorithms for generating Euclidean minimum spanning
trees and spatial clustering hierarchies (known as HDBSCAN*). Our approach is based on …

Block-diagonal guided dbscan clustering

Z **ng, W Zhao - IEEE Transactions on Knowledge and Data …, 2024 - ieeexplore.ieee.org
Cluster analysis constitutes a pivotal component of database mining, with DBSCAN being
one of the most extensively employed algorithms in this domain. Nevertheless, DBSCAN is …

A framework for identifying activity groups from individual space-time profiles

J Shen, T Cheng - International journal of geographical information …, 2016 - Taylor & Francis
Datasets collecting the ever-changing position of moving individuals are usually big and
possess high spatial and temporal resolution to reveal activity patterns of individuals in …

A new outlier detection method based on OPTICS

YF Wang, Y Jiong, GP Su, YR Qian - Sustainable cities and society, 2019 - Elsevier
OPTICS is a density-based clustering method that can address point sets with different
densities; however, the outlier detection capability of OPTICS is limited by several factors …