中文
相关论文

相关论文: Adaptive Multi-Feature Budgeted Profit Maximizatio…

200 篇论文

Nowadays, organizations use viral marketing strategies to promote their products through social networks. It is expensive to directly send the product promotional information to all the users in the network. In this context, Kempe et al.…

社会与信息网络 · 计算机科学 2024-10-23 Rahul Kumar Gautam , Anjeneya Swami Kare , S. Durga Bhavani

Today, many companies take advantage of viral marketing to promote their new products, and since there are several competing companies in many markets, Competitive Influence Maximization has attracted much attention. Two categories of…

社会与信息网络 · 计算机科学 2019-12-30 Amirhossein Ansari , Masoud Dadgar , Ali Hamzeh , Jörg Schlötterer , Michael Granitzer

Influence maximization aims to find a subset of seeds that maximize the influence spread under a given budget. In this paper, we mainly address the data-driven version of this problem, where the diffusion model is not given but needs to be…

社会与信息网络 · 计算机科学 2023-11-21 Yuxin Zuo , Haojia Sun , Yongyi Hu , Jianxiong Guo , Xiaofeng Gao

Partially Observable Markov Decision Processes (POMDPs) provide an efficient way to model real-world sequential decision making processes. Motivated by the problem of maintenance and inspection of a group of infrastructure components with…

最优化与控制 · 数学 2024-08-15 Manav Vora , Pranay Thangeda , Michael N. Grussing , Melkior Ornik

We study the profit maximization problem of a cognitive virtual network operator in a dynamic network environment. We consider a downlink OFDM communication system with various network dynamics, including dynamic user demands, uncertain…

网络与互联网体系结构 · 计算机科学 2012-12-18 Shuqin Li , Jianwei Huang , Shuo-Yen Robert Li

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 assumed that each user in the seed set we select is activated…

社会与信息网络 · 计算机科学 2021-05-21 Jianxiong Guo , Weili Wu

In this paper, we study the Budgeted Influence Maximization with Delay Problem, for which the number of literature are limited. We propose an approximate marginal spread computation\mbox{-}based approach for solving this problem. The…

社会与信息网络 · 计算机科学 2020-05-26 Suman Banerjee , Mamata Jenamani , Dilip Kumar Pratihar

We consider the problem of learning from revealed preferences in an online setting. In our framework, each period a consumer buys an optimal bundle of goods from a merchant according to her (linear) utility function and current prices,…

数据结构与算法 · 计算机科学 2014-12-02 Kareem Amin , Rachel Cummings , Lili Dworkin , Michael Kearns , Aaron Roth

We study the effectiveness of using multiple phases for maximizing the extent of information diffusion through a social network, and present insights while considering various aspects. In particular, we focus on the independent cascade…

社会与信息网络 · 计算机科学 2018-02-27 Swapnil Dhamal

This doctoral work focuses on three main problems related to social networks: (1) Orchestrating Network Formation: We consider the problem of orchestrating formation of a social network having a certain given topology that may be desirable…

社会与信息网络 · 计算机科学 2017-06-29 Swapnil Dhamal

A fundamental problem in revenue management is to optimally choose the attributes of products, such that the total profit or revenue or market share is maximized. Usually, these attributes can affect both a product's market share…

最优化与控制 · 数学 2021-12-24 Hongzhang Shao , Anton J. Kleywegt

Influence Maximization (IM) aims to maximize the number of people that become aware of a product by finding the `best' set of `seed' users to initiate the product advertisement. Unlike prior arts on static social networks containing fixed…

社会与信息网络 · 计算机科学 2019-11-14 Xudong Wu , Luoyi Fu , Zixin Zhang , Jingfan Meng , Xinbing Wang , Guihai Chen

This paper focuses on the problem of finding a particular data recommendation strategy based on the user preferences and a system expected revenue. To this end, we formulate this problem as an optimization by designing the recommendation…

信息论 · 计算机科学 2024-12-20 Shanyun Liu , Yunquan Dong , Pingyi Fan , Rui She , Shuo Wan

Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among all users. Prior IM methods mostly focus on maximizing the…

社会与信息网络 · 计算机科学 2024-02-27 Ying Wang , Yanhao Wang

Given a social network represented as a graph where the nodes are the users and the edges represent the social relations, and a positive integer k, how to select k nodes to maximize the influence in the network remains an active area of…

社会与信息网络 · 计算机科学 2026-05-29 Poonam Sharma , Sanchit Virdi , Suman Banerjee

Problem definition: Corporate brands, grassroots activists, and ordinary citizens all routinely employ Word-of-mouth (WoM) diffusion to promote products and instigate social change. Our work models the formation and spread of negative…

社会与信息网络 · 计算机科学 2021-05-07 Shuoguang Yang , Shatian Wang , Van-Anh Truong

Understanding the diffusion in social network is an important task. However, this task is challenging since (1) the network structure is usually hidden with only observations of events like "post" or "repost" associated with each node, and…

社会与信息网络 · 计算机科学 2018-09-21 Peiyuan Suny , Jianxin Li , Yongyi Mao , Richong Zhang , Lihong Wang

We study the min-cost seed selection problem in online social networks, where the goal is to select a set of seed nodes with the minimum total cost such that the expected number of influenced nodes in the network exceeds a predefined…

数据结构与算法 · 计算机科学 2017-12-21 Kai Han , Yuntian He , Xiaokui Xiao , Shaojie Tang , Jingxin Xu , Liusheng Huang

The idea of social advertising (or social promotion) is to select a group of influential individuals (a.k.a \emph{seeds}) to help promote some products or ideas through an online social networks. There are two major players in the social…

数据结构与算法 · 计算机科学 2021-10-01 Shaojie Tang , Jing Yuan

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…

社会与信息网络 · 计算机科学 2016-04-28 Sharan Vaswani , Laks. V. S. Lakshmanan , Mark Schmidt