Abstract
Today, in web space, where content is constantly expanding, recommendation systems that enable users to explore information passively have become essential technologies, and their accuracy is significantly improving. However, recent studies have focused not only on enhancing recommendation accuracy by suggesting items that match user preferences but also on increasing the appeal of recommendation systems by offering unexpected discoveries and recommendations that exceed expectations. Studies have been conducted to achieve serendipity, recommendations that are both beneficial to the user and marked by novelty and surprise. However, existing systems alter the embedding space compromising this flexibility. In this study, we propose a recommendation method called mutual proximity collaborative metric learning, which improves serendipity for users in an embedding-based recommendation method called collaborative metric learning. The proposed method improves existing techniques by refining the embedding space search algorithm, reducing the bias toward popular items in recommendations without altering the original embedding space, thereby enabling users to achieve serendipity. Furthermore, experimental results demonstrate that our approach outperforms existing methods across various evaluation metrics, such as unpopularity and serendipity. Our approach can thus achieve serendipity and preserve the applicability of the embedding space to diverse tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Adamopoulos, P., Tuzhilin, A.: On unexpectedness in recommender systems: or how to better expect the unexpected. ACM Trans. Intell. Syst. Technol. 5(4) (2014). https://doi.org/10.1145/2559952
Anderson, C.: The long tail: why the future of business is selling less of more. Hyperion (2008). https://cir.nii.ac.jp/crid/1130000794762659200
Cai, R., Zhang, C., Zhang, L., Ma, W.Y.: Scalable music recommendation by search, pp. 1065–1074 (2007). https://doi.org/10.1145/1291233.1291466
Casey, M., Rhodes, C., Slaney, M.: Analysis of minimum distances in high-dimensional musical spaces. IEEE Trans. Audio Speech Lang. Process. 16(5), 1015–1028 (2008). https://doi.org/10.1109/TASL.2008.925883
Celma, Ò., Cano, P.: From hits to niches?: or how popular artists can bias music recommendation and discovery. In: NETFLIX 2008 (2008). https://api.semanticscholar.org/CorpusID:6701551
Celma Herrada, Ò.: Music recommendation and discovery in the long tail. Ph.D. thesis, Universitat Pompeu Fabra (2009)
Flexer, A., Stevens, J.: Mutual proximity graphs for improved reachability in music recommendation. J. New Music Res. 47(1), 17–28 (2018). https://doi.org/10.1080/09298215.2017.1354891. pMID: 29348779
Ge, M., Delgado-Battenfeld, C., Jannach, D.: Beyond accuracy: evaluating recommender systems by coverage and serendipity. In: Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys 2010, pp. 257–260. Association for Computing Machinery, New York (2010). https://doi.org/10.1145/1864708.1864761
Ge, Y., et al.: Explainable fairness in recommendation. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2022. ACM (2022). https://doi.org/10.1145/3477495.3531973
Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5(4) (2015). https://doi.org/10.1145/2827872
Hsieh, C.K., Yang, L., Cui, Y., Lin, T.Y., Belongie, S., Estrin, D.: Collaborative metric learning. In: Proceedings of the 26th International Conference on World Wide Web, WWW 2017, pp. 193–201. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva (2017). https://doi.org/10.1145/3038912.3052639
Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 263–272 (2008). https://doi.org/10.1109/ICDM.2008.22
Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization (2017)
Knees, P., Schnitzer, D., Flexer, A.: Improving neighborhood-based collaborative filtering by reducing hubness. In: Proceedings of International Conference on Multimedia Retrieval, ICMR 2014, pp. 161–168. Association for Computing Machinery, New York (2014). https://doi.org/10.1145/2578726.2578747
Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009). https://doi.org/10.1109/MC.2009.263
Kotkov, D., Wang, S., Veijalainen, J.: A survey of serendipity in recommender systems. Knowl.-Based Syst. 111, 180–192 (2016). https://doi.org/10.1016/j.knosys.2016.08.014. https://www.sciencedirect.com/science/article/pii/S0950705116302763
Murakami, T., Mori, K., Orihara, R.: Metrics for evaluating the serendipity of recommendation lists. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 40–46. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78197-4_5
Park, C., Kim, D., Xie, X., Yu, H.: Collaborative translational metric learning. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 367–376 (2018). https://doi.org/10.1109/ICDM.2018.00052
Radovanović, M., Nanopoulos, A., Ivanović, M.: Hubs in space: popular nearest neighbors in high-dimensional data. J. Mach. Learn. Res. 11(86), 2487–2531 (2010). http://jmlr.org/papers/v11/radovanovic10a.html
Rendle, S.: Factorization machines. In: 2010 IEEE International Conference on Data Mining, pp. 995–1000 (2010). https://doi.org/10.1109/ICDM.2010.127
Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. CoRR abs/1205.2618 (2012). http://arxiv.org/abs/1205.2618
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., Riedl, J.: GroupLens: an open architecture for collaborative filtering of netnews. In: Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, CSCW 1994, pp. 175–186. Association for Computing Machinery, New York (1994). https://doi.org/10.1145/192844.192905
Ryo, M.: Pytorchcml (2021). https://github.com/hand10ryo/PyTorchCML
Vargas, S., Castells, P.: Rank and relevance in novelty and diversity metrics for recommender systems. In: Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys 2011, pp. 109–116. Association for Computing Machinery, New York (2011). https://doi.org/10.1145/2043932.2043955
Weinberger, K.Q., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. J. Mach. Learn. Res. 10, 207–244 (2009)
Weston, J., Bengio, S., Usunier, N.: Large scale image annotation: learning to rank with joint word-image embeddings. Mach. Learn. 81, 21–35 (2010). https://doi.org/10.1007/s10994-010-5198-3
Yoneda, A., Matsunae, R., Yamashita, H., Goto, M.: A method to improve serendipity of recommendation lists based on collaborative metric learning. Total Qual. Sci. 9(2), 62–73 (2023). https://doi.org/10.17929/tqs.9.62
Zhou, X., Liu, D., Lian, J., Xie, X.: Collaborative metric learning with memory network for multi-relational recommender systems. CoRR abs/1906.09882 (2019). http://arxiv.org/abs/1906.09882
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nakashima, T., Chen, H., Furuse, K. (2024). Improving Serendipity for Collaborative Metric Learning Based on Mutual Proximity. In: Wrembel, R., Chiusano, S., Kotsis, G., Tjoa, A.M., Khalil, I. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2024. Lecture Notes in Computer Science, vol 14912. Springer, Cham. https://doi.org/10.1007/978-3-031-68323-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-68323-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-68322-0
Online ISBN: 978-3-031-68323-7
eBook Packages: Computer ScienceComputer Science (R0)