English
Related papers

Related papers: When Social Influence Meets Item Inference

200 papers

In this paper, we present an algorithmic study on how to surpass competitors in popularity by strategic promotions in social networks. We first propose a novel model, in which we integrate the Preferential Attachment (PA) model for…

Social and Information Networks · Computer Science 2024-09-18 Hao Liao , Sheng Bi , Jiao Wu , Wei Zhang , Mingyang Zhou , Rui Mao , Wei Chen

Social networks represent nowadays in many contexts the main source of information transmission and the way opinions and actions are influenced. For instance, generic advertisements are way less powerful than suggestions from our contacts.…

Neural and Evolutionary Computing · Computer Science 2021-05-03 Kateryna Konotopska , Giovanni Iacca

Online social systems have become important platforms for viral marketing where the advertising of products is carried out with the communication of users. After adopting the product, the seed buyers may spread the information to their…

Social and Information Networks · Computer Science 2018-12-14 Guangmo Tong , Weili Wu , Ding-Zhu Du

Given a social network of users with selection cost, the \textsc{Budgeted Influence Maximization Problem} (\emph{BIM Problem} in short) asks for selecting a subset of the nodes (known as \emph{seed nodes}) within an allocated budget for…

Social and Information Networks · Computer Science 2021-04-15 Suman Banerjee

The well-known influence maximization problem aims at maximizing the influence of one information cascade in a social network by selecting appropriate seed users prior to the diffusion process. In its adaptive version, additional seed users…

Social and Information Networks · Computer Science 2020-03-30 Guangmo Tong , Ruiqi Wang , Zheng Dong , Xiang Li

Influence maximization (IM) is the problem of finding a seed vertex set which is expected to incur the maximum influence spread on a graph. It has various applications in practice such as devising an effective and efficient approach to…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-10 Gokhan Gokturk , Kamer Kaya

We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other competing campaigns, so as to maximize a voting-based score for…

Social and Information Networks · Computer Science 2022-09-15 Arkaprava Saha , Xiangyu Ke , Arijit Khan , Laks V. S. Lakshmanan

We incorporate self activation into influence propagation and propose the self-activation independent cascade (SAIC) model: nodes may be self activated besides being selected as seeds, and influence propagates from both selected seeds and…

Social and Information Networks · Computer Science 2020-03-13 Lichao Sun , Albert Chen , Philip S. Yu , Wei Chen

We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of "seed" users to expose the product to. While prior work assumes a known…

Machine Learning · Computer Science 2018-05-25 Sharan Vaswani , Branislav Kveton , Zheng Wen , Mohammad Ghavamzadeh , Laks Lakshmanan , Mark Schmidt

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

Social and Information Networks · Computer Science 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

In a "tipping" model, each node in a social network, representing an individual, adopts a behavior if a certain number of his incoming neighbors previously held that property. A key problem for viral marketers is to determine an initial…

Social and Information Networks · Computer Science 2015-03-20 Paulo Shakarian , Damon Paulo

Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A…

Computer Science and Game Theory · Computer Science 2015-03-18 Mayur Mohite , Y. Narahari

The information flows among the people while they communicate through social media websites. Due to the dependency on digital media, a person shares important information or regular updates with friends and family. The set of persons on…

Social and Information Networks · Computer Science 2024-06-14 Rahul Kumar Gautam , Anjeneya Swami Kare , Durga Bhavani S

The typical algorithmic problem in viral marketing aims to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network and trigger a large cascade of adoptions.…

Machine Learning · Computer Science 2014-04-17 Nan Du , Yingyu Liang , Maria Florina Balcan , Le Song

Given the popularity of the viral marketing campaign in online social networks, finding an effective method to identify a set of most influential nodes so to compete well with other viral marketing competitors is of upmost importance. We…

Social and Information Networks · Computer Science 2014-11-03 Yishi Lin , John C. S. Lui

Influence maximization (IM) aims to identify a small number of influential individuals to maximize the information spread and finds applications in various fields. It was first introduced in the context of viral marketing, where a company…

Social and Information Networks · Computer Science 2023-06-06 Shiqi Zhang , Yiqian Huang , Jiachen Sun , Wenqing Lin , Xiaokui Xiao , Bo Tang

How would admissions look like in a university program for influencers? In the realm of social network analysis, influence maximization and link prediction stand out as pivotal challenges. Influence maximization focuses on identifying a set…

Social and Information Networks · Computer Science 2025-07-08 Marina Lin , Laura P. Schaposnik , Raina Wu

A typical viral marketing model identifies influential users in a social network to maximize a single product adoption assuming unlimited user attention, campaign budgets, and time. In reality, multiple products need campaigns, users have…

Social and Information Networks · Computer Science 2017-01-31 Nan Du , Yingyu Liang , Maria-Florina Balcan , Manuel Gomez-Rodriguez , Hongyuan Zha , Le Song

We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to. Most prior work on this topic…

Social and Information Networks · Computer Science 2016-04-28 Sharan Vaswani , Laks. V. S. Lakshmanan , Mark Schmidt

In this paper, we investigate the discount allocation problem in social networks. It has been reported that 40\% of consumers will share an email offer with their friend and 28\% of consumers will share deals via social media platforms.…

Social and Information Networks · Computer Science 2016-06-28 Shaojie Tang , Jing Yuan