{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:12:52Z","timestamp":1749615172975,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319461397"},{"type":"electronic","value":"9783319461403"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46140-3_4","type":"book-chapter","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T04:39:51Z","timestamp":1473827991000},"page":"48-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nearest Neighbors Graph Construction: Peer Sampling to the Rescue"],"prefix":"10.1007","author":[{"given":"Yahya","family":"Benkaouz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Erradi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"4_CR1","unstructured":"Jester dataset. http:\/\/grouplens.org\/datasets\/jester\/"},{"key":"4_CR2","unstructured":"Jester joke recommender. http:\/\/shadow.ieor.berkeley.edu\/humor\/"},{"key":"4_CR3","unstructured":"Movielens dataset. http:\/\/grouplens.org\/datasets\/movielens\/"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Das, S., El Abbadi, A.: Big data, cloud computing: current state and future opportunities. In: Proceedings of the 14th International Conference on Extending Database Technology, EDBT\/ICDT 2011, pp. 530\u2013533. ACM (2011)","DOI":"10.1145\/1951365.1951432"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Amato, G., Falchi, F.: KNN based image classification relying on local feature similarity. In: Proceedings of the Third International Conference on SImilarity Search and APplications, SISAP 2010, pp. 101\u2013108. ACM (2010)","DOI":"10.1145\/1862344.1862360"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/2043652.2043659","volume":"36","author":"X Bai","year":"2011","unstructured":"Bai, X., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: Collaborative personalized top-k processing. ACM Trans. Database Syst. 36(4), 26 (2011)","journal-title":"ACM Trans. Database Syst."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-16955-7_10","volume-title":"Middleware 2010","author":"M Bertier","year":"2010","unstructured":"Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: The gossple anonymous social network. In: Gupta, I., Mascolo, C. (eds.) Middleware 2010. LNCS, vol. 6452, pp. 191\u2013211. Springer, Heidelberg (2010)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Boiman, O., Shechtman, E., Irani, M.: In defense of nearest-neighbor based image classification. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587598"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Boutet, A., Frey, D., Guerraoui, R., Jegou, A., Kermarrec, A.-M.: WhatsUp: a decentralized instant news recommender. In: Proceedings of the 27th IEEE International Symposium on Parallel Distributed Processing, IPDPS 2013, pp. 741\u2013752 (2013)","DOI":"10.1109\/IPDPS.2013.47"},{"key":"4_CR10","first-page":"1989","volume":"10","author":"J Chen","year":"2009","unstructured":"Chen, J., Fang, H.-R., Saad, Y.: Fast approximate KNN graph construction for high dimensional data via recursive Lanczos bisection. J. Mach. Learn. Res. 10, 1989\u20132012 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TVCG.2010.9","volume":"16","author":"M Connor","year":"2010","unstructured":"Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Trans. Vis. Comput. Graph. 16(4), 599\u2013608 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-0-387-85820-3_4","volume-title":"Recommender Systems Handbook","author":"C Desrosiers","year":"2011","unstructured":"Desrosiers, C., Karypis, G.: A comprehensive survey of neighborhood-based recommendation methods. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 107\u2013144. Springer, Heidelberg (2011)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, pp. 577\u2013586. ACM (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-41527-2_14","volume-title":"Distributed Computing","author":"G Giakkoupis","year":"2013","unstructured":"Giakkoupis, G., Kermarrec, A.-M., Woelfel, P.: Gossip protocols for renaming and sorting. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 194\u2013208. Springer, Heidelberg (2013)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/978-3-540-39964-3_62","volume-title":"On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE","author":"G Guo","year":"2003","unstructured":"Guo, G., Wang, H., Bell, D.J., Bi, Y., Greer, K.: KNN model-based approach in classification. In: Meersman, R., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 986\u2013996. Springer, Heidelberg (2003)"},{"key":"4_CR16","unstructured":"Hajebi, K., Abbasi-Yadkori, Y., Shahbazi, H., Zhang, H.: Fast approximate nearest-neighbor search with k-nearest neighbor graph. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 1312\u20131317. AAAI Press (2011)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Huiskes, M.J., Lew, M.S.: The MIR flickr retrieval evaluation. In: Proceedings of the 1st ACM International Conference on Multimedia Information Retrieval, MIR 2008, pp. 39\u201343. ACM (2008)","DOI":"10.1145\/1460096.1460104"},{"issue":"13","key":"4_CR18","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1016\/j.comnet.2009.03.013","volume":"53","author":"M Jelasity","year":"2009","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: gossip-based fast overlay topology construction. Comput. Netw.: Int. J. Comput. Telecommun. Netw. 53(13), 2321\u20132339 (2009)","journal-title":"Comput. Netw.: Int. J. Comput. Telecommun. Netw."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. 25(3) (2007)","DOI":"10.1145\/1275517.1275520"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TCBB.2007.70272","volume":"6","author":"V Olman","year":"2009","unstructured":"Olman, V., Mao, F., Wu, H., Xu, Y.: Parallel clustering algorithm for large data sets with applications in bioinformatics. The IEEE\/ACM Trans. Comput. Biol. Bioinform. 6(2), 344\u2013352 (2009)","journal-title":"The IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-15277-1_43","volume-title":"Euro-Par 2010 - Parallel Processing","author":"R Orm\u00e1ndi","year":"2010","unstructured":"Orm\u00e1ndi, R., Heged\u0171s, I., Jelasity, M.: Overlay management for fully distributed user-based collaborative filtering. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010, Part I. LNCS, vol. 6271, pp. 446\u2013457. Springer, Heidelberg (2010)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-36288-0_11","volume-title":"Agents and Data Mining Interaction","author":"R Pan","year":"2013","unstructured":"Pan, R., Dolog, P., Xu, G.: KNN-based clustering for improving social recommender systems. In: Cao, L., Zeng, Y., Symeonidis, A.L., Gorodetsky, V.I., Yu, P.S., Singh, M.P. (eds.) ADMI. LNCS, vol. 7607, pp. 115\u2013125. Springer, Heidelberg (2013)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11764298_8","volume-title":"Experimental Algorithms","author":"R Paredes","year":"2006","unstructured":"Paredes, R., Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Practical construction of k-nearest neighbor graphs in metric spaces. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 85\u201397. Springer, Heidelberg (2006)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-45065-5_2","volume-title":"Middleware 2013","author":"S Voulgaris","year":"2013","unstructured":"Voulgaris, S., van Steen, M.: VICINITY: a pinch of randomness brings out the structure. In: Eyers, D., Schwan, K. (eds.) Middleware 2013. LNCS, vol. 8275, pp. 21\u201340. Springer, Heidelberg (2013)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable k-NN graph construction for visual descriptors. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012, pp. 1106\u20131113 (2012)","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.-L., Zhou, L.: G-tree: an efficient index for knn search on road networks. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, CIKM 2013, pp. 39\u201348. ACM (2013)","DOI":"10.1145\/2505515.2505749"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46140-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:36:52Z","timestamp":1749580612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46140-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319461397","9783319461403"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46140-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"15 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}