{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:55Z","timestamp":1750308115828,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T00:00:00Z","timestamp":1130716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,31]]},"DOI":"10.1145\/1099554.1099656","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"339-340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and effective server-sided distributed clustering"],"prefix":"10.1145","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[{"name":"University of Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pfeifle","sequence":"additional","affiliation":[{"name":"University of Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Impulse Symbol. Ch. 5 in The Fourier Transform and Its Applications","author":"Bracewell R.","year":"1999","unstructured":"Bracewell , R. The Impulse Symbol. Ch. 5 in The Fourier Transform and Its Applications , 3 rd ed.: McGraw-Hill , 1999 . Bracewell, R. The Impulse Symbol. Ch. 5 in The Fourier Transform and Its Applications, 3rd ed.: McGraw-Hill, 1999.","edition":"3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872823"},{"key":"e_1_3_2_1_3_1","first-page":"426","volume-title":"Zezula P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB'97","author":"Ciaccia P.","unstructured":"Ciaccia P. , Patella M. , Zezula P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB'97 , pp. 426 -- 435 . Ciaccia P., Patella M., Zezula P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB'97, pp. 426--435."},{"key":"e_1_3_2_1_4_1","first-page":"231","volume-title":"Pfeifle M.: Scalable Density-Based Distributed Clustering. PKDD'04","author":"Januzaj E.","unstructured":"Januzaj E. , Kriegel H.-P. , Pfeifle M.: Scalable Density-Based Distributed Clustering. PKDD'04 , pp. 231 -- 244 . Januzaj E., Kriegel H.-P., Pfeifle M.: Scalable Density-Based Distributed Clustering. PKDD'04, pp. 231--244."},{"key":"e_1_3_2_1_5_1","first-page":"88","volume-title":"Pfeifle M.: Density-Based Distributed Clustering. EDBT'04","author":"Januzaj E.","unstructured":"Januzaj E. , Kriegel H.-P. , Pfeifle M.: Density-Based Distributed Clustering. EDBT'04 , pp. 88 -- 105 . Januzaj E., Kriegel H.-P., Pfeifle M.: Density-Based Distributed Clustering. EDBT'04, pp.88--105."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_51"},{"key":"e_1_3_2_1_7_1","first-page":"415","volume-title":"Pfeifle M.: Measuring the Quality of Approximated Clusterings. BTW'05","author":"Kriegel H.-P.","unstructured":"Kriegel H.-P. , Pfeifle M.: Measuring the Quality of Approximated Clusterings. BTW'05 , pp. 415 -- 424 . Kriegel H.-P., Pfeifle M.: Measuring the Quality of Approximated Clusterings. BTW'05, pp. 415--424."},{"volume-title":"SSDBM'05","author":"Kriegel H.-P.","key":"e_1_3_2_1_8_1","unstructured":"Kriegel H.-P. , Pfeifle M. : Clustering Moving Objects via Medoid Clusterings . SSDBM'05 . Kriegel H.-P., Pfeifle M.: Clustering Moving Objects via Medoid Clusterings. SSDBM'05."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014129"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007619"}],"event":{"name":"CIKM05: Conference on Information and Knowledge Management","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Bremen Germany","acronym":"CIKM05"},"container-title":["Proceedings of the 14th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099656","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1099554.1099656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:15Z","timestamp":1750262895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,31]]},"references-count":10,"alternative-id":["10.1145\/1099554.1099656","10.1145\/1099554"],"URL":"https:\/\/doi.org\/10.1145\/1099554.1099656","relation":{},"subject":[],"published":{"date-parts":[[2005,10,31]]},"assertion":[{"value":"2005-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}