Topical TrustRank

Published 23 May 2006

Baoning Wu, Vinay Goel, Brian D. Davison

Citations146

TL;DR

This work proposes the use of topical information to partition the seed set and calculate trust scores for each topic separately and shows that the Topical TrustRank has a better performance than TrustRank in demoting spam sites or pages.

Abstract

Web spam is behavior that attempts to deceive search engine ranking algorithms. TrustRank is a recent algorithm that can combat web spam. However, TrustRank is vulnerable in the sense that the seed set used by TrustRank may not be sufficiently representative to cover well the different topics on the Web. Also, for a given seed set, TrustRank has a bias towards larger communities. We propose the use of topical information to partition the seed set and calculate trust scores for each topic separately to address the above issues. A combination of these trust scores for a page is used to determine its ranking. Experimental results on two large datasets show that our Topical TrustRank has a better performance than TrustRank in demoting spam sites or pages. Compared to TrustRank, our best technique can decrease spam from the top ranked sites by as much as 43.1%.

Keywords

Computer ScienceSocial Sciences

The PageRank Citation Ranking : Bringing Order to the Web

12,645 Citations1999Lawrence M. Page, Sergey Brin +2 more

This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.

Topic-sensitive PageRank

1,524 Citations2002Taher H. Haveliwala

A set of PageRank vectors are proposed, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic, and are shown to generate more accurate rankings than with a single, generic PageRank vector.

Computer NetworksFocused crawling: a new approach to topic-specific Web resource discovery

1,492 Citations1999Soumen Chakrabarti, Martin van den Berg +1 more

A new hypertext resource discovery system called a Focused Crawler that is robust against large perturbations in the starting set of URLs, and capable of exploring out and discovering valuable resources that are dozens of links away from the start set, while carefully pruning the millions of pages that may lie within this same radius.

Propagation of trust and distrust

1,471 Citations2004R. Guha, Ravi Kumar +2 more

It is shown that a small number of expressed trusts/distrust per individual allows us to predict trust between any two people in the system with high accuracy.

Scaling personalized web search

1,205 Citations2003Glen Jeh, Jennifer Widom

The approach enables incremental computation, so that the construction of personalized views from partial vectors is practical at query time, and experimental results demonstrate the effectiveness and scalability of the techniques.

ACM SIGIR ForumAnalysis of a very large web search engine query log

1,159 Citations1999Craig Silverstein, Hannes Marais +2 more

It is shown that web users type in short queries, mostly look at the first 10 results only, and seldom modify the query, suggesting that traditional information retrieval techniques may not work well for answering web search requests.

Elsevier eBooksCombating Web Spam with TrustRank

1,025 Citations2004Zoltán Gyöngyi, Héctor García-Molina +1 more

This paper proposes techniques to semi-automatically separate reputable, good pages from spam, and shows that they can effectively filter out spam from a significant fraction of the web, based on a good seed set of less than 200 sites.

Adversarial Information Retrieval on the WebWeb Spam Taxonomy

488 Citations2005Zoltán Gyöngyi, Héctor García-Molina

This paper presents a comprehensive taxonomy of current spamming techniques, which it is believed can help in developing appropriate countermeasures.

Spam, damn spam, and statistics

293 Citations2004Dennis Fetterly, Mark S. Manasse +1 more

This paper proposes that some spam web pages can be identified through statistical analysis, and examines a variety of properties, including linkage structure, page content, and page evolution, and finds that outliers in the statistical distribution of these properties are highly likely to be caused by web spam.

Using ODP metadata to personalize search

272 Citations2005Paul - Alexandru Chirita, Wolfgang Nejdl +2 more

An additional criterion for web page ranking is introduced, namely the distance between a user profile defined using ODP topics and the sets of O DP topics covered by each URL returned in regular web search, and the boundaries of biasing PageRank on subtopics of the ODP are investigated.