ACM Home Page
Please provide us with feedback. Feedback
Computing trusted authority scores in peer-to-peer web search networks
Full text PdfPdf (1.41 MB)
Source AIRWeb; Vol. 215 archive
Proceedings of the 3rd international workshop on Adversarial information retrieval on the web table of contents
Banff, Alberta, Canada
SESSION: Tagging, P2P, cloaking, and commercial intent table of contents
Pages: 73 - 80  
Year of Publication: 2007
ISBN:978-1-59593-732-2
Authors
Josiane Xavier Parreira  Max-Planck Institute for Informatics, Saarbrcken, Germany
Debora Donato  Yahoo! Research, Barcelona, Spain
Carlos Castillo  Yahoo! Research, Barcelona, Spain
Gerhard Weikum  Max-Planck Institute for Informatics, Saarbrcken, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 66,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of its main strengths, but it also opens doors to manipulation of the information and of the quality ratings.

In our previous work (J. X. Parreira, D. Donato, S. Michel and G. Weikum in VLDB 2006) we presented the JXP algorithm for distributed computing PageRank scores for information units (Web pages, sites, peers, social groups, etc.) within a link- or endorsement-based graph structure. The algorithm builds on local authority computations and bilateral peer meetings with exchanges of small data structures that are relevant for gradually learning about global properties and eventually converging towards global authority rankings.

In the current paper we address the important issue of cheating peers that attempt to distort the global authority values, by providing manipulated data during the peer meetings. Our approach to this problem enhances JXP with statistical techniques for detecting suspicious behavior. Our method, coined Trust JXP, is again completely decentralized, and we demonstrate its viability and robustness in experiments with real Web data.


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
 
2
Luca Becchetti, Carlos Castillo, Debora Donato, and Adriano Fazzone. A comparison of sampling techniques for web characterization. In LinkKDD, 2006.
 
3
András A. Benczúr, Károly Csalogány, Tamás Sarlós, and Máté Uher. Spamrank: fully automatic link spam detection. In AIRWeb, 2005.
 
4
 
5
6
 
7
Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, and D. Sivakumar. Link evolution: Analysis and algorithm. Internet Mathematics, 1(3):277--304, 2004.
8
9
 
10
AnHai Doan, Raghu Ramakrishnan, Fei Chen, Pedro DeRose, Yoonkyong Lee, Robert McCann, Mayssam Sayyadian, and Warren Shen. Community information management. IEEE Data Eng. Bull., 29(1):64--72, 2006.
11
 
12
13
 
14
Zoltán Gyöngyi and Hector Garcia-Molina. Web spam taxonomy. In AIRWeb, 2005.
 
15
S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford University, 2003.
16
 
17
18
 
19
 
20
Amy N. Langville and Carl D. Meyer. Deeper inside pagerank. Internet Mathematics, 1(3):335--380, 2003.
 
21
Amy Nicole Langville and Carl Dean Meyer. Deeper inside pagerank. Internet Mathematics, 1(3):335--400, 2004.
 
22
 
23
 
24
 
25
 
26
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.
 
27
Josiane Xavier Parreira, Debora Donato, and Gerhard Weikum. Efficient and decentralized pagerank approximation in a peer-to-peer web search network. In VLDS, 2006.
 
28
Josiane Xavier Parreira and Gerhard Weikum. Jxp: Global authority scores in a p2p network. In WebDB, 2005.
 
29
Sergej Sizov, Martin Theobald, Stefan Siersdorfer, Gerhard Weikum, Jens Graupmann, Michael Biwer, and Patrick Zimmer. The bingo! system for information portal generation and expert web search. In CIDR, 2003.
 
30
 
31
 
32
Torsten Suel, Chandan Mathur, Jo wen Wu, Jiangong Zhang, Alex Delis, Mehdi Kharrazi, Xiaohui Long, and Kulesh Shanmugasundaram. Odissea: A peer-to-peer architecture for scalable web search and information retrieval. In WebDB, 2003.
 
33
Yuan Wang and David J. DeWitt. Computing pagerank in a distributed internet search system. In VLDB, 2004.
 
34


Collaborative Colleagues:
Josiane Xavier Parreira: colleagues
Debora Donato: colleagues
Carlos Castillo: colleagues
Gerhard Weikum: colleagues