Paper Session 3: Unbiased and Private

Date: Monday, Aug 28, 2017, 14:00-15:45
Location: Room 1
Chair: Markus Zanker

  • LPSecure Multi-Party Protocols for Item-Based Collaborative Filtering by Erez Shmueli and Tamir Tassa

    Recommender systems have become extremely common in recent years, and are utilized in a variety of domains such as movies, music, news, products, restaurants, etc. While a typical recommender system bases its recommendations solely on users’ preference data collected by the system itself, the quality of recommendations can significantly be improved if several recommender systems (or vendors) share their data. However, such data sharing poses significant privacy and security challenges, both to the vendors and the users. In this paper we propose secure protocols for distributed item-based Collaborative Filtering. Our protocols allow to compute both the predicted ratings of items and their predicted rankings, without compromising privacy nor predictions’ accuracy. Unlike previous solutions in which the secure protocols are executed solely by the vendors, our protocols assume the existence of a mediator that performs intermediate computations on encrypted data supplied by the vendors. Such a mediated setting is advantageous over the non-mediated one since it enables each vendor to communicate solely with the mediator. This yields reduced communication costs and it allows each vendor to issue recommendations to its clients without being dependent on the availability and willingness of the other vendors to collaborate.

  • LPModeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations by Xiaoying Zhang, Junzhou Zhao and John C.S. Lui

    The unbiasedness of online product ratings, an important property to ensure that users’ ratings indeed reflect their true evaluations to products, is vital both in shaping consumer purchase decisions and providing reliable recommendations. Recent experimental studies showed that distortions from historical ratings would ruin the unbiasedness of subsequent ratings. How to “discover” the distortions from historical ratings in each single rating (or at the micro-level), and perform the “de-biasing operations” in real rating systems are the main objectives of this work. Using 42 million real customer ratings, we first show that users either “assimilate” or “contrast” to historical ratings under different scenarios: users conform to historical ratings if historical ratings are not far from the product quality (assimilation), while users deviate from historical ratings if they are significantly different from the product quality (contrast). This phenomenon can be explained by the well-known psychological argument: the “Assimilate-Contrast” theory. However, none of the existing works on modeling historical ratings’ influence have taken this into account, and this motivates us to propose the Historical Influence Aware Latent Factor Model (HIALF), the first model for real rating systems to capture and mitigate historical distortions in each single rating. HIALF also allows us to study the influence patterns of historical ratings from a modeling perspective, and it perfectly matches the assimilation and contrast effects we previously observed. Also, HIALF achieves significant improvements in predicting subsequent ratings, and accurately predicts the relationships revealed in previous empirical measurements on real ratings. Finally, we show that HIALF can contribute to better recommendations by decoupling users’ real preference from distorted ratings, and reveal the intrinsic product quality for wiser consumer purchase decisions.

  • LPFairness-Aware Group Recommendation with Pareto Efficiency by Xiao Lin, Min Zhang, Yongfeng Zhang, Zhaoquan Gu, Yiqun Liu and Shaoping Ma

    Group recommendation has attracted significant research efforts for its importance in benefiting a group of users. This paper investigates the Group Recommendation problem from a novel aspect which tries to maximize the satisfaction of each group member while minimizing the unfairness between them.

    In this work, we present several semantics of the individual utility and propose two concepts of social welfare and fairness for modeling the overall utilities and the balance of group members. We formulate the problem as a multiple objective optimization problem and show its computational complexity (NP-Hardness Analysis) in different semantics. Given the multiple-objective nature of fairness-aware group recommendation problem, we provide an optimization framework for fairness-aware group recommendation from the perspective of Pareto Efficiency. We conduct extensive experiments on real-world datasets (one of which contains real group structures and purchase histories) and evaluate our algorithm with standard accuracy metrics. The results indicate that considering fairness in group recommendation can enhance the recommendation accuracy.

  • SPA Novel Recommender System for Helping Marathoners to Achieve a New Personal-Best by Barry Smyth and Padraig Cunningham

    We describe a novel application of recommender systems, helping marathon runners to run a new personal-best race-time, by predicting a challenging, but achievable, target-time and by recommending a race-plan to achieve this time that is tailored to their ability and the course. A comprehensive evaluation of prediction accuracy and race-plan quality is provided using a large-scale dataset with almost 400,000 runners from the last 12 years of the Chicago marathon.

Back to Program

Diamond Supporter
 
Platinum Supporters
 
 
 
 
Gold Supporter
 
Silver Supporter
 
Special Supporters