{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:33:56Z","timestamp":1775054036949,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"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":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020615","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"1406-1414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Web information extraction using markov logic networks"],"prefix":"10.1145","author":[{"given":"Sandeepkumar","family":"Satpal","sequence":"first","affiliation":[{"name":"Microsoft, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahely","family":"Bhadra","sequence":"additional","affiliation":[{"name":"CSA, Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sundararajan","family":"Sellamanickam","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Rastogi","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prithviraj","family":"Sen","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014058"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375682"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.152"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/jmlr.2003.3.4-5.951"},{"key":"e_1_3_2_1_5_1","volume-title":"VLDB","author":"Crescenzi V.","year":"2001","unstructured":"V. Crescenzi , G. Mecca , and P. Merialdo . Roadrunner: Towards automatic data extraction from large web sites . In VLDB , 2001 . V. Crescenzi, G. Mecca, and P. Merialdo. Roadrunner: Towards automatic data extraction from large web sites. In VLDB, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687661"},{"key":"e_1_3_2_1_7_1","volume-title":"AMS","author":"Kautz H.","year":"1997","unstructured":"H. Kautz , B. Selman , and Y. Jiang . A general stochastic approach to solving problems with hard and soft constraints. In The satisfiability problem: theory and applications . AMS , 1997 . H. Kautz, B. Selman, and Y. Jiang. A general stochastic approach to solving problems with hard and soft constraints. In The satisfiability problem: theory and applications. AMS, 1997."},{"key":"e_1_3_2_1_8_1","volume-title":"IJCAI","author":"Kushmerick N.","year":"1997","unstructured":"N. Kushmerick , D. S. Weld , and R. Doorenbos . Wrapper induction for information extraction . In IJCAI , 1997 . N. Kushmerick, D. S. Weld, and R. Doorenbos. Wrapper induction for information extraction. In IJCAI, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526841"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010022931168"},{"key":"e_1_3_2_1_11_1","first-page":"1075","volume-title":"AAAI","author":"Poon H.","year":"2008","unstructured":"H. Poon , P. Domingos , and M. Sumner . A general method for reducing the complexity of relational inference and its application to mcmc . In AAAI , pages 1075 -- 1080 , 2008 . H. Poon, P. Domingos, and M. Sumner. A general method for reducing the complexity of relational inference and its application to mcmc. In AAAI, pages 1075--1080, 2008."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_3_2_1_13_1","volume-title":"UAI","author":"Riedel S.","year":"2008","unstructured":"S. Riedel . Improving the accuracy and efficiency of map inference for Markov logic . In UAI , 2008 . S. Riedel. Improving the accuracy and efficiency of map inference for Markov logic. In UAI, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000003"},{"key":"e_1_3_2_1_15_1","volume-title":"21st NCAI","author":"Singla P.","year":"2006","unstructured":"P. Singla and P. Domingos . Memory-efficient inference in relational domains . In 21st NCAI , 2006 . P. Singla and P. Domingos. Memory-efficient inference in relational domains. In 21st NCAI, 2006."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526735"},{"key":"e_1_3_2_1_17_1","volume-title":"NIPS","author":"Yedidia J. S.","year":"2000","unstructured":"J. S. Yedidia , W. T. Freeman , and Y. Weiss . Generalized belief propagation . In NIPS , 2000 . J. S. Yedidia, W. T. Freeman, and Y. Weiss. Generalized belief propagation. In NIPS, 2000."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060761"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150457"}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Diego California USA","acronym":"KDD '11","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 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:22Z","timestamp":1750240102000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":19,"alternative-id":["10.1145\/2020408.2020615","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020615","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}