2018
DOI: 10.1109/access.2018.2879634
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Similarity Search for Travel Behavior

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 36 publications
0
7
0
Order By: Relevance
“…Raw GPS positioning data are usually of high resolution and massive data volume, and subject to occasional point jumps, which make it necessary to preprocess the trajectory data before analysis, otherwise, it would result in excessive memory consumption and unacceptable running time if we calculate the distance similarity for two trajectories directly. For this reason, trajectory data preprocessing techniques including compression, filtering, segmentation, and transformation were one of the most important research directions (Zheng & Zhou, 2011 ), aiming at efficient distance similarity calculation and fast clustering while retaining adequate geographical information (Lee et al, 2007 ; Tang et al, 2018 ). With the involvement and contribution of researchers in the field of computer science, relevant algorithms and techniques have been developed and exploited deeply (Lee & Krumm, 2011 ), including the Douglas-Peucker (DP) algorithm for trajectory compression (Douglas & Peucker, 1973 ; Hershberger & Snoeyink, 1992 ) and the Kalman filter for trajectory smoothing (Gelb, 1974 ).…”
Section: Three Dimensions Of Trajectory Mining Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…Raw GPS positioning data are usually of high resolution and massive data volume, and subject to occasional point jumps, which make it necessary to preprocess the trajectory data before analysis, otherwise, it would result in excessive memory consumption and unacceptable running time if we calculate the distance similarity for two trajectories directly. For this reason, trajectory data preprocessing techniques including compression, filtering, segmentation, and transformation were one of the most important research directions (Zheng & Zhou, 2011 ), aiming at efficient distance similarity calculation and fast clustering while retaining adequate geographical information (Lee et al, 2007 ; Tang et al, 2018 ). With the involvement and contribution of researchers in the field of computer science, relevant algorithms and techniques have been developed and exploited deeply (Lee & Krumm, 2011 ), including the Douglas-Peucker (DP) algorithm for trajectory compression (Douglas & Peucker, 1973 ; Hershberger & Snoeyink, 1992 ) and the Kalman filter for trajectory smoothing (Gelb, 1974 ).…”
Section: Three Dimensions Of Trajectory Mining Approachesmentioning
confidence: 99%
“…The geographical information system (GIS) and relevant visualization methods also contribute to time and space behavioral studies (Ahas et al, 2008 ; Wu & Carson, 2008 ; Kwan et al, 2015 ; Xu et al, 2020 ). One of the emerging subjects in movement behavioral studies is connected with GPS trajectory mining and spatial-temporal sequence analysis (Cho & Kang, 2019 ; Li et al, 2021 ; Tang et al, 2018 ; Yuan et al, 2017 ; Brum-Bastos et al, 2018 ). GPS trajectory mining has great potential for applications in space-time behavioral studies in buildings and urban spaces, though there are various restrictions and inaccuracies when applied in indoor spaces.…”
Section: Introductionmentioning
confidence: 99%
“…The existing logical-based approaches are reported to consider velocity constraints, reduction of travel distance, and human navigational system [49][50][51]. Nearly, similar problems are also considered when working with outlier-detection based approach where the consideration of driving behavior, statistical process controls, partitioning is carried [56][57][58][59][60][61][62][63]. Table 3 summarizes the research contribution of present times with respect to different parameters to exhibit that all the problems are associated with advantage as well as significant limitation too.…”
Section: Existing Research Trendsmentioning
confidence: 99%
“…Given any destination set P ⋆ for R, Find_Group is proposed to cluster the riders based on a heterogeneous travel network developed in our previous work (Tang et al 2018). The ridesharing relationship can be described using a meta-path ' depart U → T ' , or short as UT shown in Table 1.…”
Section: Example 1 S U P P O S E S E Q L O C Rmentioning
confidence: 99%