中文
相关论文

相关论文: Factorization Bandits for Online Influence Maximiz…

200 篇论文

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 under LT model in social networks, which is a combinatorial…

社会与信息网络 · 计算机科学 2022-06-08 Qiufen Ni , Jianxiong Guo , Weili Wu , Chuanhe Huang

This paper examines the problem of adaptive influence maximization in social networks. As adaptive decision making is a time-critical task, a realistic feedback model has been considered, called myopic. In this direction, we propose the…

社会与信息网络 · 计算机科学 2018-07-09 Guillaume Salha , Nikolaos Tziortziotis , Michalis Vazirgiannis

The goal of opinion maximization is to maximize the positive view towards a product, an ideology or any entity among the individuals in social networks. So far, opinion maximization is mainly studied as finding a set of influential nodes…

社会与信息网络 · 计算机科学 2019-01-03 Anuj Nayak , Seyyedali Hosseinalipour , Huaiyu Dai

This paper studies the multi-cascade influence maximization problem, which explores strategies for launching one information cascade in a social network with multiple existing cascades. With natural extensions to the classic models, we…

社会与信息网络 · 计算机科学 2019-12-03 Guangmo Tong , Ruiqi Wang , Zheng Dong

Studies of networked phenomena, such as interactions in online social media, often rely on incomplete data, either because these phenomena are partially observed, or because the data is too large or expensive to acquire all at once.…

机器学习 · 计算机科学 2020-01-22 Timothy LaRock , Timothy Sakharov , Sahely Bhadra , Tina Eliassi-Rad

We identify influential early adopters that achieve a target behavior distribution for a resource constrained social network with multiple costly behaviors. This problem is important for applications ranging from collective behavior change…

社会与信息网络 · 计算机科学 2013-03-26 Kaushik Sarkar , Hari Sundaram

Offline policy optimization could have a large impact on many real-world decision-making problems, as online learning may be infeasible in many applications. Importance sampling and its variants are a commonly used type of estimator in…

机器学习 · 计算机科学 2022-07-05 Yao Liu , Yannis Flet-Berliac , Emma Brunskill

Given a social network with diffusion probabilities as edge weights and an integer k, which k nodes should be chosen for initial injection of information to maximize influence in the network? This problem is known as Target Set Selection in…

社会与信息网络 · 计算机科学 2018-08-17 Suman Banerjee , Mamata Jenamani , Dilip Kumar Pratihar

We consider online learning problems under a partial observability model capturing situations where the information conveyed to the learner is between full information and bandit feedback. In the simplest variant, we assume that in addition…

机器学习 · 计算机科学 2026-04-28 Tomas Kocak , Gergely Neu , Michal Valko , Remi Munos

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

Probability estimates generated by boosting ensembles are poorly calibrated because of the margin maximization nature of the algorithm. The outputs of the ensemble need to be properly calibrated before they can be used as probability…

机器学习 · 计算机科学 2020-01-20 Nikolaos Nikolaou , Joseph Mellor , Nikunj C. Oza , Gavin Brown

The link recommendation problem consists in suggesting a set of links to the users of a social network in order to increase their social circles and the connectivity of the network. Link recommendation is extensively studied in the context…

数据结构与算法 · 计算机科学 2017-06-15 Gianlorenzo D'Angelo , Lorenzo Severini , Yllka Velaj

We introduce the factored bandits model, which is a framework for learning with limited (bandit) feedback, where actions can be decomposed into a Cartesian product of atomic actions. Factored bandits incorporate rank-1 bandits as a special…

机器学习 · 计算机科学 2018-10-30 Julian Zimmert , Yevgeny Seldin

We introduce a novel algorithmic approach to content recommendation based on adaptive clustering of exploration-exploitation ("bandit") strategies. We provide a sharp regret analysis of this algorithm in a standard stochastic noise setting,…

机器学习 · 计算机科学 2014-06-09 Claudio Gentile , Shuai Li , Giovanni Zappella

We consider a collaborative online learning paradigm, wherein a group of agents connected through a social network are engaged in playing a stochastic multi-armed bandit game. Each time an agent takes an action, the corresponding reward is…

机器学习 · 计算机科学 2016-07-12 Ravi Kumar Kolla , Krishna Jagannathan , Aditya Gopalan

A serious challenge when finding influential actors in real-world social networks is the lack of knowledge about the structure of the underlying network. Current state-of-the-art methods rely on hand-crafted sampling algorithms; these…

社会与信息网络 · 计算机科学 2020-02-21 Harshavardhan Kamarthi , Priyesh Vijayan , Bryan Wilder , Balaraman Ravindran , Milind Tambe

A social network (SN) is a social structure consisting of a group representing the interaction between them. SNs have recently been widely used and, subsequently, have become suitable and popular platforms for product promotion and…

社会与信息网络 · 计算机科学 2022-09-13 Saeid Ghafouri , Seyed Hossein Khasteh , Seyed Omid Azarkasb

Social-media platforms have created new ways for citizens to stay informed and participate in public debates. However, to enable a healthy environment for information sharing, social deliberation, and opinion formation, citizens need to be…

社会与信息网络 · 计算机科学 2021-11-05 Cigdem Aslay , Antonis Matakos , Esther Galbrun , Aristides Gionis

Influence maximization serves as the main goal of a variety of social network activities such as viral marketing and campaign advertising. The independent cascade model for the influence spread assumes a one-time chance for each activated…

社会与信息网络 · 计算机科学 2017-08-08 Ali Vardasbi , Heshaam Faili , Masoud Asadpour

Finding a small subset of influential nodes to maximise influence spread in a complex network is an active area of research. Different methods have been proposed in the past to identify a set of seed nodes that can help achieve a faster…

社会与信息网络 · 计算机科学 2022-12-23 Abida Sadaf , Luke Mathieson , Piotr Bródka , Katarzyna Musial