Research On Multi-Domain Recommendation Systems Based on The Thompson Sampling Algorithm
DOI:
https://doi.org/10.54097/srenf095Keywords:
Thompson Sampling, Recommendation System, Muti-domain Applications, Explore-Utilize Balance.Abstract
In today's information-rich environment, recommendation systems play a pivotal role in helping users efficiently navigate vast amounts of data, with applications spanning online platforms, e-commerce, streaming services, and digital advertising. Among various algorithms, Thompson Sampling (TS) stands out for its ability to balance exploring new options with leveraging known preferences, thereby preventing recommendation stagnation and adapting to shifts in user interests. This paper investigates TS within the context of advertising and movie recommendations, exploring its Bayesian probabilistic foundation, uncertainty modeling, practical integration within recommendation architectures, handling of large-scale data streams, and real-time feedback mechanisms. Performance is evaluated through metrics including accuracy, user engagement, click-through rates, and conversion rates, with comparisons against ETC and UCB algorithms. Results demonstrate that TS enhances recommendation accuracy, user satisfaction, and system revenue, establishing its position as a valuable and versatile tool for improving modern recommendation systems. Furthermore, the study provides insights into practical deployment strategies for real-world applications.
Downloads
References
[1] Russo, D. J., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018). A tutorial on Thompson Sampling. Foundations and Trends in Machine Learning, 11(1), 1-96.
[2] Russo, D. J., et al. (2018). A tutorial on Thompson Sampling. Foundations and Trends in Machine Learning, 11(1), 1–96
[3] Kay, R. (2006). Intuitive Probability and Random Processes Using MATLAB. Springer.
[4] Agrawal, S., & Goyal, N. (2012). Analysis of Thompson Sampling for the multi-armed bandit problem. Conference on Learning Theory, 39–110.
[5] Thompson, W. R. (1933). On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3/4), 285–294.
[6] Bubeck, S., & Cesa-Bianchi, N. (2012). Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning, 5(1), 1–122.
[7] Russo, D. J., Van Roy, B., Kazerouni, A., Osband, I., & Wen, Z. (2018). A Tutorial on Thompson Sampling. Foundations and Trends® in Machine Learning, 11(1), 1-96.
[8] Chapelle, O., & Li, L. (2011). An Empirical Evaluation of Thompson Sampling. Advances in Neural Information Processing Systems (NeurIPS), 24, 2249-2257.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Academic Journal of Science and Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.








