225 citations · 964 across the 37 of their papers we have counts for
25 papers · 1 filter
Profit Maximization in Social Networks and Non-monotone DR-submodular Maximization
Shuyang Gu, Chuangen Gao, Jun Huang +1
In this paper, we study the non-monotone DR-submodular function maximization over integer lattice. Functions over integer lattice have been defined submodular property that is simi…
A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization
Yandi Li, Haobo Gao, Yunxuan Gao +2
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely used in mobile networks, social computing, and recommendation systems. It aims at…
ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning
Tiantian Chen, Siwen Yan, Jianxiong Guo +1
Aiming at selecting a small subset of nodes with maximum influence on networks, the Influence Maximization (IM) problem has been extensively studied. Since it is #P-hard to compute…
Composite Community-Aware Diversified Influence Maximization with Efficient Approximation
Jianxiong Guo, Qiufen Ni, Weili Wu +1
Influence Maximization (IM) is a famous topic in mobile networks and social computing, which aims at finding a small subset of users to maximize the influence spread through online…
A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks
Tiantian Chen, Bin Liu, Wenjing Liu +3
Online social networks have been one of the most effective platforms for marketing and advertising. Through "word of mouth" effects, information or product adoption could spread fr…
Schemes of Propagation Models and Source Estimators for Rumor Source Detection in Online Social Networks: A Short Survey of a Decade of Research
Rong Jin, Weili Wu
Recent years have seen various rumor diffusion models being assumed in detection of rumor source research of the online social network. Diffusion model is arguably considered as a…
Overall Evaluations on Benefits of Influence When Disturbed by Rivals
Jianxiong Guo, Yapu Zhang, Weili Wu
Influence maximization (IM) is a representative and classic problem that has been studied extensively before. The most important application derived from the IM problem is viral ma…
Adaptive Multi-Feature Budgeted Profit Maximization in Social Networks
Tiantian Chen, Jianxiong Guo, Weili Wu
Online social network has been one of the most important platforms for viral marketing. Most of existing researches about diffusion of adoptions of new products on networks are abo…
Adaptive Influence Maximization: If Influential Node Unwilling to Be the Seed
Jianxiong Guo, Weili Wu
Influence maximization problem attempts to find a small subset of nodes that makes the expected influence spread maximized, which has been researched intensively before. They all a…
Continuous Profit Maximization: A Study of Unconstrained Dr-submodular Maximization
Jianxiong Guo, Weili Wu
Profit maximization (PM) is to select a subset of users as seeds for viral marketing in online social networks, which balances between the cost and the profit from influence spread…
A k-hop Collaborate Game Model: Extended to Community Budgets and Adaptive Non-Submodularity
Jianxiong Guo, Weili Wu
Revenue maximization (RM) is one of the most important problems on online social networks (OSNs), which attempts to find a small subset of users in OSNs that makes the expected rev…
Continuous Activity Maximization in Online Social Networks
Jianxiong Guo, Tiantian Chen, Weili Wu
Activity maximization is a task of seeking a small subset of users in a given social network that makes the expected total activity benefit maximized. This is a generalization of m…
Influence-based Community Partition with Sandwich Method for Social Networks
Qiufen Ni, Jianxiong Guo, Chuanhe Huang +1
Community partition is an important problem in many areas such as biology network, social network. The objective of this problem is to analyse the relationships among data via the…
Continuous Influence-based Community Partition for Social Networks
Qiufen Ni, Jianxiong Guo, Weili Wu +1
Community partition is of great importance in social networks because of the rapid increasing network scale, data and applications. We consider the community partition problem unde…
A Multi-Feature Diffusion Model: Rumor Blocking in Social Networks
Jianxiong Guo, Tiantian Chen, Weili Wu
Online social networks provide a convenient platform for the spread of rumors, which could lead to serious aftermaths such as economic losses and public panic. The classical rumor…
A k-hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue
Jianxiong Guo, Weili Wu
In Online Social Networks (OSNs), interpersonal communication and information sharing are happening all the time, and it is real-time. When a user initiates an activity in OSNs, im…
An Approximation Algorithm for Active Friending in Online Social Networks
Guangmo Tong, Ruiqi Wang, Xiang Li +2
Guiding users to actively expanding their online social circles is one of the primary strategies for enhancing user participation and growing online social networks. In this paper,…
On Misinformation Containment in Online Social Networks
Guangmo Tong, Weili Wu, Ding-Zhu Du
The widespread online misinformation could cause public panic and serious economic damages. The misinformation containment problem aims at limiting the spread of misinformation in…
Coupon Advertising in Online Social Systems: Algorithms and Sampling Techniques
Guangmo Tong, Weili Wu, Ding-Zhu Du
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 produ…
Size Matters: A Comparative Analysis of Community Detection Algorithms
Paul Wagenseller, Feng Wang
Understanding community structure of social media is critical due to its broad applications such as friend recommendations, user modeling and content personalizations. Existing res…
Distributed Rumor Blocking with Multiple Positive Cascades
Guangmo Amo Tong, Weili Wu, Ding-Zhu Du
Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is often assumed that there is…
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks
Guangmo Tong, Weili Wu, Ling Guo +4
Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same us…
Effector Detection in Social Networks
Guangmo, Tong, Shasha Li +2
In a social network, influence diffusion is the process of spreading innovations from user to user. An activation state identifies who are the active users who have adopted the tar…
Terminal-Set-Enhanced Community Detection in Social Networks
G. Tong, L. Cui, W. Wu +2
Community detection aims to reveal the community structure in a social network, which is one of the fundamental problems. In this paper we investigate the community detection probl…