Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Exploration in recommender systems
Chen M.  RecSys 2021 Amsterdam, the Netherlands, Sep 27-Oct 1, 2021)551-553.2021.Type:Proceedings
Date Reviewed: Jul 10 2023

Classic arbitration between exploration and exploitation could overestimate the optimal recommendation based on “learning by experience” [1] and relying on the measurement of user exploration through four essential parameters: accuracy, diversity, novelty, and serendipity. Thus, the author of this paper aims to increase reflection on the choices of online users through the uncertainty of multi-angle predictive factors [2]. Thompson sampling (TS), upper confidence bound (UCB), and other personalized ranking methods are certainly counting-based techniques that lead to results in the classical multi-armed bandit framework [3].

This paper extends previous work on entropy regularization with the goal of increasing the performance of recommender systems (RS) metrics. It explores bandit strategy techniques and focuses on stochastic planning for high-quality recommendations that will grab users’ attention even offline. Offline analytics are described as essential for tangling a web of inferences from the four above-mentioned parameters, taking into account the feedback loop and the eventual delay with which users evaluate their online experience [4].

“Exploration involves activities such as search, variation, risk taking, experimentation, discovery, and innovation. Exploitation involves activities such as refinement, efficiency, selection, implementation, and execution” [5]. Instead, Chen’s RS promise of a multi-angle utility function implemented through an “industrial recommendation platform serving billions of users,” including the use of feedback data on experience, can be vividly estimated. Thus a balance between continuity and change is the new metric that the author intends to introduce: either a loophole in preference confirmation to remove alternative routes that are not on track to receive recommendations, or better to convert the similarities related to short-, medium-, and long-term personalization of the recommendations themselves into something desirable.

Reviewer:  Romina Fucà Review #: CR147612 (2309-0122)
1) Parapar, J.; Radlinski, F. Towards unified metrics for accuracy and diversity for recommender systems. In RecSys 2021, 75 – 84. https://doi.org/10.1145/3460231.3474234..
2) Marlin, B. M.; Zemel, R. S.; Roweis, S. T.; Slaney, M. Recommender systems: missing data and statistical model estimation. In IJCAI International Joint Conference On Artificial Intelligence (2011), 2686 – 2691. http://www.cs.toronto.edu/~zemel/documents/2011-IJCAI-MZRS.pdf.
3) Wang, S.; Zhu, J. Thompson sampling for (combinatorial) pure exploration. In Proc. of the 39th International Conference on Machine Learning, PMLR 162: 23470-23483.
4) Ziarani, R. J.; Ravanmehr, R. Serendipity in recommender systems: a systematic literature. Journal of Computer Science and Technology 36, (2021), 375–396.https://doi.org/10.1007/s11390-020-0135-9.
5) Sinha, S. The exploration–exploitation dilemma: a review in the context of managing growth of new ventures. Vikalpa 40, 3(2015), 313–323.https://doi.org/10.1177/0256090915599709.
Bookmark and Share
  Featured Reviewer  
 
General (H.0 )
 
 
Deduction And Theorem Proving (I.2.3 )
 
 
Models Of Computation (F.1.1 )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Introduction to database and knowledge-base systems
Krishna S., World Scientific Publishing Co., Inc., River Edge, NJ, 1992. Type: Book (9789810206192)
Nov 1 1993
An introduction to information science
Flynn R., Marcel Dekker, Inc., New York, NY, 1987. Type: Book (9789780824775087)
Apr 1 1988
Acta Informatica 19, 4 (Sept. 1983)
  Acta Informatica 44:1983. Type: Journal
Mar 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy