Viral marketing is the modern version of the old 'word-of-mouth' advertising, where companies choose a restricted number of persons, considered 'influential,' recommending them products or services that will be in turn iteratively suggested. In this article, we propose cognitive models and algorithms for marketing applications through online social networks, considered as a graph database, and define the concept of influence graph leveraging particular user behavioral patterns, by querying the initial heterogeneous graph network. We also model the diffusion across the network, without any preliminary information, as a combinatorial multiarmed bandit problem, for the selection of most influential users. We have used the YELP social network as a case study for our approach, showing how it is possible to generate an influence graph considering several kinds of relevant paths (mainly considering reviews to the same firms) by which a user can influence other ones. Several experiments have been carried out and discussed, putting into evidence the effectiveness and efficacy of the proposed methods for influence maximization with respect to other approaches of state of the art.
Cognitive Analysis in Social Networks for Viral Marketing
Castiglione A.;Cozzolino G.;Moscato F.;
2021-01-01
Abstract
Viral marketing is the modern version of the old 'word-of-mouth' advertising, where companies choose a restricted number of persons, considered 'influential,' recommending them products or services that will be in turn iteratively suggested. In this article, we propose cognitive models and algorithms for marketing applications through online social networks, considered as a graph database, and define the concept of influence graph leveraging particular user behavioral patterns, by querying the initial heterogeneous graph network. We also model the diffusion across the network, without any preliminary information, as a combinatorial multiarmed bandit problem, for the selection of most influential users. We have used the YELP social network as a case study for our approach, showing how it is possible to generate an influence graph considering several kinds of relevant paths (mainly considering reviews to the same firms) by which a user can influence other ones. Several experiments have been carried out and discussed, putting into evidence the effectiveness and efficacy of the proposed methods for influence maximization with respect to other approaches of state of the art.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.