{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:18:51Z","timestamp":1768627131608,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487592","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"572-580","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["SIGMa"],"prefix":"10.1145","author":[{"given":"Simon","family":"Lacoste-Julien","sequence":"first","affiliation":[{"name":"INRIA, Paris, France"}]},{"given":"Konstantina","family":"Palla","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Alex","family":"Davies","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Gjergji","family":"Kasneci","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Thore","family":"Graepel","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Zoubin","family":"Ghahramani","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.43"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217304"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367760"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2008.31"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168092.1168097"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2344108"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of IJCAI-03 Work. on Inf. Integ. on the Web","author":"Cohen W. W.","year":"2003","unstructured":"W. W. Cohen , P. Ravikumar , and S. E. Fienberg . A comparison of string distance metrics for name-matching tasks . In Proc. of IJCAI-03 Work. on Inf. Integ. on the Web , 2003 . W. W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In Proc. of IJCAI-03 Work. on Inf. Integ. on the Web, 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30475-3_47"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1203689"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526792"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963421"},{"key":"e_1_3_2_1_15_1","volume-title":"K-Cap Workshop in Integrating Ontologies","author":"Hu W.","year":"2005","unstructured":"W. Hu , N. Jian , Y. Qu , and Y. Wang . GMO: A graph matching for ontologies . In K-Cap Workshop in Integrating Ontologies , 2005 . W. Hu, N. Jian, Y. Qu, and Y. Wang. GMO: A graph matching for ontologies. In K-Cap Workshop in Integrating Ontologies, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888903000651"},{"key":"e_1_3_2_1_17_1","volume-title":"Lacoste-Julien et al. SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases.hrefhttp:\/\/arxiv.org\/abs\/1207.4525arXiv:1207.4525","author":"S.","year":"2012","unstructured":"S. Lacoste-Julien et al. SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases.hrefhttp:\/\/arxiv.org\/abs\/1207.4525arXiv:1207.4525 , 2012 . S. Lacoste-Julien et al. SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases.hrefhttp:\/\/arxiv.org\/abs\/1207.4525arXiv:1207.4525, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220835.1220850"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.202"},{"key":"e_1_3_2_1_21_1","volume-title":"ISWC\/ASWC","author":"Mao M.","year":"2007","unstructured":"M. Mao . Ontology mapping : An information retrieval and interactive activation network based approach . In ISWC\/ASWC , 2007 . M. Mao. Ontology mapping: An information retrieval and interactive activation network based approach. In ISWC\/ASWC, 2007."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033446"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120103321337421"},{"key":"e_1_3_2_1_24_1","volume-title":"Universit\u00e9 de Versailles","author":"Peralta V.","year":"2007","unstructured":"V. Peralta . Matching of MovieLens and IMDb movie titles. Technical report , Universit\u00e9 de Versailles , 2007 . V. Peralta. Matching of MovieLens and IMDb movie titles. Technical report, Universit\u00e9 de Versailles, 2007."},{"key":"e_1_3_2_1_25_1","first-page":"208","article-title":"Large-scale collective entity matching","volume":"4","author":"Rastogi V.","year":"2011","unstructured":"V. Rastogi , N. Dalvi , and M. Garofalakis . Large-scale collective entity matching . VLDB , 4 : 208 -- 218 , 2011 . V. Rastogi, N. Dalvi, and M. Garofalakis. Large-scale collective entity matching. VLDB, 4:208--218, 2011.","journal-title":"VLDB"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88873-4_18"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078332"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_1_29_1","unstructured":"W3C. RDF Primer (W3C Recommendation 2004-02--10).  W3C. RDF Primer (W3C Recommendation 2004-02--10)."}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD' 13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487592","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:55Z","timestamp":1750235755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487592"}},"subtitle":["simple greedy matching for aligning large knowledge bases"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":29,"alternative-id":["10.1145\/2487575.2487592","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487592","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}