2019
DOI: 10.1016/j.jtrangeo.2019.05.003
|View full text |Cite
|
Sign up to set email alerts
|

From edit distance to augmented space-time-weighted edit distance: Detecting and clustering patterns of human activities in Puget Sound region

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 44 publications
0
6
0
Order By: Relevance
“…However, for the similarity of two non-equal-length strings or arrays, they need to be calculated by edit distance, which is often called the Levenshtein distance [110]. It is defined as the minimum number of edits required for one of two strings to be converted to another [111]. The edit operation includes replacing a character with another character, inserting a character, or deleting a character.…”
Section: Levenshtein Distancementioning
confidence: 99%
“…However, for the similarity of two non-equal-length strings or arrays, they need to be calculated by edit distance, which is often called the Levenshtein distance [110]. It is defined as the minimum number of edits required for one of two strings to be converted to another [111]. The edit operation includes replacing a character with another character, inserting a character, or deleting a character.…”
Section: Levenshtein Distancementioning
confidence: 99%
“…Furthermore, the EDR method was originally used to calculate the smallest number of operations (i.e., addition, deletion, and modification) required between two strings for complete consistency. This method has been widely used and was extended to similarity analyses of spatiotemporal trajectories [34][35][36][37][38]. However, similar to LCSS, this method cannot easily determine the distance threshold; LCSS and EDR only consider the similar or different components, respectively, such that the results of the similarity analysis are not ideal with uneven sampling point distributions or significant variations in the number of track points.…”
Section: Related Researchmentioning
confidence: 99%
“…Others also applied string or sequence clustering algorithms. For instance, Wang et al (2018) [28] and Zhai et al (2019) [29] measured categorical sequence distance with an edit distance which is the essential number of substitutions, insertions and deletions when converting a string into a target one. However, the edit distance did not consider the characteristics of each change operation.…”
Section: Activity Pattern Clustering Techniquesmentioning
confidence: 99%