J Yang, X Tan, S Rahardja - Remote sensing, 2022 - mdpi.com
Trajectory outlier detection is one of the fundamental data mining techniques used to analyze the trajectory data of the Global Positioning System. A comprehensive literature …
S Li, W Chen, B Yan, Z Li, S Zhu, Y Yu - Future Generation Computer …, 2023 - Elsevier
Trajectory representation learning aims to embed trajectory sequences into fixed-length vector representations while preserving their original spatio-temporal feature proximity …
Given a directed graph G, the directed densest subgraph (DDS) problem refers to finding a subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …
Trajectory computing is a pivotal domain encompassing trajectory data management and mining, garnering widespread attention due to its crucial role in various practical …
T Wei, Y Lin, Y Lin, S Guo, L Zhang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Recovering intermediate missing GPS points in a sparse trajectory, while adhering to the constraints of the road network, could offer deep insights into users' moving behaviors in …
Movement paths are used widely in intelligent transportation and smart city applications. To serve such applications, path representation learning aims to provide compact …
Given an origin (O), a destination (D), and a departure time (T), an Origin-Destination (OD) travel time oracle~(ODT-Oracle) returns an estimate of the time it takes to travel from O to D …
Finding the densest subgraph (DS) from a graph is a fundamental problem in graph databases. The DS obtained, which reveals closely related entities, has been found to be …
Given a directed graph G, the directed densest subgraph (DDS) problem refers to finding a subgraph from G, whose density is the highest among all subgraphs of G. The DDS problem …