Computing Medoids in Large Spatial Datasets
In this chapter, we consider a class of queries that arise in spatial decision making and resource allocation applications. Assume that a company wants to open a number of warehouses in a city. Let P be the set of residential blocks in the city. P represents customer locations to be potentially serv...
Saved in:
Main Authors: | MOURATIDIS, Kyriakos, PAPADIAS, Dimitris, PAPADIMITRIOU, Spiros |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/247 https://ink.library.smu.edu.sg/context/sis_research/article/1246/viewcontent/Computing_Medoids_in_Large_Spatial_Dataset_2009.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Tree-based Partition Querying: A Methodology for Computing Medoids in Large Spatial Datasets
by: MOURATIDIS, Kyriakos, et al.
Published: (2008) -
Medoid Queries in Large Spatial Databases
by: MOURATIDIS, Kyriakos, et al.
Published: (2005) -
Continuous Medoid Queries over Moving Objects
by: PAPADOPOULOS, Stavros, et al.
Published: (2007) -
Spatial Queries in the Presence of Obstacles
by: ZHANG, Jun, et al.
Published: (2004) -
Continuous Nearest Neighbor Queries over Sliding Windows
by: MOURATIDIS, Kyriakos, et al.
Published: (2007)