个性化和主题敏感PageRank有用性的实验边界

Sinan Al-Saffar, G. Heileman
{"title":"个性化和主题敏感PageRank有用性的实验边界","authors":"Sinan Al-Saffar, G. Heileman","doi":"10.1109/WI.2007.130","DOIUrl":null,"url":null,"abstract":"PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web's link structure. PageRank determines a global ordering of candidate search results according to each page's popularity as determined by the number and importance of pages linking to these results. Personalized and topic-sensitive PageRank are variants of the algorithm that return a local ranking based on each user's preferences as biased by a set of pages they trust or topics they prefer. In this paper we compare personalized and topic-sensitive local PageRanks to the global PageRank showing experimentally how similar or dissimilar results of personalization can be to the original global rank results and to other personalizations. Our approach is to examine a snapshot of the Web and determine how advantageous personalization can be in the best and worst cases and how it performs at various values of the damping factor in the PageRank formula.","PeriodicalId":192501,"journal":{"name":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank\",\"authors\":\"Sinan Al-Saffar, G. Heileman\",\"doi\":\"10.1109/WI.2007.130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web's link structure. PageRank determines a global ordering of candidate search results according to each page's popularity as determined by the number and importance of pages linking to these results. Personalized and topic-sensitive PageRank are variants of the algorithm that return a local ranking based on each user's preferences as biased by a set of pages they trust or topics they prefer. In this paper we compare personalized and topic-sensitive local PageRanks to the global PageRank showing experimentally how similar or dissimilar results of personalization can be to the original global rank results and to other personalizations. Our approach is to examine a snapshot of the Web and determine how advantageous personalization can be in the best and worst cases and how it performs at various values of the damping factor in the PageRank formula.\",\"PeriodicalId\":192501,\"journal\":{\"name\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI.2007.130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2007.130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

PageRank是几种搜索引擎使用的一种算法,根据从网络链接结构中推断出的假设的相关性和流行度对网络文档进行排名。PageRank根据每个页面的受欢迎程度(由链接到这些结果的页面的数量和重要性决定)确定候选搜索结果的全局排序。个性化和主题敏感的PageRank是该算法的变体,它根据每个用户的偏好返回本地排名,这些偏好受他们信任的一组页面或他们喜欢的主题的影响。在本文中,我们将个性化和主题敏感的本地PageRank与全局PageRank进行了比较,实验显示了个性化结果与原始全局排名结果和其他个性化结果的相似或不同程度。我们的方法是检查Web的快照,并确定个性化在最佳和最差情况下的优势,以及它在PageRank公式中的各种阻尼因子值下的表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Experimental Bounds on the Usefulness of Personalized and Topic-Sensitive PageRank
PageRank is an algorithm used by several search engines to rank web documents according to their assumed relevance and popularity deduced from the Web's link structure. PageRank determines a global ordering of candidate search results according to each page's popularity as determined by the number and importance of pages linking to these results. Personalized and topic-sensitive PageRank are variants of the algorithm that return a local ranking based on each user's preferences as biased by a set of pages they trust or topics they prefer. In this paper we compare personalized and topic-sensitive local PageRanks to the global PageRank showing experimentally how similar or dissimilar results of personalization can be to the original global rank results and to other personalizations. Our approach is to examine a snapshot of the Web and determine how advantageous personalization can be in the best and worst cases and how it performs at various values of the damping factor in the PageRank formula.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信