2019
DOI: 10.1111/tgis.12561
|View full text |Cite
|
Sign up to set email alerts
|

Optimal spatial data matching for conflation: A network flow‐based approach

Abstract: Spatial data conflation involves the matching and merging of counterpart features in multiple datasets. It has applications in practical spatial analysis in a variety of fields. Conceptually, the feature‐matching problem can be viewed as an optimization problem of seeking a match plan that minimizes the total discrepancy between datasets. In this article, we propose a powerful yet efficient optimization model for feature matching based on the classic network flow problem in operations research. We begin with a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 14 publications
0
13
0
Order By: Relevance
“…The various limitations of existing conflation methods have been widely discussed (see [68][69][70][71][72] for further details). As a result, manual approaches to conflation still continue to be widely used today for conflating roads and other map data [73]; however, such methods are not scalable for our study. Given these considerations, in this paper we focus on spatial coverage, which could be more reliably computed, and not spatial completeness.…”
Section: Methodsmentioning
confidence: 99%
“…The various limitations of existing conflation methods have been widely discussed (see [68][69][70][71][72] for further details). As a result, manual approaches to conflation still continue to be widely used today for conflating roads and other map data [73]; however, such methods are not scalable for our study. Given these considerations, in this paper we focus on spatial coverage, which could be more reliably computed, and not spatial completeness.…”
Section: Methodsmentioning
confidence: 99%
“…One limitation of the assignment problem is its stringent assumption that every feature in (at least one of) the two datasets must be assigned. To address such issues, [18] introduced two network-flow-based models called the p-matching and p-double-matching models based on the classic minimum cost network problem (called network flow problems for short). The network problem is another cluster of classic models in operations research.…”
Section: Optimized Conflation Modelsmentioning
confidence: 99%
“…It is more expressive than the assignment problem and subsumes several other optimization problems including the assignment problem and the shortest path problem as its special cases. The authors of [18] recognized the need to balance between two objectives: making a large number of matches and keeping false positives low. They developed an adaptive procedure to test an increasing match number until the maximum discrepancy/distance between feature pairs reaches a predefined critical value.…”
Section: Optimized Conflation Modelsmentioning
confidence: 99%
“…The outcome of spatial data integration is not just data overlayed and displayed together. It must have connections among features in different datasets and merge them into a single representation hoping to find new knowledge that cannot be derived from the individual datasets alone [19][20][21][22]. Data sources used in the referenced works concerning spatial data integration can be classified into two categories: official (or authoritative) and volunteered geographic information (VGI).…”
Section: Spatial Data Integrationmentioning
confidence: 99%