English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks

Parreira, J. X., Donato, D., Castillo, C., & Weikum, G. (2007). Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks. In C. Castillo, K. Chellapilla, & B. Davison (Eds.), AIRWeb 2007: Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web (pp. 73-80). New York, NY, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1EAE-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1EAF-A
Genre: Conference Paper

Files

show Files
hide Files
:
parreiraDCW-www07.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
parreiraDCW-www07.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Parreira, Josiane Xavier1, Author           
Donato, Debora, Author
Castillo, Carlos, Author
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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 {P}age{R}ank 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 {T}rust{JXP}, is again completely decentralized, and we demonstrate its viability and robustness in experiments with real {W}eb data.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-202007
 Publication Status: Issued
 Pages: -
 Publishing info: New York, NY, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356498
DOI: 10.1145/1244408.1244422
Other: Local-ID: C12573CC004A8E26-6185AFF263F90826C12572BB0033901A-ParreiraDCW07
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Banff, Canada
Start-/End Date: 2007-05-08 - 2007-05-08

Legal Case

show

Project information

show

Source 1

show
hide
Title: AIRWeb 2007 : Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web
Source Genre: Proceedings
 Creator(s):
Castillo, Carlos, Editor
Chellapilla, Kumar, Editor
Davison, Brian, Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 73 - 80 Identifier: ISBN: 978-1-59593-732-2

Source 2

show
hide
Title: ACM International Conference Proceeding Series
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -