Democratizing personalization Anne-Marie Kermarrec Joint work with A. Boutet, D. Frey, R. Guerraoui, A. Jégou, H. Ribeiro.

Slides:



Advertisements
Similar presentations
Google News Personalization: Scalable Online Collaborative Filtering
Advertisements

Google News Personalization Scalable Online Collaborative Filtering
1 Whats Up: P2P news recommender Anne-Marie Kermarrec Joint work with Antoine Boutet, Davide Frey (INRIA) and Rachid Guerraoui (EPFL) Gossple workshop.
Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.
Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.
Collaborative QoS Prediction in Cloud Computing Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong, China Rocky.
Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.
SocioPlug Polystyrene: Survivable Shape for Self-Organising Data François Taïani Joint work with: Hoel Kervadec (INSA Rennes) Simon Bouget (ENS Rennes)
CSE 5243 (AU 14) Graph Basics and a Gentle Introduction to PageRank 1.
A P2P REcommender system based on Gossip Overlays (PREGO) ‏ R.Baraglia, P.Dazzi M.Mordacchini, L.Ricci A P2P REcommender system based on Gossip Overlays.
20/10/2006ALPAGE1 Ordered slicing of very large scale overlay networks Mark Jelasity University of Bologna, Italy Anne-Marie Kermarrec INRIA Rennes/IRISA,
Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:
Policy-based Virtual Network Embedding across Multiple Domains
1 RegionKNN: A Scalable Hybrid Collaborative Filtering Algorithm for Personalized Web Service Recommendation Xi Chen, Xudong Liu, Zicheng Huang, and Hailong.
Gossip Algorithms and Implementing a Cluster/Grid Information service MsSys Course Amar Lior and Barak Amnon.
1 Walking on a Graph with a Magnifying Glass Stratified Sampling via Weighted Random Walks Maciej Kurant Minas Gjoka, Carter T. Butts, Athina Markopoulou.
Unstructured overlays: construction, optimization, applications Anne-Marie Kermarrec Joint work with Laurent Massoulié and Ayalvadi Ganesh.
Small-world Overlay P2P Network
Named Data Networking for Social Network Content delivery P. Truong, B. Mathieu (Orange Labs), K. Satzke (Alu) E. Stephan (Orange Labs) draft-truong-icnrg-ndn-osn-00.txt.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Personalized Ontologies for Web Search and Caching Susan Gauch Information and Telecommunications Technology Center Electrical Engineering and Computer.
(ITI310) By Eng. BASSEM ALSAID SESSIONS 8: Network Load Balancing (NLB)
Recommender Systems. >1,000,000,000 Finding Trusted Information How many cows in Texas?
Module 13: Network Load Balancing Fundamentals. Server Availability and Scalability Overview Windows Network Load Balancing Configuring Windows Network.
Communication (II) Chapter 4
Link Recommendation In P2P Social Networks Yusuf Aytaş, Hakan Ferhatosmanoğlu, Özgür Ulusoy Bilkent University, Ankara, Turkey.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
P2P RECOMMENDER SYSTEMS: A (SMALL) SURVEY Giulio Rossetti.
Gil EinzigerRoy Friedman Computer Science Department Technion.
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
Recommendation system MOPSI project KAROL WAGA
Emiran UC San Diego Alin UC San Diego K.K. at&t Divesh at&t.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
LARS*: An Efficient and Scalable Location-Aware Recommender System.
Let’s ChronoSync: Decentralized Dataset State Synchronization in Named Data Networking Zhenkai Zhu Alexander Afanasyev (presenter) Tuesday, October 8,
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
Securing Distributed Sensor Networks Udayan Kumar Subhajit Sengupta Sharad Sonapeer.
Personalized Social Recommendations – Accurate or Private? A. Machanavajjhala (Yahoo!), with A. Korolova (Stanford), A. Das Sarma (Google) 1.
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
Data Mining: Knowledge Discovery in Databases Peter van der Putten ALP Group, LIACS Pre-University College LAPP-Top Computer Science February 2005.
1 Privacy-Enhanced Collaborative Filtering Privacy-Enhanced Personalization workshop July 25, 2005, Edinburgh, Scotland Shlomo Berkovsky 1, Yaniv Eytani.
WSP: A Network Coordinate based Web Service Positioning Framework for Response Time Prediction Jieming Zhu, Yu Kang, Zibin Zheng and Michael R. Lyu The.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.
KNN CF: A Temporal Social Network kNN CF: A Temporal Social Network Neal Lathia, Stephen Hailes, Licia Capra University College London RecSys ’ 08 Advisor:
Bloom Cookies: Web Search Personalization without User Tracking Authors: Nitesh Mor, Oriana Riva, Suman Nath, and John Kubiatowicz Presented by Ben Summers.
Data Communications and Networks Chapter 9 – Distributed Systems ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Location Privacy Protection for Location-based Services CS587x Lecture Department of Computer Science Iowa State University.
MIDDLEWARE SYSTEMS RESEARCH GROUP MSRG.ORG Distributed Ranked Data Dissemination in Social Networks Joint work with: Mo Sadoghi Vinod Muthusamy Hans-Arno.
Locating data in (small-world?) P2P scientific collaborations Gisik Kwon 6/11/02.
Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
1 Roie Melamed, Technion AT&T Labs Araneola: A Scalable Reliable Multicast System for Dynamic Wide Area Environments Roie Melamed, Idit Keidar Technion.
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Ahoy: A Proximity-Based Discovery Protocol Robbert Haarman.
Improved Algorithms for Network Topology Discovery
Distributed voting application for handheld devices
Early Measurements of a Cluster-based Architecture for P2P Systems
Comparison of LAN, MAN, WAN
Collaborative Filtering Nearest Neighbor Approach
A Scalable content-addressable network
Postdoc, School of Information, University of Arizona
Movie Recommendation System
Privacy Protection for Social Network Services
StormRider: Harnessing “Storm” for Social Networks
Recommender Systems Problem formulation Machine Learning.
Presentation transcript:

