CoFeed: privacy‐preserving Web search recommendation based on collaborative aggregation of interest feedback. (6th October 2011)

• Record Type: Journal Article
• Authors: Felber, Pascal; Kropf, Peter; Leonini, Lorenzo; Luu, Toan; Rajman, Martin; Rivière, Etienne; Schiavoni, Valerio; Valerio, José
• Other Names: Kapitza Rüdiger guestEditor.
• Is Part Of: Software, practice & experience. Volume 43:Number 10(2013)
• Page Start: 1165
• Page End: 1184
• Publication Date: 2011-10-06
• Subjects: Web search -- collaborative ranking -- decentralized storage -- anonymity; Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.1127
• Languages: English
• ISSNs: 0038-0644

Abstract

SUMMARY: 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 © 2011 John Wiley & Sons, Ltd.