Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
193
Seeding Influential Nodes in Non-Submodular Models of Information Diffusion
"... We consider the model of information diffusion in social networks from [2] which incorporates trust (weighted links) between actors, and allows actors to actively participate in the spreading process, specifically through the ability to query friends for additional information. This model captures h ..."
Abstract
- Add to MetaCart
nodes to inject with the information. Our general approach is to reduce our model to a class of simpler models for which provably good sets can be constructed. By tuning this class of simpler models, we obtain a good seed set for the original more complex model. We call this the projected greedy
BLOCKING NEGATIVE INFLUENTIAL NODE SET IN SOCIAL NETWORKS: FROM HOST PERSPECTIVE
, 2015
"... by ..."
Under consideration for publication in Knowledge and Information Systems Efficient Discovery of Influential Nodes for SIS Models in Social Networks
, 2010
"... Abstract. We address the problem of discovering the influential nodes in a social network un-der the susceptible/infected/susceptible (SIS) model which allows multiple activation of the same node, by defining two influence maximization problems:final-time and integral-time. We solve this problem by ..."
Abstract
- Add to MetaCart
Abstract. We address the problem of discovering the influential nodes in a social network un-der the susceptible/infected/susceptible (SIS) model which allows multiple activation of the same node, by defining two influence maximization problems:final-time and integral-time. We solve this problem
Community-based Greedy Algorithm for Mining Top-K Influential Nodes in Mobile Social Networks
"... With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. A mobile social network plays an essential role as the spread of information and influence in the form of "word-of-mouth". It is a fundamen-tal issue to find a subs ..."
Abstract
- Add to MetaCart
subset of influential individuals in a mobile social network such that targeting them initially (e.g. to adopt a new prod-uct) will maximize the spread of the influence (further adoptions of the new product). The problem of finding the most influential nodes is unfortunately NP-hard. It has been shown
Predictive Simulation Framework of Stochastic Diffusion Model for Identifying Top-K Influential Nodes
"... We address a problem of efficiently estimating the influence of a node in information diffusion over a social network. Since the information diffusion is a stochastic process, the influence degree of a node is quantified by the expectation, which is usually obtained by very time consuming many runs ..."
Abstract
- Add to MetaCart
-K influential nodes. The method we proposed for the first problem estimates the approximation error of the influence degree of each node, and the method for the second prob-lem estimates the precision of the derived top-K nodes, both without knowing the true influence degree. We experimentally evaluate
Minimum-sized Positive Influential Node Set Selection for Social Networks: Considering Both Positive and Negative Influences
"... Abstract-Social networks are important mediums for spreading information, ideas, and influences among individuals. Most of existing research work focus on understanding the characteristics of social networks, investigating spreading infor mation through the "word of mouth " effect of socia ..."
Abstract
- Add to MetaCart
products), we take both positive and negative influences into consideration and propose a new optimization problem, named the Minimum sized Positive Influential Node Set (MPINS) selection problem, to identify the minimum set of influential nodes, such that every node in the network can be positively
Minimum-sized influential node set selection for social networks under the independent cascade model
, 2014
"... Social networks are important mediums for communication, information dissemination, and influence spreading. Most of existing works focus on understanding the characteristics of social networks or spreading information through the “word of mouth ” effect of social networks. However, motivated by app ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
by applications of alleviating social problems, such as drink-ing, smoking, addicting to gaming, and influence spreading problems, such as promoting new products, we propose a new optimization problem named the Minimum-sized Influ-ential Node Set (MINS) selection problem, which is to iden-tify the minimum
Maximizing the Spread of Influence Through a Social Network
- In KDD
, 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of ..."
Abstract
-
Cited by 990 (7 self)
- Add to MetaCart
, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target? We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide
Online estimating the k central nodes of a network
- In Proc. of the IEEE Network Science Workshop (NSW
, 2011
"... Estimating the most influential nodes in a network is a fundamental problem in network analysis. Influential nodes may be important spreaders of diseases in biological networks, key actors in terrorist networks, or marketing targets in social ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
Estimating the most influential nodes in a network is a fundamental problem in network analysis. Influential nodes may be important spreaders of diseases in biological networks, key actors in terrorist networks, or marketing targets in social
IDENTIFYING INFLUENTIAL AGENTS IN SOCIAL SYSTEMS
, 2014
"... This dissertation addresses the problem of influence maximization in social networks. In-fluence maximization is applicable to many types of real-world problems, including modeling con-tagion, technology adoption, and viral marketing. Here we examine an advertisement domain in which the overarching ..."
Abstract
- Add to MetaCart
the overarching goal is to find the influential nodes in a social network, based on the network structure and the interactions, as targets of advertisement. The assumption is that advertisement budget limits prevent us from sending the advertisement to everybody in the network. Therefore, a wise selection
Results 11 - 20
of
193
