The PageRank algorithm evaluates webpage reputations based on the hyperlinks that connect them. Webpages that collude to boost their reputations significantly distort the resulting rankings. We introduce a measure for assessing the degree to which a set of webpages boosts its reputation. There is no known efficient algorithm that is guaranteed to detect significantly boosted sets when they exist. However, we provide metrics that, under reasonable conditions, are guaranteed to detect a member of a significantly boosted set, if one exists, and address various implementation issues that arise in incorporating these metrics into PageRank.
具体描述
读后感
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 onlinetoolsland.com All Rights Reserved. 本本书屋 版权所有