Improvements of HITS Algorithms for Spam Links

DOI Web Site 被引用文献2件 参考文献21件
  • ASANO Yasuhito
    Department of Information Sciences, Faculty of Science and Engineering, Tokyo Denki University The Institute of Electronics, Information and Communication Engineers
  • TEZUKA Yu
    Mobile Entertainment Category, Victor Company of Japan, Limited
  • NISHIZEKI Takao
    Graduate School of Information Sciences, Tohoku University The Institute of Electronics, Information and Communication Engineers

この論文をさがす

抄録

The HITS algorithm proposed by Kleinberg is one of the representative methods of scoring Web pages by using hyperlinks. In the days when the algorithm was proposed, most of the pages given high score by the algorithm were really related to a given topic, and hence the algorithm could be used to find related pages. However, the algorithm and the variants including Bharat's improved HITS, abbreviated to BHITS, proposed by Bharat and Henzinger cannot be used to find related pages any more on today's Web, due to an increase of spam links. In this paper, we first propose three methods to find “linkfarms,” that is, sets of spam links forming a densely connected subgraph of a Web graph. We then present an algorithm, called a trust-score algorithm, to give high scores to pages which are not spam pages with a high probability. Combining the three methods and the trust-score algorithm with BHITS, we obtain several variants of the HITS algorithm. We ascertain by experiments that one of them, named TaN+BHITS using the trust-score algorithm and the method of finding linkfarms by employing name servers, is most suitable for finding related pages on today's Web. Our algorithms take time and memory no more than those required by the original HITS algorithm, and can be executed on a PC with a small amount of main memory.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (21)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