Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the k-medoids problem, where residential blocks constitute the input dataset and the k branch locations correspond to the me...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2005
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/874 https://ink.library.smu.edu.sg/context/sis_research/article/1873/viewcontent/SSTD05_MED.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |