基于时间戳和链接的页面排名算法改进

Shiguang Ju, Zheng Wang, Xiaozhong Lv
{"title":"基于时间戳和链接的页面排名算法改进","authors":"Shiguang Ju, Zheng Wang, Xiaozhong Lv","doi":"10.1109/ISIP.2008.61","DOIUrl":null,"url":null,"abstract":"The traditional ranking algorithm favors the old pages, which makes old pages always appear on the top of the ranking results when pages are ranked according to the dynamic web by the static ranking algorithm. Therefore, this paper introduces temporal-link-analysis algorithm to resolve the problem. This algorithm uses the last modification time that returned by the HTTP response as the timestamp of nodes and links concerned. And the weight of the in-link and out-link are also integrated to compute the overall weight of the pages. Using the WTPR algorithm can make the old pages decline and new pages raise in the ranking result, meanwhile it can help the old pages which have high-quality get higher rank value than common old pages.","PeriodicalId":103284,"journal":{"name":"2008 International Symposiums on Information Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Improvement of Page Ranking Algorithm Based on Timestamp and Link\",\"authors\":\"Shiguang Ju, Zheng Wang, Xiaozhong Lv\",\"doi\":\"10.1109/ISIP.2008.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The traditional ranking algorithm favors the old pages, which makes old pages always appear on the top of the ranking results when pages are ranked according to the dynamic web by the static ranking algorithm. Therefore, this paper introduces temporal-link-analysis algorithm to resolve the problem. This algorithm uses the last modification time that returned by the HTTP response as the timestamp of nodes and links concerned. And the weight of the in-link and out-link are also integrated to compute the overall weight of the pages. Using the WTPR algorithm can make the old pages decline and new pages raise in the ranking result, meanwhile it can help the old pages which have high-quality get higher rank value than common old pages.\",\"PeriodicalId\":103284,\"journal\":{\"name\":\"2008 International Symposiums on Information Processing\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposiums on Information Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIP.2008.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposiums on Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIP.2008.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

传统的排序算法偏向于老页面,使得静态排序算法根据动态网页对页面进行排序时,老页面总是出现在排序结果的最前面。因此,本文引入时链分析算法来解决这一问题。该算法使用HTTP响应返回的最后修改时间作为相关节点和链接的时间戳。同时还综合了内链接和外链接的权重,计算出页面的总权重。使用WTPR算法可以使排名结果中旧页面的排名下降,新页面的排名上升,同时使高质量的旧页面获得比普通旧页面更高的排名值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improvement of Page Ranking Algorithm Based on Timestamp and Link
The traditional ranking algorithm favors the old pages, which makes old pages always appear on the top of the ranking results when pages are ranked according to the dynamic web by the static ranking algorithm. Therefore, this paper introduces temporal-link-analysis algorithm to resolve the problem. This algorithm uses the last modification time that returned by the HTTP response as the timestamp of nodes and links concerned. And the weight of the in-link and out-link are also integrated to compute the overall weight of the pages. Using the WTPR algorithm can make the old pages decline and new pages raise in the ranking result, meanwhile it can help the old pages which have high-quality get higher rank value than common old pages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信