Name
Title | ||
|---|---|---|
Investigating the role of the rating prediction task in granularity-based group recommender systems and big data scenarios. |
Abstract | ||
|---|---|---|
Nowadays, one important issue for companies is the efficient dealing of the big data problem, which means that their business intelligence has to manage huge amounts of data. An interesting case in point is flyers distribution. Research and market figures prove that the distribution of advertising flyers still represents a valuable tool to attract potential customers to a company. It goes without saying that including personalized content in a company's flyer is more likely to yield better results than offering the same flyer to all potential clients. However, producing personalized flyers would imply unaffordable costs for a company. An efficient trade-off solution between accuracy and costs could be to define a maximum number of different flyers addressing different groups of users interested in their content. In order to systematically support this and similar trade-off solutions, we propose a novel type of group recommendations, which is able to detect a number of groups of end-users equal to the number of recommendation lists (e.g., flyers) that can be produced (i.e., the granularity with which the system can operate). Moreover, it can provide suggestions to the detected specific groups of users. In particular, we focus on the rating prediction for those items users do not evaluate. Indeed, rating prediction represents the main task that a recommender system is asked to perform and it becomes even more central if included into a group recommender system, since the predictions might be built for each user or for each group. Our approach also gives the possibility to efficiently manage the curse of the dimensionality phenomena caused by the sparsity of the ratings arising from big data handling. We present four granularity-based group recommender systems using different rating prediction algorithms and architectures. These systems employ the same algorithms to carry out other tasks (i.e., those that do not predict the ratings) and this allows us to evaluate which rating prediction approach is the most effective in terms of accuracy. Experiments on two real-world datasets show that, unlike group predictions, single user predictions can lead to improvements in the recommendation accuracy and the dealing of the curse of the dimensionality phenomena. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ins.2016.07.060 | Inf. Sci. |
Keywords | Field | DocType |
Group recommendation,Clustering,Rating prediction,Big data | Recommender system,Curse of dimensionality,Prediction algorithms,Artificial intelligence,Granularity,Cluster analysis,Business intelligence,Big data,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
378 | C | 0020-0255 |
Citations | PageRank | References |
4 | 0.38 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ludovico Boratto | 1 | 163 | 30.91 |
| Salvatore Carta | 2 | 579 | 47.28 |
| Gianni Fenu | 3 | 92 | 27.81 |