Proceedings of the 2017 SIAM International Conference on Data Mining 2017
DOI: 10.1137/1.9781611974973.91
|View full text |Cite
|
Sign up to set email alerts
|

Robust Map Matching for Heterogeneous Data via Dominance Decompositions

Abstract: For a given sequence of location measurements, the goal of the geometric map matching problem is to compute a sequence of movements along edges of a spatially embedded graph which provides a 'good explanation' for the measurements.The problem gets challenging as real world data, like traces or graphs from the OpenStreetMap project, does not exhibit homogeneous data quality. Graph details and errors vary in areas and each trace has changing noise and precisions. Hence formalizing what a 'good explanation' is, b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
2
2

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…For evaluation, we considered all trajectories within Germany from the Open-StreetMap collection, only dropping low-quality ones (e.g., due to extreme outliers, non-monotonous timestamps, etc.). As a result, we obtained 350 million GPS measurements which were matched to the Germany network with the map matcher from Seybold (2017) to get a dataset with 372,534 trajectories which we call .T ger,real .…”
Section: Resultsmentioning
confidence: 99%
“…For evaluation, we considered all trajectories within Germany from the Open-StreetMap collection, only dropping low-quality ones (e.g., due to extreme outliers, non-monotonous timestamps, etc.). As a result, we obtained 350 million GPS measurements which were matched to the Germany network with the map matcher from Seybold (2017) to get a dataset with 372,534 trajectories which we call .T ger,real .…”
Section: Resultsmentioning
confidence: 99%
“…Methods that build upon an underlying discrete structure, such as a graph network, have become very popular in many fields of science in recent years [e.g. Newman, 2010, Wittkowski et al, 2013, Ahuja et al, 1993, Funke & Seybold, 2014, Seybold, 2017. Since the advent of the Internet, and particularly social networks, hundreds of mathematical tools have been created to investigate network-like structures and phenomena [Newman, 2010].…”
Section: Graph Theorymentioning
confidence: 99%