Cluster Based Deep Contextual Reinforcement Learning for top-k Recommendations
Anubha Kabra, Anu Agarwal, Anil Singh Parihar

TL;DR
This paper introduces a novel top-k recommendation method combining clustering and deep contextual reinforcement learning, improving efficiency and robustness in personalized e-commerce recommendations.
Contribution
It proposes a new ensemble approach using DB Scan clustering with deep reinforcement learning and Duelling Bandit exploration for enhanced recommendation accuracy.
Findings
Significantly increased efficiency over existing methods
Robust user pattern learning through partial and batch updates
Validated effectiveness on a public dataset
Abstract
Rapid advancements in the E-commerce sector over the last few decades have led to an imminent need for personalised, efficient and dynamic recommendation systems. To sufficiently cater to this need, we propose a novel method for generating top-k recommendations by creating an ensemble of clustering with reinforcement learning. We have incorporated DB Scan clustering to tackle vast item space, hence in-creasing the efficiency multi-fold. Moreover, by using deep contextual reinforcement learning, our proposed work leverages the user features to its full potential. With partial updates and batch updates, the model learns user patterns continuously. The Duelling Bandit based exploration provides robust exploration as compared to the state-of-art strategies due to its adaptive nature. Detailed experiments conducted on a public dataset verify our claims about the efficiency of our technique…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Bandit Algorithms Research · Data Stream Mining Techniques
