2023
DOI: 10.1016/j.compenvurbsys.2023.101977
|View full text |Cite
|
Sign up to set email alerts
|

Conflating point of interest (POI) data: A systematic review of matching methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 109 publications
0
1
0
Order By: Relevance
“…Identifying nearest neighbours typically involves estimating their distances from the subject point of interest (POI). This computational challenge is commonly addressed using a range-query-oriented spatial index like KD-Tree, R-Tree, or Ball-Tree, which may be efficient for full-distance matrix computation [58]. However, a predetermined boundary is often set in urban planning issues such as housing density estimation, a radial buffer or a census tract/statistical area unit are examples of the boundary used.…”
Section: Methodsmentioning
confidence: 99%
“…Identifying nearest neighbours typically involves estimating their distances from the subject point of interest (POI). This computational challenge is commonly addressed using a range-query-oriented spatial index like KD-Tree, R-Tree, or Ball-Tree, which may be efficient for full-distance matrix computation [58]. However, a predetermined boundary is often set in urban planning issues such as housing density estimation, a radial buffer or a census tract/statistical area unit are examples of the boundary used.…”
Section: Methodsmentioning
confidence: 99%