As we may perceive: inferring logical documents from hypertext

Pavel A. Dmitriev, C. Lagoze, B. Suchkov
{"title":"As we may perceive: inferring logical documents from hypertext","authors":"Pavel A. Dmitriev, C. Lagoze, B. Suchkov","doi":"10.1145/1083356.1083370","DOIUrl":null,"url":null,"abstract":"In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggregation of web pages into web communities. Such logical information units improve a variety of web algorithms and provide the building blocks for the construction of organized information spaces such as digital libraries. In this paper, we focus on a type of logical information units called \"compound documents\". We argue that the ability to identify compound documents can improve information retrieval, automatic metadata generation, and navigation on the Web. We propose a unified framework for identifying the boundaries of compound documents, which combines both structural and content features of constituent web pages. The framework is based on a combination of machine learning and clustering algorithms, with the former algorithm supervising the latter one. We also propose a new method for evaluating quality of clusterings, based on a user behavior model. Experiments on a collection of educational web sites show that our approach can reliably identify most of the compound documents on these sites.","PeriodicalId":134809,"journal":{"name":"UK Conference on Hypertext","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"UK Conference on Hypertext","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1083356.1083370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggregation of web pages into web communities. Such logical information units improve a variety of web algorithms and provide the building blocks for the construction of organized information spaces such as digital libraries. In this paper, we focus on a type of logical information units called "compound documents". We argue that the ability to identify compound documents can improve information retrieval, automatic metadata generation, and navigation on the Web. We propose a unified framework for identifying the boundaries of compound documents, which combines both structural and content features of constituent web pages. The framework is based on a combination of machine learning and clustering algorithms, with the former algorithm supervising the latter one. We also propose a new method for evaluating quality of clusterings, based on a user behavior model. Experiments on a collection of educational web sites show that our approach can reliably identify most of the compound documents on these sites.
如我们所知:从超文本中推断逻辑文档
近年来,已经开发了许多用于处理不同于单个网页的信息单元的Web算法。这些包括网页片段或网页聚合到网络社区。这种逻辑信息单元改进了各种网络算法,并为构建有组织的信息空间(如数字图书馆)提供了构建块。在本文中,我们关注一种称为“复合文档”的逻辑信息单元。我们认为,识别复合文档的能力可以改进信息检索、自动生成元数据和Web导航。我们提出了一个统一的框架来识别复合文档的边界,该框架结合了组成网页的结构和内容特征。该框架基于机器学习和聚类算法的结合,前者算法监督后者。我们还提出了一种基于用户行为模型的聚类质量评估新方法。在一系列教育网站上的实验表明,我们的方法可以可靠地识别这些网站上的大多数复合文档。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信