{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:22Z","timestamp":1763468182264},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319058092"},{"type":"electronic","value":"9783319058108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05810-8_22","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T03:31:25Z","timestamp":1397619085000},"page":"327-341","source":"Crossref","is-referenced-by-count":7,"title":["Greedy Filtering: A Scalable Algorithm for K-Nearest Neighbor Graph Construction"],"prefix":"10.1007","author":[{"given":"Youngki","family":"Park","sequence":"first","affiliation":[]},{"given":"Sungchan","family":"Park","sequence":"additional","affiliation":[]},{"given":"Sang-goo","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Woosung","family":"Jung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Park, Y., Park, S., Lee, S., Jung, W.: Scalable k-nearest neighbor graph construction based on Greedy Filtering. In: WWW 2013, pp. 227\u2013228 (2013)","DOI":"10.1145\/2487788.2487905"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-15251-1_33","volume-title":"Database and Expert Systems Applications","author":"D. Lee","year":"2010","unstructured":"Lee, D., Park, J., Shim, J., Lee, S.-g.: An efficient similarity join algorithm with cosine similarity predicate. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part II. LNCS, vol.\u00a06262, pp. 422\u2013436. Springer, Heidelberg (2010)"},{"key":"22_CR3","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999, pp. 518\u2013529 (1999)"},{"key":"22_CR4","unstructured":"Durme, B., Lall, A.: Online generation of locality sensitive hash signatures. In: ACL 2010, pp. 231\u2013235 (2010)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Similarity estimation techniques from rounding algorithms. In: STOC 2002, pp. 380\u2013388 (2002)","DOI":"10.1145\/509961.509965"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW 2011, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW 2007, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2000824.2000825","volume":"36","author":"C. Xiao","year":"2011","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J., Wang, G.: Efficient similarity joins for near-duplicate detection. ACM Trans. on Database Systems\u00a036(3), 15\u201341 (2011)","journal-title":"ACM Trans. on Database Systems"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Kim, Y., Shim, K.: Parallel top-k similarity join algorithms using MapReduce. In: ICDE 2012, pp. 510\u2013521 (2012)","DOI":"10.1109\/ICDE.2012.87"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W.: X Lin, and H. Shang. Top-k set similarity joins. In: ICDE 2009, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"issue":"8","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"A. Broder","year":"1997","unstructured":"Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the web. Computer Networks and ISDN Systems\u00a029(8), 1157\u20131166 (1997)","journal-title":"Computer Networks and ISDN Systems"},{"key":"22_CR12","first-page":"1989","volume":"10","author":"J. Chen","year":"2009","unstructured":"Chen, J., Fang, H., Saad, Y.: Fast approximate kNN graph construction for high dimensional data via recursive lanczos bisection. The Journal of Machine Learning Research\u00a010, 1989\u20132012 (2009)","journal-title":"The Journal of Machine Learning Research"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Said, A., Jain, B., Albayrak, S.: Analyzing weighting schemes in collaborative filtering: Cold start, post cold start and power users. In: SAC 2012, pp. 2035\u20132040 (2012)","DOI":"10.1145\/2245276.2232114"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05810-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T15:38:05Z","timestamp":1558885085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05810-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058092","9783319058108"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05810-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}