{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:55:27Z","timestamp":1775087727270,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"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":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457328","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:30Z","timestamp":1624036950000},"page":"2310-2318","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Medical Entity Disambiguation Using Graph Neural Networks"],"prefix":"10.1145","author":[{"given":"Alina","family":"Vretinaris","sequence":"first","affiliation":[{"name":"IBM Germany &amp; IBM Research, Ehningen, Germany"}]},{"given":"Chuan","family":"Lei","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}]},{"given":"Vasilis","family":"Efthymiou","sequence":"additional","affiliation":[{"name":"FORTH-ICS &amp; IBM Research, Heraklion, Greece"}]},{"given":"Xiao","family":"Qin","sequence":"additional","affiliation":[{"name":"IBM Research - Almaden, San Jose, CA, USA"}]},{"given":"Fatma","family":"\u00d6zcan","sequence":"additional","affiliation":[{"name":"Google &amp; IBM Research, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"35","article-title":"What is the distance between graphs","volume":"20","author":"Bunke H.","year":"1983","unstructured":"H. Bunke . What is the distance between graphs . Bulletin of the EATCS , 20 : 35 -- 39 , 1983 . H. Bunke. What is the distance between graphs. Bulletin of the EATCS, 20:35--39, 1983.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"e_1_3_2_2_3_1","first-page":"675","volume-title":"COLING","author":"Cao Y.","year":"2018","unstructured":"Y. Cao , L. Hou , J. Li , and Z. Liu . Neural collective entity linking . In COLING , pages 675 -- 686 , 2018 . Y. Cao, L. Hou, J. Li, and Z. Liu. Neural collective entity linking. In COLING, pages 675--686, 2018."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330964"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00129"},{"key":"e_1_3_2_2_6_1","volume-title":"Entity Resolution, and Duplicate Detection. Data-Centric Systems and Applications","author":"Christen P.","year":"2012","unstructured":"P. Christen . Data Matching - Concepts and Techniques for Record Linkage , Entity Resolution, and Duplicate Detection. Data-Centric Systems and Applications . Springer , 2012 . P. Christen. Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Data-Centric Systems and Applications. Springer, 2012."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196907"},{"key":"e_1_3_2_2_8_1","first-page":"762","volume-title":"EDBT","author":"Das S.","year":"2014","unstructured":"S. Das , J. Srinivasan , M. Perry , E. I. Chong , and J. Banerjee . A tale of two graphs: Property graphs as RDF in oracle . In EDBT , pages 762 -- 773 , 2014 . S. Das, J. Srinivasan, M. Perry, E. I. Chong, and J. Banerjee. A tale of two graphs: Property graphs as RDF in oracle. In EDBT, pages 762--773, 2014."},{"issue":"1","key":"e_1_3_2_2_9_1","first-page":"10","article-title":"Ncbi disease corpus: A resource for disease name recognition and concept normalization","volume":"47","author":"Dogan R. I.","year":"2014","unstructured":"R. I. Dogan , R. Leaman , and Z. Lu . Ncbi disease corpus: A resource for disease name recognition and concept normalization . Journal of Biomedical Informatics , 47 : 1 -- 10 , 2014 . R. I. Dogan, R. Leaman, and Z. Lu. Ncbi disease corpus: A resource for disease name recognition and concept normalization. Journal of Biomedical Informatics, 47:1 -- 10, 2014.","journal-title":"Journal of Biomedical Informatics"},{"key":"e_1_3_2_2_10_1","volume-title":"COLING, page 277--285","author":"Dredze M.","year":"2010","unstructured":"M. Dredze , P. McNamee , D. Rao , A. Gerber , and T. Finin . Entity disambiguation for knowledge base population . In COLING, page 277--285 , 2010 . M. Dredze, P. McNamee, D. Rao, A. Gerber, and T. Finin. Entity disambiguation for knowledge base population. In COLING, page 277--285, 2010."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380297"},{"key":"e_1_3_2_2_12_1","volume-title":"AllenNLP: A deep semantic natural language processing platform. CoRR, abs\/1803.07640","author":"Gardner M.","year":"2018","unstructured":"M. Gardner , J. Grus , AllenNLP: A deep semantic natural language processing platform. CoRR, abs\/1803.07640 , 2018 . M. Gardner, J. Grus, et al. AllenNLP: A deep semantic natural language processing platform. CoRR, abs\/1803.07640, 2018."},{"key":"e_1_3_2_2_13_1","first-page":"129","volume-title":"COLT","volume":"2777","author":"T.","year":"2003","unstructured":"T. G\"a rtner, P. A. Flach , and S. Wrobel . On graph kernels: Hardness results and efficient alternatives . In COLT , volume 2777 , pages 129 -- 143 , 2003 . T. G\"a rtner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In COLT, volume 2777, pages 129--143, 2003."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314042"},{"key":"e_1_3_2_2_15_1","first-page":"1024","volume-title":"NIPS","author":"Hamilton W. L.","year":"2017","unstructured":"W. L. Hamilton , R. Ying , and J. Leskovec . Inductive representation learning on large graphs . In NIPS , pages 1024 -- 1034 , 2017 . W. L. Hamilton, R. Ying, and J. Leskovec. Inductive representation learning on large graphs. In NIPS, pages 1024--1034, 2017."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2751522"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2016.35"},{"key":"e_1_3_2_2_18_1","volume-title":"ICLR","author":"Kingma D. P.","year":"2015","unstructured":"D. P. Kingma and J. Ba . Adam: A method for stochastic optimization . In ICLR , 2015 . D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. In ICLR, 2015."},{"key":"e_1_3_2_2_19_1","volume-title":"ICLR","author":"Kipf T. N.","year":"2017","unstructured":"T. N. Kipf and M. Welling . Semi-supervised classification with graph convolutional networks . In ICLR , 2017 . T. N. Kipf and M. Welling. Semi-supervised classification with graph convolutional networks. In ICLR, 2017."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.10.003"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2015.05.007"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1030"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz682"},{"key":"e_1_3_2_2_24_1","first-page":"2016","article-title":"CDR task corpus: a resource for chemical disease relation extraction","volume":"05","author":"Li J.","year":"2016","unstructured":"J. Li , Y. Sun , R. J. Johnson , D. Sciaky , C.-H. Wei , R. Leaman , A. P. Davis , C. J. Mattingly , T. C. Wiegers , and Z. Lu . BioCreative V CDR task corpus: a resource for chemical disease relation extraction . Database , 2016 , 05 2016 . J. Li, Y. Sun, R. J. Johnson, D. Sciaky, C.-H. Wei, R. Leaman, A. P. Davis, C. J. Mattingly, T. C. Wiegers, and Z. Lu. BioCreative V CDR task corpus: a resource for chemical disease relation extraction. Database, 2016, 05 2016.","journal-title":"Database"},{"key":"e_1_3_2_2_25_1","first-page":"3835","volume-title":"ICML","author":"Li Y.","year":"2019","unstructured":"Y. Li , C. Gu , T. Dullien , O. Vinyals , and P. Kohli . Graph matching networks for learning the similarity of graph structured objects . In ICML , pages 3835 -- 3845 , 2019 . Y. Li, C. Gu, T. Dullien, O. Vinyals, and P. Kohli. Graph matching networks for learning the similarity of graph structured objects. In ICML, pages 3835--3845, 2019."},{"key":"e_1_3_2_2_26_1","volume-title":"ICLR","author":"Li Y.","year":"2016","unstructured":"Y. Li , D. Tarlow , M. Brockschmidt , and R. S. Zemel . Gated graph sequence neural networks . In ICLR , 2016 . Y. Li, D. Tarlow, M. Brockschmidt, and R. S. Zemel. Gated graph sequence neural networks. In ICLR, 2016."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-5010"},{"key":"e_1_3_2_2_28_1","first-page":"3111","volume-title":"NIPS","author":"Mikolov T.","year":"2013","unstructured":"T. Mikolov , I. Sutskever , K. Chen , G. S. Corrado , and J. Dean . Distributed representations of words and phrases and their compositionality . In NIPS , pages 3111 -- 3119 , 2013 . T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean. Distributed representations of words and phrases and their compositionality. In NIPS, pages 3111--3119, 2013."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196926"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2053"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/S14-2007"},{"key":"e_1_3_2_2_32_1","volume-title":"https:\/\/pytorch.org\/","year":"2020","unstructured":"PyTorch. https:\/\/pytorch.org\/ , 2020 . PyTorch. https:\/\/pytorch.org\/, 2020."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72903-7_5"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-180317"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1136\/jamia.2009.001560"},{"key":"e_1_3_2_2_36_1","first-page":"593","volume-title":"ESWC","author":"Schlichtkrull M. S.","year":"2018","unstructured":"M. S. Schlichtkrull , T. N. Kipf , P. Bloem , R. van den Berg, I. Titov, and M. Welling. Modeling relational data with graph convolutional networks . In ESWC , pages 593 -- 607 , 2018 . M. S. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling. Modeling relational data with graph convolutional networks. In ESWC, pages 593--607, 2018."},{"key":"e_1_3_2_2_37_1","volume-title":"SHINE","author":"Shen W.","unstructured":"W. Shen , J. Han , J. Wang , X. Yuan , and Z. Yang . SHINE W. Shen, J. Han, J. Wang, X. Yuan, and Z. Yang. SHINE"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2730862"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2327028"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1136\/jamia.2010.004119"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-015-0871-y"},{"key":"e_1_3_2_2_42_1","volume-title":"ICLR","author":"Velickovic P.","year":"2018","unstructured":"P. Velickovic , G. Cucurull , A. Casanova , A. Romero , P. Li\u00f2 , and Y. Bengio . Graph attention networks . In ICLR , 2018 . P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Li\u00f2, and Y. Bengio. Graph attention networks. In ICLR, 2018."},{"key":"e_1_3_2_2_43_1","volume-title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks. arXiv:1909.01315","author":"Wang M.","year":"2019","unstructured":"M. Wang , D. Zheng , Z. Ye , Deep graph library: A graph-centric, highly-performant package for graph neural networks. arXiv:1909.01315 , 2019 . M. Wang, D. Zheng, Z. Ye, et al. Deep graph library: A graph-centric, highly-performant package for graph neural networks. arXiv:1909.01315, 2019."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11536"},{"key":"e_1_3_2_2_45_1","volume-title":"IJCAI, page 1859--1865","author":"Wang Q.","year":"2015","unstructured":"Q. Wang , B. Wang , and L. Guo . Knowledge base completion using embeddings and rules . In IJCAI, page 1859--1865 , 2015 . Q. Wang, B. Wang, and L. Guo. Knowledge base completion using embeddings and rules. In IJCAI, page 1859--1865, 2015."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"e_1_3_2_2_47_1","volume-title":"AKBC 2019","author":"Wright D.","year":"2019","unstructured":"D. Wright , Y. Katsis , R. Mehta , and C.-N. Hsu . NormCo : Deep disease normalization for biomedical knowledge base construction . In AKBC 2019 , 2019 . D. Wright, Y. Katsis, R. Mehta, and C.-N. Hsu. NormCo: Deep disease normalization for biomedical knowledge base construction. In AKBC 2019, 2019."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380192"},{"key":"e_1_3_2_2_49_1","volume-title":"Graph2seq: Graph to sequence learning with attention-based neural networks. CoRR, abs\/1804.00823","author":"Xu K.","year":"2018","unstructured":"K. Xu , L. Wu , Z. Wang , Y. Feng , and V. Sheinin . Graph2seq: Graph to sequence learning with attention-based neural networks. CoRR, abs\/1804.00823 , 2018 . K. Xu, L. Wu, Z. Wang, Y. Feng, and V. Sheinin. Graph2seq: Graph to sequence learning with attention-based neural networks. CoRR, abs\/1804.00823, 2018."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_51_1","first-page":"9240","volume-title":"NeurIPS","author":"Ying Z.","year":"2019","unstructured":"Z. Ying , D. Bourgeois , J. You , M. Zitnik , and J. Leskovec . Gnnexplainer: Generating explanations for graph neural networks . In NeurIPS , pages 9240 -- 9251 , 2019 . Z. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec. Gnnexplainer: Generating explanations for graph neural networks. In NeurIPS, pages 9240--9251, 2019."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00061"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-34129-3_12"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":54,"alternative-id":["10.1145\/3448016.3457328","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457328","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}