Re‐ranking with multiple objective optimization in recommender system
- 15 November 2021
- journal article
- research article
- Published by Wiley in Transactions on Emerging Telecommunications Technologies
- Vol. 33 (1) , e4398
Abstract
The ranking algorithm in the recommender system aims at optimizing accuracy during training so that it pays too much attention to the relevance of the individual and ignores the mutual influence between the items in the list. In response to this problem, we propose dither, a re‐ranking model for the recommender system. We deploy the re‐ranking algorithm as an independent module after the ranking algorithm to achieve the function of decoupling from it. Our model formalizes the re‐ranking problem as a multi‐objective optimization problem. It re‐ranks the initial ranking list by balancing multiple indicators to generate an improved list and updates the list during frequent user interactions with the system. Through a case study on the MovieLens 100 K data set, the workflow, and effects of the dither model are demonstrated. In addition, the re‐ranking algorithm shows the performance advantages of our model over existing methods.Keywords
Funding Information
- National Key Research and Development Program of China (2020YFB1005804)
- National Natural Science Foundation of China (61632009)
- Natural Science Foundation of Guangdong Province (2017A030308006)
This publication has 33 references indexed in Scilit:
- Intent-aware Item-based Collaborative Filtering for Personalised Diversification2018
- Learning a Deep Listwise Context Model for Ranking Refinement2018
- A Personalized Health Recommendation System Based on Smartphone Calendar EventsLecture Notes in Computer Science, 2018
- A Joint Optimization Approach for Personalized Recommendation Diversification2018
- Personalized itinerary recommendation with time constraints using GPS datasetsKnowledge and Information Systems, 2018
- Document-based Recommender System for Job Postings using Dense Representations2018
- User Control and Serendipitous Recommendations in Learning EnvironmentsProcedia Computer Science, 2018
- Max-Sum Diversification, Monotone Submodular Functions, and Dynamic UpdatesACM Transactions on Algorithms, 2017
- The MovieLens DatasetsACM Transactions on Interactive Intelligent Systems, 2015
- Approximation algorithms for maximum dispersionOperations Research Letters, 1997