Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. CoFeed: privacy-preserving Web search recommendation based on collaborative aggregation of interest feedback
 
research article

CoFeed: privacy-preserving Web search recommendation based on collaborative aggregation of interest feedback

Felber, Pascal
•
Kropf, Peter
•
Leonini, Lorenzo
Show more
2013
Software-Practice & Experience

Search engines essentially rely on the structure of the graph of hyperlinks. Although accurate for the main trend, this is not effective when some query is ambiguous. Leveraging semantic information by the mean of interest matching allows proposing complementary results that are tailored to the user's expectations. This paper proposes a collaborative search companion system, CoFeed, that collects user search queries and that considers feedback to build user-centric and document-centric profiling information. Over time, the system constructs ranked collections of elements that maintain the required information diversity and enhance the user search experience by presenting additional results tailored to the user's interest space. This collaborative search companion requires a supporting architecture adapted to large user populations generating high request loads. To that end, it integrates mechanisms for ensuring scalability and load balancing of the service under varying loads and user interest distributions. Moreover, collecting the recommendation data poses the problem of users' privacy, and the bias one peer can induce to the system by sending fake recommendations. To that end, CoFeed ensures both publisher anonymity and rate limitation. With the former, the origin of the data is never known by the server that processes it, even if several servers collude to spy on some user. The latter, combined with decoupled authentication, allows to minimize the influence of cheating peers sending fake recommendations. Experiments with a deployed prototype highlight the efficiency of the system by analyzing improvement in search relevance, computational cost, scalability and load balancing. Copyright (c) 2011 John Wiley & Sons, Ltd.

  • Details
  • Metrics
Type
research article
DOI
10.1002/spe.1127
Web of Science ID

WOS:000324018600003

Author(s)
Felber, Pascal
Kropf, Peter
Leonini, Lorenzo
Luu, Toan
Rajman, Martin  
Riviere, Etienne
Schiavoni, Valerio
Valerio, Jose
Date Issued

2013

Publisher

Wiley-Blackwell

Published in
Software-Practice & Experience
Volume

43

Issue

10

Start page

1165

End page

1184

Subjects

Web search

•

collaborative ranking

•

decentralized storage

•

anonymity

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LIA  
Available on Infoscience
November 4, 2013
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/96618
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés