{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:00:58Z","timestamp":1772906458310,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"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,1,2]]},"DOI":"10.1145\/3430984.3431013","type":"proceedings-article","created":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T05:34:44Z","timestamp":1609133684000},"page":"65-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning Knowledge Graph for Target-driven Schema Matching"],"prefix":"10.1145","author":[{"given":"Debayan","family":"Mukherjee","sequence":"first","affiliation":[{"name":"TCS Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atreya","family":"Bandyopadhyay","sequence":"additional","affiliation":[{"name":"TCS Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajdip","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"TCS Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indrajit","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"TCS Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ACORD. 2020. ACORD REFERENCE ARCHITECTURE. https:\/\/www.acord.org\/standards-architecture\/reference-architecture.  ACORD. 2020. ACORD REFERENCE ARCHITECTURE. https:\/\/www.acord.org\/standards-architecture\/reference-architecture."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML).","author":"Backurs Arturs","year":"2017","unstructured":"Arturs Backurs and Christos Tzamos . 2017 . Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms . In Proceedings of the 34th International Conference on Machine Learning (ICML). Arturs Backurs and Christos Tzamos. 2017. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. In Proceedings of the 34th International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the VLDB Endowment.","year":"2011","unstructured":"Philip. Bernstein, Jayant. Madhavan, and Erhard. Rahm. 2011 . Generic Schema Matching, Ten Years Later . In Proceedings of the VLDB Endowment. Philip. Bernstein, Jayant. Madhavan, and Erhard. Rahm. 2011. Generic Schema Matching, Ten Years Later. In Proceedings of the VLDB Endowment."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217304"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_6_1","unstructured":"G. Celeux and J. Diebolt. 1985. The SEM Algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Computational Statistics Quarterly 2 (1985).  G. Celeux and J. Diebolt. 1985. The SEM Algorithm: A probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Computational Statistics Quarterly 2 (1985)."},{"key":"e_1_3_2_1_7_1","article-title":"Maximum Likelihood from Incomplete Data via the EM Algorithm","volume":"39","author":"Dempster A.P.","year":"1977","unstructured":"A.P. Dempster , N.M. Laird , and D.B. Rubin . 1977 . Maximum Likelihood from Incomplete Data via the EM Algorithm . Journal of the Royal Statistical Society 39 , 1 (1977). A.P. Dempster, N.M. Laird, and D.B. Rubin. 1977. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society 39, 1 (1977).","journal-title":"Journal of the Royal Statistical Society"},{"key":"e_1_3_2_1_8_1","unstructured":"Li Deng Shuo Zhang and Krisztian Balog. 2019. Table2Vec: NeuralWord and Entity Embeddings for Table Population and Retrieval. In SIGIR.  Li Deng Shuo Zhang and Krisztian Balog. 2019. Table2Vec: NeuralWord and Entity Embeddings for Table Population and Retrieval. In SIGIR."},{"key":"e_1_3_2_1_9_1","volume-title":"COMA - A System for Flexible Combination of Schema Matching Approaches. In Conference on Very Large Databases (VLDB).","author":"Do H.","unstructured":"H. Do and E. Rahm . 2002 . COMA - A System for Flexible Combination of Schema Matching Approaches. In Conference on Very Large Databases (VLDB). H. Do and E. Rahm. 2002. COMA - A System for Flexible Combination of Schema Matching Approaches. In Conference on Very Large Databases (VLDB)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"H. Do and E. Rahm. 2007. Matching large schemas: Approaches and evaluation. Information Systems 32 6 (2007).  H. Do and E. Rahm. 2007. Matching large schemas: Approaches and evaluation. Information Systems 32 6 (2007).","DOI":"10.1016\/j.is.2006.09.002"},{"key":"e_1_3_2_1_11_1","volume-title":"Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach. In ACM SIGMOD International Conference on Management of Data.","author":"Doan A.","unstructured":"A. Doan , P. Domingos , and A. Halevy . 2001 . Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach. In ACM SIGMOD International Conference on Management of Data. A. Doan, P. Domingos, and A. Halevy. 2001. Reconciling Schemas of Disparate Data Sources: A Machine Learning Approach. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"AnHai Doan Alon Halevy and Zachary Ives. 2012. Principles of Data Integration. Morgan Kaufmann.  AnHai Doan Alon Halevy and Zachary Ives. 2012. Principles of Data Integration. Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-416044-6.00015-6"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings IEEE 56th Vehicular Technology Conference.","author":"Feldman J.","unstructured":"J. Feldman , I. Abou-Faycal , and M. Frigo . 2002. A fast maximum-likelihood decoder for convolutional codes . In Proceedings IEEE 56th Vehicular Technology Conference. J. Feldman, I. Abou-Faycal, and M. Frigo. 2002. A fast maximum-likelihood decoder for convolutional codes. In Proceedings IEEE 56th Vehicular Technology Conference."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367564"},{"key":"e_1_3_2_1_15_1","volume-title":"Data Integration: The Teenage Years. In VLDB.","author":"Halevy Alon","year":"2006","unstructured":"Alon Halevy , Anand Rajaraman , and Joann Ordille . 2006 . Data Integration: The Teenage Years. In VLDB. Alon Halevy, Anand Rajaraman, and Joann Ordille. 2006. Data Integration: The Teenage Years. In VLDB."},{"key":"e_1_3_2_1_16_1","volume-title":"Clio: A Semi-automatic Tool for Schema Mapping. In ACM SIGMOD International Conference on Management of Data.","author":"Hern\u00e1ndez M.","unstructured":"M. Hern\u00e1ndez , R. Miller , and L. Haas . 2001 . Clio: A Semi-automatic Tool for Schema Mapping. In ACM SIGMOD International Conference on Management of Data. M. Hern\u00e1ndez, R. Miller, and L. Haas. 2001. Clio: A Semi-automatic Tool for Schema Mapping. In ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921005"},{"key":"e_1_3_2_1_18_1","volume-title":"Corpus-based Schema Matching. In IEEE International Conference on Data Engineering (ICDE).","author":"Madhavan J.","unstructured":"J. Madhavan , P. Bernstein , A. Doan , and A. Halevy . 2005 . Corpus-based Schema Matching. In IEEE International Conference on Data Engineering (ICDE). J. Madhavan, P. Bernstein, A. Doan, and A. Halevy. 2005. Corpus-based Schema Matching. In IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_3_2_1_19_1","volume-title":"Generic Schema Matching with Cupid. In Conference on Very Large Databases (VLDB).","author":"Madhavan J.","year":"2001","unstructured":"J. Madhavan , P. Bernstein , and E Rahm . 2001 . Generic Schema Matching with Cupid. In Conference on Very Large Databases (VLDB). J. Madhavan, P. Bernstein, and E Rahm. 2001. Generic Schema Matching with Cupid. In Conference on Very Large Databases (VLDB)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"e_1_3_2_1_22_1","volume-title":"Meimei: An Efficient Probabilistic Approach for Semantically Annotating Tables. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI","author":"Takeoka Kunihiro","year":"2019","unstructured":"Kunihiro Takeoka , Masafumi Oyamada , Shinji Nakadai , and Takeshi Okadome . 2019 . Meimei: An Efficient Probabilistic Approach for Semantically Annotating Tables. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019. 281\u2013288. Kunihiro Takeoka, Masafumi Oyamada, Shinji Nakadai, and Takeshi Okadome. 2019. Meimei: An Efficient Probabilistic Approach for Semantically Annotating Tables. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019. 281\u2013288."},{"key":"e_1_3_2_1_23_1","unstructured":"TAMR. 2020. TAMR Inc.https:\/\/www.tamr.com.  TAMR. 2020. TAMR Inc.https:\/\/www.tamr.com."},{"key":"e_1_3_2_1_24_1","unstructured":"TCS. 2020. TCS BaNCS For Insurance. https:\/\/www.tcs.com\/bancs\/insurance-solutions.  TCS. 2020. TCS BaNCS For Insurance. https:\/\/www.tcs.com\/bancs\/insurance-solutions."}],"event":{"name":"CODS COMAD 2021: 8th ACM IKDD CODS and 26th COMAD","location":"Bangalore India","acronym":"CODS COMAD 2021"},"container-title":["Proceedings of the 3rd ACM India Joint International Conference on Data Science & Management of Data (8th ACM IKDD CODS & 26th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3430984.3431013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3430984.3431013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:44Z","timestamp":1750195484000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3430984.3431013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":23,"alternative-id":["10.1145\/3430984.3431013","10.1145\/3430984"],"URL":"https:\/\/doi.org\/10.1145\/3430984.3431013","relation":{},"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"2021-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}