{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:08:44Z","timestamp":1743134924978,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319969824"},{"type":"electronic","value":"9783319969831"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96983-1_30","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T15:50:06Z","timestamp":1533052206000},"page":"419-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nobody Cares if You Liked Star Wars: KNN Graph Construction on the Cheap"],"prefix":"10.1007","author":[{"given":"Anne-Marie","family":"Kermarrec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6862-9046","authenticated-orcid":false,"given":"Olivier","family":"Ruas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9692-5678","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Ta\u00efani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"key":"30_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994 (1994)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-39212-2_41","volume-title":"Automata, Languages, and Programming","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Porat, E.: Sketching for big data recommender systems using fast pseudo-random fingerprints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 459\u2013471. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_41"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: ICML (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Boutet, A., Frey, D., Guerraoui, R., Kermarrec, A.-M., Patra, R.: Hyrec: leveraging browsers for scalable recommenders. In Middleware (2014)","DOI":"10.1145\/2663165.2663315"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Boutet, A., Kermarrec, A.-M., Mittal, N., Ta\u00efani, F.: Being prepared in a sparse world: the case of KNN graph construction. In: ICDE (2016)","DOI":"10.1109\/ICDE.2016.7498244"},{"key":"30_CR6","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997 (1997)"},{"issue":"8-13","key":"30_CR7","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"Andrei Z. Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. In: Computer Networks and ISDN Systems (1997)","journal-title":"Computer Networks and ISDN Systems"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: STOC 2002 (2002)","DOI":"10.1145\/509907.509965"},{"key":"30_CR9","unstructured":"Cui, B., Shen, H.T., Shen, J., Tan, K.-L.: Exploring bit-difference for approximate KNN search in high-dimensional databases. In: ADC (2005)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"30_CR11","unstructured":"Gionis, A., Indyk, P., Motwani, R., et al.: Similarity search in high dimensions via hashing. In: VLDB (1999)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Gorai, M., Sridharan, K., Aditya, T., Mukkamala, R., Nukavarapu, S.: Employing bloom filters for privacy preserving distributed collaborative KNN classification. In: WICT (2011)","DOI":"10.1109\/WICT.2011.6141295"},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"F. Maxwell Harper","year":"2015","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. In: TIIS (2015)","journal-title":"ACM Transactions on Interactive Intelligent Systems"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC (1998)","DOI":"10.1145\/276698.276876"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Sarwat, M., Eldawy, A., Mokbel, M.F.: LARS: a location-aware recommender system. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.54"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1978542.1978566","volume":"54","author":"P Li","year":"2011","unstructured":"Li, P., K\u00f6nig, A.C.: Theory and applications of b-bit minwise hashing. Commun. ACM 54, 101\u2013109 (2011)","journal-title":"Commun. ACM"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","volume":"7","author":"G Linden","year":"2003","unstructured":"Linden, G., Smith, B., York, J.: Amazon.com recommendations: item-to-item collaborative filtering. Internet Comput. 7, 76\u201380 (2003)","journal-title":"Internet Comput."},{"key":"30_CR18","unstructured":"Liu, T., Moore, A.W., Yang, K., Gray, A.G.: An investigation of practical approximate nearest neighbor algorithms. In: NIPS (2004)"},{"key":"30_CR19","unstructured":"Mani, I., Zhang, I.: KNN approach to unbalanced data distributions: a case study involving information extraction. In: Workshop on learning from imbalanced datasets, ICML (2003)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"McAuley, J.J., Leskovec, J.: From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews. In: WWW (2013)","DOI":"10.1145\/2488388.2488466"},{"key":"30_CR21","unstructured":"Moore, A.W.: The anchors hierarchy: using the triangle inequality to survive high dimensional data. In: UAI (2000)"},{"key":"30_CR22","unstructured":"Nodarakis, N., Sioutas, S., Tsoumakos, D., Tzimas, G., Pitoura, E.: Rapid aknn query processing for fast classification of multidimensional data in the cloud. CoRR (2014)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Pan, R., et al.: One-class collaborative filtering. In: ICDM (2008)","DOI":"10.1109\/ICDM.2008.16"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Rashid, A.M., et al.: Getting to know you: learning new user preferences in recommender systems. In: IUI (2002)","DOI":"10.1145\/502716.502737"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2018: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96983-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:07:01Z","timestamp":1659316021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96983-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319969824","9783319969831"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96983-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2018.org\/","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"}]}}