{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T22:26:49Z","timestamp":1792967209498,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,11,2]]},"DOI":"10.1145\/1645953.1646185","type":"proceedings-article","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T18:36:45Z","timestamp":1257878205000},"page":"1613-1616","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["MatchSim"],"prefix":"10.1145","author":[{"given":"Zhenjiang","family":"Lin","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael R.","family":"Lyu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irwin","family":"King","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_3_2_1_2_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R. A.","year":"1999","unstructured":"R. A. Baeza-Yates and B. A. Ribeiro-Neto . Modern Information Retrieval . ACM Press\/Addison-Wesley , 1999 . R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press\/Addison-Wesley, 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242590"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00022-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458199"},{"key":"e_1_3_2_1_7_1","volume-title":"Algorithms for clustering data","author":"Jain A. K.","year":"1988","unstructured":"A. K. Jain and R. C. Dubes . Algorithms for clustering data . Prentice-Hall, Inc. , NJ , USA, 1988 . A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, Inc., NJ, USA, 1988."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_9_1","volume-title":"Bibliographic coupling between scientific papers. American Documentation, 14(10--25)","author":"Kessler M.","year":"1963","unstructured":"M. Kessler . Bibliographic coupling between scientific papers. American Documentation, 14(10--25) , 1963 . M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14(10--25), 1963."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.127"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/782096.782107"},{"key":"e_1_3_2_1_15_1","volume-title":"The PageRank citation ranking: bringing order to the Web. Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: bringing order to the Web. Technical report , Stanford Digital Library Technologies Project , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390409"},{"key":"e_1_3_2_1_17_1","volume-title":"Automatic Text Processing","author":"Salton G.","year":"1989","unstructured":"G. Salton . Automatic Text Processing . Addison-Wesley , 1989 . G. Salton. Automatic Text Processing. Addison-Wesley, 1989."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630240406"}],"event":{"name":"CIKM '09: Conference on Information and Knowledge Management","location":"Hong Kong China","acronym":"CIKM '09","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 18th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1646185","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1645953.1646185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:23Z","timestamp":1750250483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1646185"}},"subtitle":["a novel neighbor-based similarity measure with maximum neighborhood matching"],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":17,"alternative-id":["10.1145\/1645953.1646185","10.1145\/1645953"],"URL":"https:\/\/doi.org\/10.1145\/1645953.1646185","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}