{"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}
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.