Detecting sequences and cycles of Web pages

B. L. Narayan, S. Pal
{"title":"Detecting sequences and cycles of Web pages","authors":"B. L. Narayan, S. Pal","doi":"10.1109/WI.2005.53","DOIUrl":null,"url":null,"abstract":"Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the Web may be modeled as a digraph, such algorithms would not be of much use due to both the scale of the Web and the number of uninteresting cycles and sequences in it. We propose a novel sequence detection algorithm for Web pages, and highlight its importance for search related systems. Here, the sequence found is such that its consecutive elements have the same relation among them. This relation is measured in terms of the positional properties of navigational links, for which we provide a method for identifying navigational links. The proposed methodology does not detect all possible sequences and cycles in the Web graph, but just those that were intended by the creators of those Web pages. Experimental results confirm the accuracy of the proposed algorithm.","PeriodicalId":213856,"journal":{"name":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","volume":"156 12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2005.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the Web may be modeled as a digraph, such algorithms would not be of much use due to both the scale of the Web and the number of uninteresting cycles and sequences in it. We propose a novel sequence detection algorithm for Web pages, and highlight its importance for search related systems. Here, the sequence found is such that its consecutive elements have the same relation among them. This relation is measured in terms of the positional properties of navigational links, for which we provide a method for identifying navigational links. The proposed methodology does not detect all possible sequences and cycles in the Web graph, but just those that were intended by the creators of those Web pages. Experimental results confirm the accuracy of the proposed algorithm.
检测网页的序列和循环
图和有向图中的周期检测受到了广泛的关注,有几种算法可用于此目的。虽然Web可以建模为有向图,但由于Web的规模和其中无趣的循环和序列的数量,这种算法不会有太大的用处。我们提出了一种新的网页序列检测算法,并强调了它在搜索相关系统中的重要性。在这里,发现的序列是这样的,它的连续元素之间具有相同的关系。这种关系是根据导航链接的位置属性来衡量的,为此我们提供了一种识别导航链接的方法。所建议的方法不检测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学术文献互助群
群 号:481959085
Book学术官方微信