{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:49:51Z","timestamp":1755838191583,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T00:00:00Z","timestamp":1285027200000},"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":[[2010,9,21]]},"DOI":"10.1145\/1860559.1860590","type":"proceedings-article","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T12:04:33Z","timestamp":1285157073000},"page":"151-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Document structure meets page layout"],"prefix":"10.1145","author":[{"given":"Alex","family":"Spengler","sequence":"first","affiliation":[{"name":"Universit\u00e9 Pierre et Marie Curie, Paris, France"}]},{"given":"Patrick","family":"Gallinari","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Pierre et Marie Curie, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2010,9,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"December","author":"Labs 0","year":"2009","unstructured":"}}Arc9 0 Labs . Readability (version 0.5.1). http:\/\/lab.arc90.com\/experiments\/readability , December 2009 . }}Arc90 Labs. Readability (version 0.5.1). http:\/\/lab.arc90.com\/experiments\/readability, December 2009."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 6th International Language Resources and Evaluation (LREC)","author":"Baroni M.","year":"2008","unstructured":"}} M. Baroni , S. Evert , A. Kilgarriff , and S. Sharoff . CleanEval: A competition for cleaning web pages . In Proceedings of the 6th International Language Resources and Evaluation (LREC) , 2008 . }}M. Baroni, S. Evert, A. Kilgarriff, and S. Sharoff. CleanEval: A competition for cleaning web pages. In Proceedings of the 6th International Language Resources and Evaluation (LREC), 2008."},{"key":"e_1_3_2_1_3_1","volume-title":"Stochastic gradient descent examples on toy problems","author":"Bottou L.","year":"2007","unstructured":"}} L. Bottou . Stochastic gradient descent examples on toy problems , 2007 . http:\/\/leon.bottou.org\/projects\/sgd. }}L. Bottou. Stochastic gradient descent examples on toy problems, 2007. http:\/\/leon.bottou.org\/projects\/sgd."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066677.1067065"},{"key":"e_1_3_2_1_7_1","volume-title":"DELOS Workshop: Personalisation and Recommender Systems in Digital Libraries","author":"Finn A.","year":"2001","unstructured":"}} A. Finn , N. Kushmerick , and B. Smyth . Fact or Fiction: Content classification for digital libraries . In DELOS Workshop: Personalisation and Recommender Systems in Digital Libraries , 2001 . }}A. Finn, N. Kushmerick, and B. Smyth. Fact or Fiction: Content classification for digital libraries. In DELOS Workshop: Personalisation and Recommender Systems in Digital Libraries, 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1316902.1316920"},{"key":"e_1_3_2_1_9_1","volume-title":"Markov Fields on finite graphs and lattices. Unpublished manuscript","author":"Hammersley J.","year":"1971","unstructured":"}} J. Hammersley and P. Clifford . Markov Fields on finite graphs and lattices. Unpublished manuscript , 1971 . }}J. Hammersley and P. Clifford. Markov Fields on finite graphs and lattices. Unpublished manuscript, 1971."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718542"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458237"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/565117.565137"},{"key":"e_1_3_2_1_13_1","first-page":"282","volume-title":"Proceedings of the 18th International Conference on Machine Learning","author":"Lafferty J. D.","year":"2001","unstructured":"}} J. D. Lafferty , A. McCallum , and F. C. N. Pereira . Conditional random fields: Probabilistic models for segmenting and labeling sequence data . In Proceedings of the 18th International Conference on Machine Learning , pages 282 -- 289 , 2001 . }}J. D. Lafferty, A. McCallum, and F. C. N. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning, pages 282--289, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11912873_34"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775134"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1600193.1600208"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Web as Corpus Workshop (WAC3), CleanEval Session, Louvain-la-Neuve","author":"Marek M.","year":"2007","unstructured":"}} M. Marek , P. Pecina , and M. Spousta . Web page cleaning with conditional random fields . In Proceedings of the Web as Corpus Workshop (WAC3), CleanEval Session, Louvain-la-Neuve , Belgium , 2007 . }}M. Marek, P. Pecina, and M. Spousta. Web page cleaning with conditional random fields. In Proceedings of the Web as Corpus Workshop (WAC3), CleanEval Session, Louvain-la-Neuve, Belgium, 2007."},{"key":"e_1_3_2_1_18_1","first-page":"467","volume-title":"Proceedings of Uncertainty in AI","author":"Murphy K. P.","year":"1999","unstructured":"}} K. P. Murphy , Y. Weiss , and M. I. Jordan . Loopy belief propagation for approximate inference: An empirical study . In Proceedings of Uncertainty in AI , pages 467 -- 475 , 1999 . }}K. P. Murphy, Y. Weiss, and M. I. Jordan. Loopy belief propagation for approximate inference: An empirical study. In Proceedings of Uncertainty in AI, pages 467--475, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526840"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587367"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/WAINA.2009.97"},{"key":"e_1_3_2_1_22_1","first-page":"485","volume-title":"Proceedings of the 18th conference in Uncertainty in Artificial Intelligence","author":"Taskar B.","year":"2002","unstructured":"}} B. Taskar , P. Abbeel , and D. Koller . Discriminative probabilistic models for relational data . In Proceedings of the 18th conference in Uncertainty in Artificial Intelligence , pages 485 -- 492 , 2002 . }}B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In Proceedings of the 18th conference in Uncertainty in Artificial Intelligence, pages 485--492, 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183654"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143966"},{"key":"e_1_3_2_1_25_1","volume-title":"Advances in Neural Information Processing Systems","author":"Wainwright M. J.","year":"2001","unstructured":"}} M. J. Wainwright , T. Jaakkola , and A. S. Willsky . Tree-based reparameterization for approximate estimation on loopy graphs . In Advances in Neural Information Processing Systems , 2001 . }}M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree-based reparameterization for approximate estimation on loopy graphs. In Advances in Neural Information Processing Systems, 2001."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557163"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.11.007"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102483"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273644"}],"event":{"name":"DocEng2010: ACM Symposium on Document Engineering","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Manchester United Kingdom","acronym":"DocEng2010"},"container-title":["Proceedings of the 10th ACM symposium on Document engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1860559.1860590","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1860559.1860590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:25Z","timestamp":1750248505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1860559.1860590"}},"subtitle":["loopy random fields for web news content extraction"],"short-title":[],"issued":{"date-parts":[[2010,9,21]]},"references-count":28,"alternative-id":["10.1145\/1860559.1860590","10.1145\/1860559"],"URL":"https:\/\/doi.org\/10.1145\/1860559.1860590","relation":{},"subject":[],"published":{"date-parts":[[2010,9,21]]},"assertion":[{"value":"2010-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}