NDLI: A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Please wait, while we are loading the content...

Schedulability Analysis of Short-Term Scheduling for Crude Oil Operations in Refinery With Oil Residency Time and Charging-Tank-Switch-Overlap Constraints

WireWarping++: Robust and Flexible Surface Flattening With Length Control

Optimal Scheduling of Biochemical Analyses on Digital Microfluidic Systems

Decision Fusion from Heterogeneous Sensors in Surveillance Sensor Systems

Distributed Optimization for Model Predictive Control of Linear Dynamic Networks With Control-Input and Output Constraints

The Base Stock/Base Backlog Control Policy for a Make-to-Stock System With Impatient Customers

ICRA preliminary announcement

IEEE 7th Annual Conference on Automation Science and Engineering

Why we joined ... [advertisement]

IEEE Robotics and Automation Society Information

IEEE Transactions on Automation Science and Engineering Information for authors

Year : 2010 Volume : 7

Year : 2009 Volume : 6

Year : 2008 Volume : 5

Year : 2007 Volume : 4

Year : 2006 Volume : 3

Year : 2005 Volume : 2

Year : 2004 Volume : 1

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Content Provider	IEEE Xplore Digital Library
Author	Narayanam, R. Narahari, Y.
Copyright Year	2004
Abstract	Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) λ -coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The λ-coverage problem is concerned with finding a set of key nodes having minimal size that can influence a given percentage λ of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the λ -coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient.
Sponsorship	IEEE Robotics and Automation Society
Starting Page	130
Ending Page	147
Page Count	18
File Size	830162
File Format	PDF
ISSN	15455955
Volume Number	8
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Social network services Games Diffusion processes Algorithm design and analysis Greedy algorithms Heuristic algorithms Context $\lambda$ -coverage Diffusion of information influential nodes Shapley value social networks target set selection top-$k$ nodes
Content Type	Text
Resource Type	Article
Subject	Control and Systems Engineering Electrical and Electronic Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks

Identifying Influential Nodes of Complex Networks Based on Trust-Value

A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

Identifying and Ranking Influential Nodes in Complex Networks Based on Dynamic Node Strength

MINE: Identifying Top-k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion

Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks

Identification of influential nodes in social networks and its applications

Top-K Influential Nodes in Social Networks: A Game Perspective

Target coverage heuristic based on learning automata in wireless sensor networks

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Similar Documents

An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks

Identifying Influential Nodes of Complex Networks Based on Trust-Value

A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks

Identifying and Ranking Influential Nodes in Complex Networks Based on Dynamic Node Strength

MINE: Identifying Top-k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion

Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks

Identification of influential nodes in social networks and its applications

Top-K Influential Nodes in Social Networks: A Game Perspective

Target coverage heuristic based on learning automata in wireless sensor networks

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks