Exploiting tree structure of a web page for clustering

Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla
{"title":"Exploiting tree structure of a web page for clustering","authors":"Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla","doi":"10.1504/IJKWI.2009.027926","DOIUrl":null,"url":null,"abstract":"An approach to designing a Universal Web Wrapper has been in stages of implementation for over years. An issue associated with this is the automated selection of web pages and thereby extraction of content of interest. We propose an algorithm to cluster pages on the basis of their structure. Due to high amount of similarity in these pages, it is be easier to categorise them and extract any particular section of the page. This algorithm makes use of only the structural factors leading to complexity equivalent to O(log n). Further, the algorithm evaluation illustrates the precision and efficiency of the algorithm.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Web Intell.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJKWI.2009.027926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

An approach to designing a Universal Web Wrapper has been in stages of implementation for over years. An issue associated with this is the automated selection of web pages and thereby extraction of content of interest. We propose an algorithm to cluster pages on the basis of their structure. Due to high amount of similarity in these pages, it is be easier to categorise them and extract any particular section of the page. This algorithm makes use of only the structural factors leading to complexity equivalent to O(log n). Further, the algorithm evaluation illustrates the precision and efficiency of the algorithm.
利用网页的树状结构进行聚类
设计通用Web包装器的方法已经处于实现阶段多年。与此相关的一个问题是自动选择网页,从而提取感兴趣的内容。我们提出了一种基于页面结构的聚类算法。由于这些页面的相似性很高,因此更容易对它们进行分类并提取页面的任何特定部分。该算法仅利用了导致复杂度为O(log n)的结构因素。此外,算法评估说明了算法的精度和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信