Nowadays, one important issue for companies is the efficient dealing of the big data prob- lem , 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-offsolution between accuracy and costs could be to de- fine a maximum number of different flyers addressing different groups of users interested in their content. In order to systematically support this and similar trade-offsolutions, 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 pro- vide 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 man- age 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.

Investigating the role of the rating prediction task in granularity-based group recommender systems and big data scenarios

BORATTO, LUDOVICO;CARTA, SALVATORE MARIO;FENU, GIANNI
2017-01-01

Abstract

Nowadays, one important issue for companies is the efficient dealing of the big data prob- lem , 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-offsolution between accuracy and costs could be to de- fine a maximum number of different flyers addressing different groups of users interested in their content. In order to systematically support this and similar trade-offsolutions, 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 pro- vide 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 man- age 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.
2017
Group recommendation, Clustering, Rating prediction, Big data
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0020025516305424-main.pdf

Solo gestori archivio

Tipologia: versione editoriale (VoR)
Dimensione 1.99 MB
Formato Adobe PDF
1.99 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/218855
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 20
social impact