2014
DOI: 10.1080/13658816.2014.938078
|View full text |Cite
|
Sign up to set email alerts
|

GRASP-UTS: an algorithm for unsupervised trajectory segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 42 publications
(40 citation statements)
references
References 18 publications
0
29
0
Order By: Relevance
“…A cost-function-based approach partitions a trajectory into segments by minimizing a cost function comprised of the conciseness of segments and intra-segment similarity that formalizes the principle of minimum description length (MDL). The cost function was defined in terms of the spatial distance for line segments (Lee et al 2007), and the attribute distance between representative points and other points within segments (Júnior et al 2015). The similar approach was proposed for noise filtering (Riyadh et al 2017).…”
Section: Related Workmentioning
confidence: 99%
“…A cost-function-based approach partitions a trajectory into segments by minimizing a cost function comprised of the conciseness of segments and intra-segment similarity that formalizes the principle of minimum description length (MDL). The cost function was defined in terms of the spatial distance for line segments (Lee et al 2007), and the attribute distance between representative points and other points within segments (Júnior et al 2015). The similar approach was proposed for noise filtering (Riyadh et al 2017).…”
Section: Related Workmentioning
confidence: 99%
“…When the segmentation criteria are unknown, the methods are called "unsupervised". Unsupervised algorithms derive the homogeneity of segments based on some cost function, which can avoid any control from the user, but may lack semantics (W-K means) [33] or are time-consuming (GRASP-UTS) [34]. To combine the benefits of both supervised and unsupervised strategies, Junior [35] first proposed a semi-supervised approach RGRASP-SemTS (Reactive Greedy Randomized Adaptive Search Procedure for Semantic semi-supervised Trajectory Segmentation), which exploited labeled and unlabeled data to achieve homogeneity of segments using a cost function based on the minimum description length (MDL) principle.…”
Section: Introductionmentioning
confidence: 99%
“…Transportation mode estimation involves two steps [11]: (i) extraction of segments of the same transportation modes; and (ii) classification of transportation modes for each segment. For the first step, several segmentation algorithms have been proposed in the past years and include temporal-based [8], cost function-based [5] and semantic-based methods [7]. For the second step, which is the focus of this work, the classification (or prediction) of the transportation modes is performed by creating domain expert features for supervised classification (e.g., the distance between consecutive points, velocities, acceleration, and bearing).…”
Section: Introductionmentioning
confidence: 99%