{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:31:59Z","timestamp":1768105919567,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319712451","type":"print"},{"value":"9783319712468","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71246-8_51","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T09:03:20Z","timestamp":1514538200000},"page":"843-860","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pivot-Based Distributed K-Nearest Neighbor Mining"],"prefix":"10.1007","author":[{"given":"Caitlin","family":"Kuhlman","sequence":"first","affiliation":[]},{"given":"Yizhou","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Elke","family":"Rundensteiner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"51_CR1","unstructured":"Open Street Map. http:\/\/www.openstreetmap.org\/. Accessed 23 Apr 2016"},{"issue":"4","key":"51_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.14778\/2535570.2488334","volume":"6","author":"FN Afrati","year":"2013","unstructured":"Afrati, F.N., Sarma, A.D., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a map-reduce computation. Proc. VLDB Endow. 6(4), 277\u2013288 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: OPTICS: ordering points to identify the clustering structure, pp. 49\u201360. ACM Press (1999)","DOI":"10.1145\/304181.304187"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R.T., Sander, J.: LOF: identifying density-based local outliers. In: ACM SIGMOD International Conference on Management of Data, pp. 93\u2013104. ACM, New York (2000)","DOI":"10.1145\/335191.335388"},{"issue":"4","key":"51_CR5","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TKDE.2015.2503768","volume":"28","author":"G Chatzimilioudis","year":"2016","unstructured":"Chatzimilioudis, G., Costa, C., Zeinalipour-Yazti, D., Lee, W.C., Pitoura, E.: Distributed in-memory processing of all k nearest neighbor queries. IEEE Trans. Knowl. Data Eng. 28(4), 925\u2013938 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"51_CR6","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of 23rd International Conference on Very Large Data Bases, pp. 426\u2013435 (1997)"},{"issue":"1","key":"51_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"51_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.3847\/0004-6256\/151\/2\/44","volume":"151","author":"KS Dawson","year":"2016","unstructured":"Dawson, K.S.: The SDSS-IV extended baryon oscillation spectroscopic survey: overview and early data. Astron. J. 151(2), 44 (2016). http:\/\/stacks.iop.org\/1538-3881\/151\/i=2\/a=44","journal-title":"Astron. J."},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Mokbel, M.F.: SpatialHadoop: a MapReduce framework for spatial data. In: International Conference on Data Engineering, pp. 1352\u20131363. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113382"},{"key":"51_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, vol. 96, pp. 226\u2013231 (1996)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)","DOI":"10.1145\/971697.602266"},{"key":"51_CR12","unstructured":"Haghani, P., Michel, S., Cudr\u00e9-Mauroux, P., Aberer, K.: LSH at large-distributed KNN search in high dimensions. In: International Workshop on the Web and Databases (2008)"},{"issue":"4","key":"51_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces (survey article). ACM Trans. Database Syst. 28(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"51_CR14","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"KI Lin","year":"1994","unstructured":"Lin, K.I., Jagadish, H.V., Faloutsos, C.: The TV-tree: an index structure for high-dimensional data. Int. J. Very Large Data Bases 3(4), 517\u2013542 (1994)","journal-title":"Int. J. Very Large Data Bases"},{"issue":"10","key":"51_CR15","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.14778\/2336664.2336674","volume":"5","author":"W Lu","year":"2012","unstructured":"Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient processing of k nearest neighbor joins using mapreduce. Proc. VLDB Endow. 5(10), 1016\u20131027 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.knosys.2016.06.012","volume":"117","author":"J Maillo","year":"2017","unstructured":"Maillo, J., Ram\u00edrez, S., Triguero, I., Herrera, F.: kNN-IS: an iterative spark-based design of the k-nearest neighbors classifier for big data. Knowl.-Based Syst. 117, 3\u201315 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Maillo, J., Triguero, I., Herrera, F.: A mapreduce-based k-nearest neighbor approach for big data classification. In: Trustcom\/BigDataSE\/ISPA, vol. 2, pp. 167\u2013172. IEEE (2015)","DOI":"10.1109\/Trustcom.2015.577"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Novak, D., Zezula, P.: M-Chord: a scalable distributed similarity search structure. In: Proceedings of the 1st International Conference on Scalable Information Systems, p. 19. ACM (2006)","DOI":"10.1145\/1146847.1146866"},{"issue":"6","key":"51_CR19","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TKDE.2010.59","volume":"23","author":"S Ramaswamy","year":"2011","unstructured":"Ramaswamy, S., Rose, K.: Adaptive cluster distance bounding for high-dimensional indexing. IEEE Trans. Knowl. Data Eng. 23(6), 815\u2013830 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Ramaswamy, S., Rastogi, R., Shim, K.: Efficient algorithms for mining outliers from large data sets, vol. 29, pp. 427\u2013438. ACM (2000)","DOI":"10.1145\/335191.335437"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Afrati, F.N., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a map-reduce computation. In: Proceedings of the VLDB Endowment, vol. 6, pp. 277\u2013288. VLDB Endowment (2013)","DOI":"10.14778\/2535570.2488334"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: IEEE 26th Symposium on Mass Storage Systems and Technologies, pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"issue":"1","key":"51_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Xie, D., Li, F., Yao, B., Li, G., Zhou, L., Guo, M.: Simba: efficient in-memory spatial analytics. In: ACM SIGMOD International Conference on Management of Data, pp. 1071\u20131085 (2016)","DOI":"10.1145\/2882903.2915237"},{"key":"51_CR25","first-page":"10","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. HotCloud 10, 10 (2010)","journal-title":"HotCloud"},{"key":"51_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, C., Li, F., Jestes, J.: Efficient parallel KNN joins for large data in mapreduce. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 38\u201349. ACM (2012)","DOI":"10.1145\/2247596.2247602"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71246-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T01:15:49Z","timestamp":1672276549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71246-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319712451","9783319712468"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71246-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"30 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Skopje","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macedonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2017.ijs.si\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}