@inproceedings{ dmi08,
  crossref = {www2008p},
  author = {Pavel Dmitriev},
  title = {As We May Perceive: Finding the Boundaries of Compound Documents on the Web},
  pages = {1029-1030},
  abstract = {This paper considers the problem of identifying on the Web compound documents (cDocs) --- groups of web pages that in aggregate constitute semantically coherent information entities. Examples of cDocs are a news article consisting of several html pages, or a set of pages describing specifications, price, and reviews of a digital camera. Being able to identify cDocs would be useful in many applications including web and intranet search, user navigation, automated collection generation, and information extraction. In the past, several heuristic approaches have been proposed to identify cDocs. However, heuristics fail to capture the variety of types, styles and goals of information on the web, and do not account for the fact that the definition of a cDoc often depends on the context. This paper presents an experimental evaluation of three machine learning-based algorithms for cDoc discovery. These algorithms are responsive to the varying structure of cDocs and adaptive to their application-specific nature. Based on our previous work, this paper proposes a different scenario for discovering cDocs, and compares in this new setting the local machine learned clustering algorithm to a global purely graph based approach and a Conditional Markov Network approach previously applied to noun coreference task. The results show that the approach outperforms the other algorithms, suggesting that global relational characteristics of web sites are too noisy for cDoc identification purposes.}
}

{"_id":{"_str":"53ff72c27c90ec6e130012b6"},"__v":0,"authorIDs":[],"author_short":["Dmitriev, P."],"bibbaseid":"dmitriev-aswemayperceivefindingtheboundariesofcompounddocumentsontheweb","bibdata":{"downloads":0,"role":"author","bibbaseid":"dmitriev-aswemayperceivefindingtheboundariesofcompounddocumentsontheweb","type":"inproceedings","title":"As We May Perceive: Finding the Boundaries of Compound Documents on the Web","pages":"1029-1030","key":"dmi08","id":"dmi08","crossref":"www2008p","bibtype":"inproceedings","bibtex":"@inproceedings{ dmi08,\n crossref = {www2008p},\n author = {Pavel Dmitriev},\n title = {As We May Perceive: Finding the Boundaries of Compound Documents on the Web},\n pages = {1029-1030},\n abstract = {This paper considers the problem of identifying on the Web compound documents (cDocs) --- groups of web pages that in aggregate constitute semantically coherent information entities. Examples of cDocs are a news article consisting of several html pages, or a set of pages describing specifications, price, and reviews of a digital camera. Being able to identify cDocs would be useful in many applications including web and intranet search, user navigation, automated collection generation, and information extraction. In the past, several heuristic approaches have been proposed to identify cDocs. However, heuristics fail to capture the variety of types, styles and goals of information on the web, and do not account for the fact that the definition of a cDoc often depends on the context. This paper presents an experimental evaluation of three machine learning-based algorithms for cDoc discovery. These algorithms are responsive to the varying structure of cDocs and adaptive to their application-specific nature. Based on our previous work, this paper proposes a different scenario for discovering cDocs, and compares in this new setting the local machine learned clustering algorithm to a global purely graph based approach and a Conditional Markov Network approach previously applied to noun coreference task. The results show that the approach outperforms the other algorithms, suggesting that global relational characteristics of web sites are too noisy for cDoc identification purposes.}\n}","author_short":["Dmitriev, P."],"author":["Dmitriev, Pavel"],"abstract":"This paper considers the problem of identifying on the Web compound documents (cDocs) --- groups of web pages that in aggregate constitute semantically coherent information entities. Examples of cDocs are a news article consisting of several html pages, or a set of pages describing specifications, price, and reviews of a digital camera. Being able to identify cDocs would be useful in many applications including web and intranet search, user navigation, automated collection generation, and information extraction. In the past, several heuristic approaches have been proposed to identify cDocs. However, heuristics fail to capture the variety of types, styles and goals of information on the web, and do not account for the fact that the definition of a cDoc often depends on the context. This paper presents an experimental evaluation of three machine learning-based algorithms for cDoc discovery. These algorithms are responsive to the varying structure of cDocs and adaptive to their application-specific nature. Based on our previous work, this paper proposes a different scenario for discovering cDocs, and compares in this new setting the local machine learned clustering algorithm to a global purely graph based approach and a Conditional Markov Network approach previously applied to noun coreference task. The results show that the approach outperforms the other algorithms, suggesting that global relational characteristics of web sites are too noisy for cDoc identification purposes."},"bibtype":"inproceedings","biburl":"http://dret.net/biblio/dret.bib","creationDate":"2014-08-28T18:19:46.394Z","downloads":0,"keywords":[],"search_terms":["perceive","finding","boundaries","compound","documents","web","dmitriev"],"title":"As We May Perceive: Finding the Boundaries of Compound Documents on the Web","year":null,"dataSources":["mL7NKvaepNEWFcMvG"]}