Adaptive bootstrapping of recommender systems using decision trees

Citations Over TimeTop 1% of 2011 papers

Abstract

Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more acute considering that some of these hard to profile new users judge the unfamiliar system by its ability to immediately provide them with satisfying recommendations, and may quickly abandon the system when disappointed. Rapid profiling of new users by a recommender system is often achieved through a bootstrapping process - a kind of an initial interview - that elicits users to provide their opinions on certain carefully chosen items or categories. The elicitation process becomes particularly effective when adapted to users' responses, making best use of users' time by dynamically modifying the questions to improve the evolving profile. In particular, we advocate a specialized version of decision trees as the most appropriate tool for this task. We detail an efficient tree learning algorithm, specifically tailored to the unique properties of the problem. Several extensions to the tree construction are also introduced, which enhance the efficiency and utility of the method. We implemented our methods within a movie recommendation service. The experimental study delivered encouraging results, with the tree-based bootstrapping process significantly outperforming previous approaches.

Related Papers

• → A Comparison of PLS and ML Bootstrapping Techniques in SEM: A Monte Carlo Study(2013)59 cited
• → Sufficient bootstrapping(2010)16 cited
• → A Bootstrap Estimate of the Predictive Distribution of Outstanding Claims for the Schnieper Model(2009)5 cited
• → Self-adjusting Bootstrapping(2011)
• → COMPARISON OF CONVENTIONAL, BALANCED AND SUFFICIENT BOOTSTRAPPING APPROACHES VIA CONFIDENCE INTERVALS AND EFFICIENCY(2020)