A probabilistic model to resolve diversity-accuracy challenge of recommendation systems

Recommendation systems have wide-spread applications in both academia and industry. Traditionally, performance of recommendation systems has been measured by their precision. By introducing novelty and diversity as key qualities in recommender systems, recently increasing attention has been focused on this topic. Precision and novelty of recommendation are not in the same direction, and practical systems should make a trade-off between these two quantities. Thus, it is an important feature of a recommender system to make it possible to adjust diversity and accuracy of the recommendations by tuning the model. In this paper, we introduce a probabilistic structure to resolve the diversity-accuracy dilemma in recommender systems. We propose a hybrid model with adjustable level of diversity and precision such that one can perform this by tuning a single parameter. The proposed recommendation model consists of two models: one for maximization of the accuracy and the other one for specification of the recommendation list to tastes of users. Our experiments on two real datasets show the functionality of the model in resolving accuracy-diversity dilemma and outperformance of the model over other classic models. The proposed method could be extensively applied to real commercial systems due to its low computational complexity and significant performance.Comment: 19 pages, 5 figure

Sequential Design for Ranking Response Surfaces

We propose and analyze sequential design methods for the problem of ranking several response surfaces. Namely, given $L \ge 2$ response surfaces over a continuous input space $\cal X$, the aim is to efficiently find the index of the minimal response across the entire $\cal X$. The response surfaces are not known and have to be noisily sampled one-at-a-time. This setting is motivated by stochastic control applications and requires joint experimental design both in space and response-index dimensions. To generate sequential design heuristics we investigate stepwise uncertainty reduction approaches, as well as sampling based on posterior classification complexity. We also make connections between our continuous-input formulation and the discrete framework of pure regret in multi-armed bandits. To model the response surfaces we utilize kriging surrogates. Several numerical examples using both synthetic data and an epidemics control problem are provided to illustrate our approach and the efficacy of respective adaptive designs.Comment: 26 pages, 7 figures (updated several sections and figures

A novel algorithm for dynamic student profile adaptation based on learning styles

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.E-learning recommendation systems are used to enhance student performance and knowledge by providing tailor- made services based on the students’ preferences and learning styles, which are typically stored in student profiles. For such systems to remain effective, the profiles need to be able to adapt and reflect the students’ changing behaviour. In this paper, we introduce new algorithms that are designed to track student learning behaviour patterns, capture their learning styles, and maintain dynamic student profiles within a recommendation system (RS). This paper also proposes a new method to extract features that characterise student behaviour to identify students’ learning styles with respect to the Felder-Silverman learning style model (FSLSM). In order to test the efficiency of the proposed algorithm, we present a series of experiments that use a dataset of real students to demonstrate how our proposed algorithm can effectively model a dynamic student profile and adapt to different student learning behaviour. The results revealed that the students could effectively increase their learning efficiency and quality for the courses when the learning styles are identified, and proper recommendations are made by using our method