Un-biasing the Link Farm Effect in PageRank Computation

A. Rungsawang, K. Puntumapon, Bundit Manaskasemsak
{"title":"Un-biasing the Link Farm Effect in PageRank Computation","authors":"A. Rungsawang, K. Puntumapon, Bundit Manaskasemsak","doi":"10.1109/AINA.2007.143","DOIUrl":null,"url":null,"abstract":"Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The ordering of query results can have an enormous impact on web traffic and the resulting business activity of an enterprise; hence businesses have a strong interest in having their Web pages highly ranked in search engine results. This has led to attempts to artificially inflate page ranks by spamming the link structure of the Web. Building an artificial condensed link structure called a \"link farm\" is one technique to influence a page ranking system, such as the popular PageRank algorithm. In this paper, we present an approach to remove the bias due to link farms from PageRank computation. We propose a method to first measure the PageRank weight accumulated by link farms, and then distribute the weight to other web pages by a modification of the transition matrix in the standard PageRank algorithm. We present results of a selected Web graph that is manually spammed. The results show that the proposed approach can effectively reduce the bias from link farms in PageRank computation.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The ordering of query results can have an enormous impact on web traffic and the resulting business activity of an enterprise; hence businesses have a strong interest in having their Web pages highly ranked in search engine results. This has led to attempts to artificially inflate page ranks by spamming the link structure of the Web. Building an artificial condensed link structure called a "link farm" is one technique to influence a page ranking system, such as the popular PageRank algorithm. In this paper, we present an approach to remove the bias due to link farms from PageRank computation. We propose a method to first measure the PageRank weight accumulated by link farms, and then distribute the weight to other web pages by a modification of the transition matrix in the standard PageRank algorithm. We present results of a selected Web graph that is manually spammed. The results show that the proposed approach can effectively reduce the bias from link farms in PageRank computation.
在PageRank计算中消除链接场效应
链接分析是当前互联网搜索引擎结果排序软件的重要组成部分,它决定了返回给用户的查询结果的顺序。查询结果的排序可以对网络流量和由此产生的企业业务活动产生巨大影响;因此,企业非常希望自己的网页在搜索引擎结果中排名靠前。这导致一些人试图通过滥发网页链接结构来人为地抬高网页排名。建立一个被称为“链接场”的人工压缩链接结构是影响页面排名系统的一种技术,比如流行的PageRank算法。在本文中,我们提出了一种从PageRank计算中消除链接农场偏差的方法。我们提出了一种方法,首先测量链接农场积累的PageRank权重,然后通过修改标准PageRank算法中的过渡矩阵将权重分配给其他网页。我们展示了一个选定的人工发送垃圾邮件的Web图的结果。结果表明,该方法可以有效地减少PageRank计算中来自链接场的偏差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信