Finding Someone You Will Like and Who Won’t Reject You
This paper explores ways to address the problem of the high cost problem of poor recommendations in reciprocal recommender systems. These systems recommend one person to another and require that both people like each other for the recommendation to be successful. A notable example, and the focus of our experiments is online dating. In such domains, poor recommendations should be avoided as they cause users to suffer repeated rejection and abandon the site. This paper describes our experiments to create a recommender based on two classes of models: one to predict who each user will like; the other to predict who each user will dislike. We then combine these models to generate recommendations for the user. This work is novel in exploring modelling both people’s likes and dislikes and how to combine these to support a reciprocal recommendation, which is important for many domains, including online dating, employment, mentor-mentee matching and help-helper matching. Using a negative and a positive preference model in a combined manner, we improved the success rate of reciprocal recommendations by 18% while, at the same time, reducing the failure rate by 36% for the top-1 recommendations in comparison to using the positive model of preference alone.
Unable to display preview. Download preview PDF.
- 1.Akehurst, J., Koprinska, I., Yacef, K., Pizzato, L., Kay, J., Rej, T.: CCR - A Content-Collaborative Reciprocal Recommender for Online Dating. In: Proc. of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), Barcelona (2011)Google Scholar
- 2.Broovsk, L., Petek, V.: Recommender system for online dating service. CoRR abs/cs/0703042 (2007)Google Scholar
- 5.Diaz, F., Metzler, D., Amer-Yahia, S.: Relevance and ranking in online dating systems. In: SIGIR 2010: Proc. of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 66–73. ACM, New York (2010)Google Scholar
- 6.Joachims, T., Granka, L., Pan, B., Hembrooke, H., Gay, G.: Accurately interpreting clickthrough data as implicit feedback. In: Proc. of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2005, pp. 154–161. ACM, New York (2005)Google Scholar
- 7.Kim, Y., Mahidadia, A., Compton, P., Cai, X., Bain, M., Krzywicki, A., Wobcke, W.: People recommendation based on aggregated bidirectional intentions in social network site. In: Kang, B.-H., Richards, D. (eds.) PKAW 2010. LNCS, vol. 6232, pp. 247–260. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 8.McFee, B., Lanckriet, G.: Metric learning to rank. In: Proc. of the 27th International Conference on Machine Learning (ICML 2010) (June 2010)Google Scholar
- 9.Pizzato, L., Rej, T., Chung, T., Koprinska, I., Kay, J.: Recon: a reciprocal recommender for online dating. In: RecSys 2010: Proc. of the Fourth ACM Conference on Recommender Systems, pp. 207–214. ACM, New York (2010)Google Scholar