{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:06Z","timestamp":1750221006812,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1850557"],"award-info":[{"award-number":["1850557"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3332292","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"3241-3242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Tutorial: Are You My Neighbor?"],"prefix":"10.1145","author":[{"given":"David C.","family":"Anastasiu","sequence":"first","affiliation":[{"name":"San Jos\u00e9 State University, San Jose, CA, USA"}]},{"given":"Huzefa","family":"Rangwala","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}]},{"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende, Italy"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"Big Data and Recommender Systems. Nov\u00e1tica","author":"Anastasiu David C.","year":"2016","unstructured":"David C. Anastasiu , Evangelia Christakopoulou , Shaden Smith , Mohit Sharma , and George Karypis . 2016 . Big Data and Recommender Systems. Nov\u00e1tica : Journal of the Spanish Computer Scientist Association 240 ( October 2016). David C. Anastasiu, Evangelia Christakopoulou, Shaden Smith, Mohit Sharma, and George Karypis. 2016. Big Data and Recommender Systems. Nov\u00e1tica: Journal of the Spanish Computer Scientist Association 240 (October 2016).","journal-title":"Journal of the Spanish Computer Scientist Association 240"},{"volume-title":"30th IEEE International Conference on Data Engineering (ICDE '14)","author":"David","key":"e_1_3_2_1_2_1","unstructured":"David C. Anastasiu and George Karypis. 2014. L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds . In 30th IEEE International Conference on Data Engineering (ICDE '14) . 12. David C. Anastasiu and George Karypis. 2014. L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds. In 30th IEEE International Conference on Data Engineering (ICDE '14). 12."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806534"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-017-0064-z"},{"key":"e_1_3_2_1_5_1","volume-title":"Anastasiu and George Karypis","author":"David","year":"2017","unstructured":"David C. Anastasiu and George Karypis . 2017 b. Parallel cosine nearest neighbor graph construction. J. Parallel and Distrib. Comput . (2017). David C. Anastasiu and George Karypis. 2017b. Parallel cosine nearest neighbor graph construction. J. Parallel and Distrib. Comput. (2017)."},{"key":"e_1_3_2_1_6_1","volume-title":"William Stafford Noble, and Kris Laukens","author":"Bittremieux Wout","year":"2018","unstructured":"Wout Bittremieux , Pieter Meysman , William Stafford Noble, and Kris Laukens . 2018 . Fast open modification spectral library searching through approximate nearest neighbor indexing . bioRxiv (may 2018), 326173. Wout Bittremieux, Pieter Meysman, William Stafford Noble, and Kris Laukens. 2018. Fast open modification spectral library searching through approximate nearest neighbor indexing . bioRxiv (may 2018), 326173."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2820010"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2781360"},{"key":"e_1_3_2_1_9_1","volume-title":"Gebremedhin","author":"Catanese Helen N.","year":"2018","unstructured":"Helen N. Catanese , Kelly A. Brayton , and Assefaw H . Gebremedhin . 2018 . A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen. BMC Bioinformatics , Vol. 19 , 1 (12 Dec 2018), 475. Helen N. Catanese, Kelly A. Brayton, and Assefaw H. Gebremedhin. 2018. A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen. BMC Bioinformatics , Vol. 19, 1 (12 Dec 2018), 475."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977805"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2016.7822489"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_3_2_1_13_1","volume-title":"Cosine Threshold Querying with Optimality Guarantees. In 22nd International Conference on Database Theory (ICDT), March 26--29 (2019-03--13)","author":"Li Yuliang","year":"2019","unstructured":"Yuliang Li , Jianguo Wang , Benjamin Pullman , Nuno Bandeira , and Yannis Papakonstantinou . 2019 . Index-based, High-dimensional , Cosine Threshold Querying with Optimality Guarantees. In 22nd International Conference on Database Theory (ICDT), March 26--29 (2019-03--13) . http:\/\/db.ucsd.edu\/wp-content\/uploads\/2018\/12\/ICDT_2019_paper.pdf Yuliang Li, Jianguo Wang, Benjamin Pullman, Nuno Bandeira, and Yannis Papakonstantinou. 2019. Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees. In 22nd International Conference on Database Theory (ICDT), March 26--29 (2019-03--13). http:\/\/db.ucsd.edu\/wp-content\/uploads\/2018\/12\/ICDT_2019_paper.pdf"},{"volume-title":"A Comprehensive Survey of Neighborhood-Based Recommendation Methods","author":"Ning Xia","key":"e_1_3_2_1_14_1","unstructured":"Xia Ning , Christian Desrosiers , and George Karypis . 2015. A Comprehensive Survey of Neighborhood-Based Recommendation Methods . Springer US , Boston, MA , 37--76. Xia Ning, Christian Desrosiers, and George Karypis. 2015. A Comprehensive Survey of Neighborhood-Based Recommendation Methods .Springer US, Boston, MA, 37--76."},{"key":"e_1_3_2_1_15_1","volume-title":"Phenotype Prediction from Metagenomic Data Using Clustering and Assembly with Multiple Instance Learning (CAMIL)","author":"Rahman Mohammad Arifur","year":"2017","unstructured":"Mohammad Arifur Rahman , Nathan LaPierre , and Huzefa Rangwala . 2017. Phenotype Prediction from Metagenomic Data Using Clustering and Assembly with Multiple Instance Learning (CAMIL) . IEEE\/ACM transactions on computational biology and bioinformatics ( 2017 ). Mohammad Arifur Rahman, Nathan LaPierre, and Huzefa Rangwala. 2017. Phenotype Prediction from Metagenomic Data Using Clustering and Assembly with Multiple Instance Learning (CAMIL). IEEE\/ACM transactions on computational biology and bioinformatics (2017)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44845-8_47"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3097987"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0528-8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210181"},{"key":"e_1_3_2_1_20_1","volume-title":"Dhillon","author":"Yu Hsiang-Fu","year":"2017","unstructured":"Hsiang-Fu Yu , Cho-Jui Hsieh , Qi Lei , and Inderjit S . Dhillon . 2017 . A Greedy Approach for Budgeted Maximum Inner Product Search. In Advances in Neural Information Processing Systems 30 (NIPS '17). 5459--5468. Hsiang-Fu Yu, Cho-Jui Hsieh, Qi Lei, and Inderjit S. Dhillon. 2017. A Greedy Approach for Budgeted Maximum Inner Product Search. In Advances in Neural Information Processing Systems 30 (NIPS'17). 5459--5468."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098003"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3332292","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3332292","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3332292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:56Z","timestamp":1750206356000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3332292"}},"subtitle":["Bringing Order to Neighbor Computing Problems."],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":21,"alternative-id":["10.1145\/3292500.3332292","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3332292","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}