scholarly journals Viral Marketing for Smart Cities: Influencers in Social Network Communities

Author(s):  
Madhura Kaple ◽  
Ketki Kulkarni ◽  
Katerina Potika
2018 ◽  
Vol 16 (3) ◽  
pp. 275
Author(s):  
Emir Ugljanin ◽  
Dragan Stojanović ◽  
Ejub Kajan ◽  
Zakaria Maamar

This paper reports our experience with developing a Business-2-Social (B2S) platform that provides necessary support to all this platform’s constituents, namely business processes, social media (e.g., social network), and Internet of Things (IoT). This platform is exemplified with smart cities whose successful management requires a complete integration of IoT and social media capabilities into the business processes implementing user services. To ensure a successful integration, social actions, that a smart city would allow citizens execute, are analyzed in terms of impact of these smart city’s business processes. Reactions to these actions are tracked and then analyzed to improve user services.


Author(s):  
Pilar Ibáñez-Cubillas ◽  
Fernanda Nogueira ◽  
María-Jesús Gallego-Arrufat

Author(s):  
Dmitry Luchaninov ◽  
Ruslan Bazhenov ◽  
Tatiana Gorbunova ◽  
Saida Beknazarova ◽  
Lidiya Putkina ◽  
...  

2019 ◽  
Vol 11 (4) ◽  
pp. 95
Author(s):  
Wang ◽  
Zhu ◽  
Liu ◽  
Wang

Social networks have attracted a lot of attention as novel information or advertisement diffusion media for viral marketing. Influence maximization describes the problem of finding a small subset of seed nodes in a social network that could maximize the spread of influence. A lot of algorithms have been proposed to solve this problem. Recently, in order to achieve more realistic viral marketing scenarios, some constrained versions of influence maximization, which consider time constraints, budget constraints and so on, have been proposed. However, none of them considers the memory effect and the social reinforcement effect, which are ubiquitous properties of social networks. In this paper, we define a new constrained version of the influence maximization problem that captures the social reinforcement and memory effects. We first propose a novel propagation model to capture the dynamics of the memory and social reinforcement effects. Then, we modify two baseline algorithms and design a new algorithm to solve the problem under the model. Experiments show that our algorithm achieves the best performance with relatively low time complexity. We also demonstrate that the new version captures some important properties of viral marketing in social networks, such as such as social reinforcements, and could explain some phenomena that cannot be explained by existing influence maximization problem definitions.


Sign in / Sign up

Export Citation Format

Share Document