Tree-based partition querying: a methodology for computing medoids in large spatial datasets

@article{Mouratidis2007TreebasedPQ,
  title={Tree-based partition querying: a methodology for computing medoids in large spatial datasets},
  author={Kyriakos Mouratidis and Dimitris Papadias and Spiros Papadimitriou},
  journal={The VLDB Journal},
  year={2007},
  volume={17},
  pages={923-945}
}
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous emerging fields, such as location based services and sensor networks. Since the k-medoid problem is NP-hard, all existing work deals with approximate solutions on relatively small datasets. This paper aims at efficient methods for very large spatial databases, motivated by: (1) the high and ever increasing availability… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS
20 Citations
27 References
Similar Papers

Similar Papers

Loading similar papers…