2020
DOI: 10.1109/tits.2019.2937882
|View full text |Cite
|
Sign up to set email alerts
|

Label-Based Trajectory Clustering in Complex Road Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 24 publications
(12 citation statements)
references
References 38 publications
0
12
0
Order By: Relevance
“…Among the distance-based methods, Euclidean distance is a popular metric to measure the similarity of trajectories [31], but the method incurs a huge computational overhead because of the need to calculate the distance for each pair of trajectories [32]. Similarly, the identifier-based approach incurs additional communication and computational overhead [33]. The mapbased approach achieves trajectory clustering by matching the baseline map with the intermediate representation of the trajectory, but it cannot achieve high precision clustering well due to the complexity of the road map [34].…”
Section: B Applications Of Floating Vehicle Trajectory Data In Remote Sensingmentioning
confidence: 99%
“…Among the distance-based methods, Euclidean distance is a popular metric to measure the similarity of trajectories [31], but the method incurs a huge computational overhead because of the need to calculate the distance for each pair of trajectories [32]. Similarly, the identifier-based approach incurs additional communication and computational overhead [33]. The mapbased approach achieves trajectory clustering by matching the baseline map with the intermediate representation of the trajectory, but it cannot achieve high precision clustering well due to the complexity of the road map [34].…”
Section: B Applications Of Floating Vehicle Trajectory Data In Remote Sensingmentioning
confidence: 99%
“…Each node label is propagated to neighboring nodes according to their similarity. At each step of node propagation, the node updates itself A trajectory clustering algorithm based on an improved Label Propagation algorithm was proposed where road network is modeled as a dual graph to capture and characterize the similarity between nodes [10]. Liu and Guo proposed a semantic trajectory clustering algorithm based on community detection [32], where different community detection algorithms were discussed.…”
Section: Community Detection In Networkmentioning
confidence: 99%
“…Step 2. Each node is traversed in a random order, and each point is assigned to the adjacent module that gives the largest decrease in Equation (10).…”
Section: Trajectory Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…The massive position and movement information of moving objects are generated continuously, forming large-scale trajectory data. It is of great academic significance and commercial value to mine the underlying distribution information and the evolvement rules, such as urban function partition (Niu et al [1]), traffic jam prediction (Yu et al [2]), and privacy protection (Wang et al [3]). In addition, some classical trajectory clustering algorithms such as DBSCAN (Ester et al [4]) are widely used in anomaly trajectory detection and anomaly event preven-tion (Belhadi et al [5], Belhadi et al [6], Djenouri et al [7]).…”
Section: Introductionmentioning
confidence: 99%