ACM Home Page
Please provide us with feedback. Feedback
Countering web spam with credibility-based link analysis
Full text PdfPdf (425 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing table of contents
Portland, Oregon, USA
SESSION: Security table of contents
Pages: 157 - 166  
Year of Publication: 2007
ISBN:978-1-59593-616-5
Authors
James Caverlee  Texas A&M University
Ling Liu  Georgia Institute of Technology
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 92,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281100.1281124
What is a DOI?

ABSTRACT

We introduce the concept of link credibility, identify the conflation of page quality and link credibility in popular Web link analysis algorithms, and discuss how to decouple link credibility from page quality. Our credibility-based link analysis exhibits three distinct features. First, we develop several techniques for semi-automatically assessing link credibility for all Web pages. Second, our link credibility assignment algorithms allow users to assess credibility in a personalized manner. Third, we develop a novel credibility-based Web ranking algorithm - CredibleRank - which incorporates credibility information directly into the quality assessment of each page on the Web. Our experimental study shows that our approach is significantly and consistently more spam-resilient than both PageRank and TrustRank.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Baeza-Yates, C. Castillo, and V. Lopez. PageRank increase under different collusion topologies. In AIRWeb, 2005.
 
2
A. A. Benczur et al. SpamRank - fully automatic link spam detection. In AIRWeb, 2005.
 
3
 
4
B. Davison. Recognizing nepotistic links on the Web. In Workshop on AI for Web Search, 2000.
 
5
D. Fetterly, M. Manasse, and M. Najork. Spam, damn spam, and statistics. In WebDB, 2004.
 
6
D. Gleich, L. Zhukov, and P. Berkhin. Fast parallel PageRank: A linear system approach. Technical report, Yahoo!, 2004.
7
 
8
 
9
Z. Gyöngyi and H. Garcia-Molina. Web spam taxonomy. In AIRWeb, 2005.
 
10
11
 
12
S. D. Kamvar et al. Exploiting the block structure of the Web for computing PageRank. Technical report, Stanford, 2003.
13
 
14
L. Page et al. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford, 1998.
15
 
16
17
 
18
B. Wu, V. Goel, and B. Davison. Propagating trust and distrust to demote web spam. In Models of Trust for the Web (MTW), 2006.
19
 
20
 
21
H. Zhang et al. Improving eigenvector-based reputation systems against collusions. In Algorithms and Models for the Web Graph, 2004.


Collaborative Colleagues:
James Caverlee: colleagues
Ling Liu: colleagues