title: Aggregated recommendation through random forests.
abstract: Aggregated recommendation refers to the process of suggesting one kind of items to a group of users. Compared to user-oriented or item-oriented approaches, it is more general and, therefore, more appropriate for cold-start recommendation. In this paper, we propose a random forest approach to create aggregated recommender systems. The approach is used to predict the rating of a group of users to a kind of items. In the preprocessing stage, we merge user, item, and rating information to construct an aggregated decision table, where rating information serves as the decision attribute. We also model the data conversion process corresponding to the new user, new item, and both new problems. In the training stage, a forest is built for the aggregated training set, where each leaf is assigned a distribution of discrete rating. In the testing stage, we present four predicting approaches to compute evaluation values based on the distribution of each tree. Experiments results on the well-known MovieLens dataset show that the aggregated approach maintains an acceptable level of accuracy.
authors.affiliation: School of Computer Science, Southwest Petroleum University, Chengdu 610500, China.
authors.forename: Heng-Ru
authors.identifier: 0000-0001-9187-9847
authors.initials: HR
authors.lastname: Zhang
authors.affiliation: School of Computer Science, Southwest Petroleum University, Chengdu 610500, China.
authors.forename: Fan
authors.identifier: 0000-0002-3290-1036
authors.initials: F
authors.lastname: Min
authors.affiliation: School of Computer Science, Southwest Petroleum University, Chengdu 610500, China ; Lab of Granular Computing, Minnan Normal University, Zhangzhou 363000, China.
authors.forename: Xu
authors.identifier: 0000-0002-7507-8625
authors.initials: X
authors.lastname: He
mesh_terms: D055641:Mathematical Concepts