We consider the basic problem in recommender systems that consists in identifying a set of users to whom a given item is to be recommended. In practice recommender systems are run against huge sets of users, and the problem is then to avoid scanning the whole user set in order to produce the recommendation list. In order to cope with problem, we consider that users are connected through a complex network and that a taxonomy over the items has been defined. These two kinds of information, respectively called social and semantic information, are combined in our approach in order to compute recommendation lists by visiting a limited part of the complex network. In doing so, our contribution is to propose recommendation algorithms that outperform existing approaches, while producing recommendation lists of similar accuracy.

In our experiments, we use two real data sets to test our algorithms, namely Amazon.com and Movie- Lens data sets, and we compare our algorithms with the standard item-based collaborative filtering and hybrid recommendation algorithms. Our results show a satisfying accuracy values and a very significant improvement of performance, by exploring a small part of the graph instead of exploring all the graph as the classical searching methods do.

(paper)