WebSum: Enhanced SumBasic algorithm for Web site summarization

Jason Yong-Jin Tee, Lay-Ki Soon, Choo-Yee Ting
{"title":"WebSum: Enhanced SumBasic algorithm for Web site summarization","authors":"Jason Yong-Jin Tee, Lay-Ki Soon, Choo-Yee Ting","doi":"10.1109/DMO.2012.6329812","DOIUrl":null,"url":null,"abstract":"Due to the rapid increase of information in the World Wide Web, there exists an explosion of information on the Web that may overwhelm the common Web user. The Web user may find it quicker or more efficient to browse the Web by reading summaries of Web sites. This paper proposes WebSum to compress Web site content into a summary. WebSum is an enhancement of the SumBasic algorithm, that was mainly used for multi-document summarization. In the case of Web sites, we find that several Web characteristics such as title and keywords can be used to extract sentences that may represent the overall topic of the Web site. Initial results show that WebSum is able to reveal sentences relate to the concept of the Web site. WebSum is then evaluated against the original algorithm of SumBasic.","PeriodicalId":330241,"journal":{"name":"2012 4th Conference on Data Mining and Optimization (DMO)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 4th Conference on Data Mining and Optimization (DMO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMO.2012.6329812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the rapid increase of information in the World Wide Web, there exists an explosion of information on the Web that may overwhelm the common Web user. The Web user may find it quicker or more efficient to browse the Web by reading summaries of Web sites. This paper proposes WebSum to compress Web site content into a summary. WebSum is an enhancement of the SumBasic algorithm, that was mainly used for multi-document summarization. In the case of Web sites, we find that several Web characteristics such as title and keywords can be used to extract sentences that may represent the overall topic of the Web site. Initial results show that WebSum is able to reveal sentences relate to the concept of the Web site. WebSum is then evaluated against the original algorithm of SumBasic.
WebSum:用于网站摘要的增强SumBasic算法
由于万维网中信息的快速增长,万维网上的信息呈爆炸式增长,可能使普通的网络用户不堪重负。Web用户可能会发现通过阅读Web站点的摘要来浏览Web更快或更有效。本文提出WebSum将网站内容压缩为摘要。WebSum是SumBasic算法的增强版,主要用于多文档摘要。在Web站点的例子中,我们发现可以使用一些Web特征,如标题和关键字来提取可能代表Web站点整体主题的句子。初步结果表明,WebSum能够揭示与网站概念相关的句子。然后根据SumBasic的原始算法对WebSum进行计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信