Democratizing personalization Anne-Marie Kermarrec Joint work with A. Boutet, D. Frey, R. Guerraoui, A. Jégou, H. Ribeiro

Need for personalization KNN-based user-centric collaborative filtering

This talk Providing scalable infrastructures involving the machines available at the edge of the network Highly scalable Cheap Privacy aware

Decentralized versus centralized KNN selection

Sampling-based KNN selection Provide each user with her k closest neighbors Use this topology for personalized notifications: WhatsUp recommendation: HyRec Users owns a profile, the system has its favorite similarity metric

Decentralized KNN selection [FGKL 2010] RPS layer providing random sampling clustering layer gossip-based topology clustering Social linkRandom link Alice Bob Carl Dave Ellie Alice Bob Carl Dave Ellie node Local version portable to centralized systems [Dong & al, 2011]

Data port :2110 Bloom Filter Update :2020 Bloom Filter ProfileI like it: : N 1, N 2, … I don’t : N 10, N 13, … Update time 5 Network of the k closest entries Uniform (dynamic) sample of c random :2020 Bloom Filter ProfileI like it: : N 1, N 2, … I don’t : N 10, N 13, … Update time :2020 Bloom Filter ProfileI like it: : N 1, N 2, … I don’t : N 10, N 13, … Update time :2020 Bloom Filter ProfileI like it: : N 1, N 2, … I don’t : N 10, N 13, … Update time :2020 Bloom Filter Profile+: N 1, N 2, … - : N 10, N 13, … Update time port :2110 Bloom Filter Update port :2110 Bloom Filter Update port :2110 Bloom Filter Update port :2110 Bloom Filter Update port :2110 Bloom Filter Update port :2110 Bloom Filter Update time30

Localized KNN in centralized settings [Dong & al, WWW 2011] Alice Bob Carl DaveEllie Frank

WHATSUP DECENTRALIZED NEWS RECOMMENDER [BFGJK, 2013]

WhatsUp in a nutshell KNN selection Dissemination

Dissemination: orientation and amplification Orientation: to whom? Exploit: Forward To friends Explore: Forward to random users Amplification: to how many? Increase Fanout (Log(n)) Decrease Fanout (1)

Evaluation User metrics: Recall-Precision System metrics: Number of messages-Redundancy Traces Real trace from a 480 user survey on 1000 news items Delicious and Digg crawls

WhatsUp in action on the survey PrecisionRecallRedundancyMessages Gossip M Cosine-CF k Whatsup k

Privacy matters Obfuscation Does not reveal the exact profile Does not reveal the least sensitive information Randomized dissemination Avoids predictive nature of the dissemination Flips the opinion with a given probability

Obfuscation News item profile Private profile User Profile exchanged during gossip Obfuscated profile I like it Compact profile Filter profile News item profile

Impact of obfuscation Fanout Privacy-unaware WhatsUp WhatsUp

HyRec: a Hybrid Recommender System

Taking the best of both worlds

HyRec: Hybrid architecture Candidate set (k) : k neighbors and their k neighbors + k random nodes Online KNN selection No data stored at the client

Experiments DatasetUsersItemsRatings MovieLens1 (ML1) movies100,000 MovieLens2 (ML2)6, movies1,000,000 MovieLens3 (ML3)69,87810,000 movies10,000,000 Digg59, items782,807 k= 10, offline KNN selection for centralized

Quality of the recommendation (MovieLens)

Cost

HyRec versus the client load Impact of HyRecImpact of the client load

HyRec versus a centralized recommender Impact of the request stress Impact of the profile size

To take away Personalization is crucial (and still in its infancy) Distributed solutions attractive for privacy and scalability

Thank you TRY NOW