{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:20:53Z","timestamp":1725560453641},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281276"},{"type":"electronic","value":"9783540319047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535331_4","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T20:51:20Z","timestamp":1279745480000},"page":"55-72","source":"Crossref","is-referenced-by-count":12,"title":["Medoid Queries in Large Spatial Databases"],"prefix":"10.1007","author":[{"given":"Kyriakos","family":"Mouratidis","sequence":"first","affiliation":[]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[]},{"given":"Spiros","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"4_CR2","first-page":"19","volume":"12","author":"Y. Theodoridis","year":"2000","unstructured":"Theodoridis, Y., Stefanakis, E., Sellis, T.K.: Efficient cost models for spatial queries using r-trees. IEEE TKDE\u00a012, 19\u201332 (2000)","journal-title":"IEEE TKDE"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS\u00a024, 265\u2013318 (1999)","journal-title":"ACM TODS"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for euclidean k-medians and related problems. In: STOC, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.: Finding groups in data. Wiley-Interscience, Hoboken (1990)"},{"key":"4_CR7","unstructured":"Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: VLDB, pp. 144\u2013155 (1994)"},{"key":"4_CR8","unstructured":"Ester, M., Kriegel, H.P., Xu, X.: A database interface for clustering in large spatial databases. In: KDD, pp. 94\u201399 (1995)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-60159-7_5","volume-title":"Advances in Spatial Databases","author":"M. Ester","year":"1995","unstructured":"Ester, M., Kriegel, H.P., Xu, X.: Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol.\u00a0951, pp. 67\u201382. Springer, Heidelberg (1995)"},{"key":"4_CR10","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226\u2013231 (1996)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. In: SIGMOD, pp. 103\u2013114 (1996)","DOI":"10.1145\/235968.233324"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large databases. In: SIGMOD, pp. 73\u201384 (1998)","DOI":"10.1145\/276305.276312"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: Ordering points to identify the clustering structure. In: SIGMOD, pp. 49\u201360 (1999)","DOI":"10.1145\/304181.304187"},{"key":"4_CR14","volume-title":"Clustering algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering algorithms. Wiley, Chichester (1975)"},{"key":"4_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The elements of statistical learning. Springer, Heidelberg (2001)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Pelleg, D., Moore, A.W.: Accelerating exact k-means algorithms with geometric reasoning. In: KDD, pp. 277\u2013281 (1999)","DOI":"10.1145\/312129.312248"},{"key":"4_CR17","unstructured":"Pelleg, D., Moore, A.W.: X-means: Extending K-means with efficient estimation of the number of clusters. In: ICML, pp. 727\u2013734 (2000)"},{"key":"4_CR18","unstructured":"Hamerly, G., Elkan, C.: Learning the k in k-means. In: NIPS (2003)"},{"key":"4_CR19","unstructured":"Fayyad, U., Piatetsjy-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in knowledge discovery and data mining. AAAI\/MIT (1996)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On packing r-trees. In: CIKM, pp. 490\u2013499 (1993)","DOI":"10.1145\/170088.170403"},{"key":"4_CR21","first-page":"124","volume":"13","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the clustering properties of the hilbert space-filling curve. IEEE TKDE\u00a013, 124\u2013141 (2001)","journal-title":"IEEE TKDE"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-60159-7_20","volume-title":"Advances in Spatial Databases","author":"M.L. Lo","year":"1995","unstructured":"Lo, M.L., Ravishankar, C.V.: Generating seeded trees from data sets. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol.\u00a0951, pp. 328\u2013347. Springer, Heidelberg (1995)"},{"key":"4_CR23","first-page":"136","volume":"10","author":"M.L. Lo","year":"1998","unstructured":"Lo, M.L., Ravishankar, C.V.: The design and implementation of seeded trees: An efficient method for spatial joins. IEEE TKDE\u00a010, 136\u2013152 (1998)","journal-title":"IEEE TKDE"},{"key":"4_CR24","first-page":"211","volume":"15","author":"N. Mamoulis","year":"2003","unstructured":"Mamoulis, N., Papadias, D.: Slot index spatial join. IEEE TKDE\u00a015, 211\u2013231 (2003)","journal-title":"IEEE TKDE"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535331_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:15Z","timestamp":1605643875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535331_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281276","9783540319047"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11535331_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}