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

VLDB Journal

Volumn 17, Issue 4, 2008, Pages 923-945

  Mouratidis, Kyriakos ^a   Papadias, Dimitris ^b   Papadimitriou, Spiros ^c  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Medoid queries; Query processing; Spatial databases

Indexed keywords

EID: 45749143113     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-007-0045-2     Document Type: Article

References (35)

1. Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: SIGMOD (1999)
2. Aurenhammer, F., Hoffmann, F., Aronov, B.: Minkowski-type theorems and least-squares partitioning. In: Proceedings of ACM Symposium on Computational Geometry (1992)
3. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: STOC (1998)
4. Berchtold, S., Keim, D., Kriegel, H.: The X-tree: an index structure for high-dimensional data. In: VLDB (1996)
5. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD (1990)
6. Ester, M., Kriegel, H.P., Xu, X.: A database interface for clustering in large spatial databases. In: KDD (1995)
7. Ester, M., Kriegel, H.P., Xu, X.: Knowledge discovery in large spatial databases: focusing techniques for efficient class identification. In: SSD (1995)
8. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD (1996)
9. Fayyad U., Piatetsky-Shapiro G., Smyth P. and Uthurusamy R. (1996). Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Cambridge
10. Gonzalez T. (1985). Clustering to minimize the maximum intercluster distance. Theor. Compu. Sci. 38: 293-306
11. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
12. Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: SIGMOD (1998)
13. Hartigan J.A. (1975). Clustering Algorithms. Wiley, New York
14. Hamerly, G., Elkan, C.: Learning the k in k-means. In: NIPS (2003)
15. Hjaltason, G., Samet, H.: Distance browsing in spatial databases. In: ACM TODS 24(2), 265-318 (1999)
16. Hastie T., Tibshirani R. and Friedman J. (2001). The Elements of Statistical Learning. Springer, Heidelberg
17. Kamel, I., Faloutsos, C.: On Packing R-trees. In: CIKM (1993)
18. Kaufman L. and Rousseeuw P. (1990). Finding Groups in Data. Wiley-Interscience, New York
19. Lo, M.L., Ravishankar, C.V.: Generating Seeded Trees from Data Sets. In: SSD (1995)
20. Lo, M.L., Ravishankar, C.V.: The design and implementation of seeded trees: an efficient method for spatial joins. In: TKDE 10(1), 136-151 (1998)
21. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD (2005)
22. Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the Hilbert space-filling curve. In: TKDE 13(1), 124-141 (2001)
23. Mamoulis, N., Papadias, D.: Slot index spatial join. In: TKDE 15(1), 211-231 (2003)
24. Mokbel, M., Xiong, X., Aref, W.: SINA: Scalable incremental processing of continuous queries in spatio-temporal In: SIGMOD (2004)
25. Ng, R., Han, J.: Efficient and effective clustering methods for spatial data mining. In: VLDB (1994)
26. Pelleg, D., Moore, A.W.: Accelerating exact k-means algorithms with geometric reasoning. In: KDD (1999)
27. Pelleg, D., Moore, A.W.: X-means: Extending k-means with efficient estimation of the number of clusters. In: ICML (2000)
28. Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD (1995)
29. Tao Y. and Papadias D. (2004). Range aggregate processing in spatial databases. TKDE 16(12): 1555-1570
30. Theodoridis Y., Stefanakis E. and Sellis T. (2000). Efficient cost models for spatial queries using R-trees. TKDE 12(1): 19-32
31. Welzl E. (1991). Smallest enclosing disks (Balls and Ellipsoids). New Results New Trends Compu. Sci. 555: 359-370
32. Xing G., Wang X., Zhang Y., Lu C., Pless R. and Gill C. (2005). Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM TOSN 1(1): 36-72
33. Yu, X., Pu, K., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE (2005)
34. Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB (2006)
35. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: SIGMOD (1996)