NDLI: Forming external behaviors by leveraging internal opinions

Content Provider	IEEE Xplore Digital Library
Author	Ahmadinejad, A. Dehghani, S. Hajiaghayi, M. Mahini, H. Seddighin, S. Yazdanbod, S.
Copyright Year	2015
Description	Author affiliation: Sharif Univ. of Technol., Tehran, Iran (Ahmadinejad, A.) \|\| Univ. of Maryland, College Park, MD, USA (Dehghani, S.; Hajiaghayi, M.; Mahini, H.; Seddighin, S.) \|\| Georgia Inst. of Technol., Atlanta, GA, USA (Yazdanbod, S.)
Abstract	People make decisions and express their opinions according to their communities. A natural idea for controlling the diffusion of a behavior is to find influential people, and employ them to spread a desired behavior. We investigate an influencing problem when individuals' behaviors are affected by their friends in an opinion formation process. Our goal is to design efficient algorithms for finding opinion leaders such that changing their opinions has a great impact on the overall external behaviors in the society. We study directed social networks and define a set of problems like maximizing the sum of individuals' behaviors or maximizing the number of individuals whose external behaviors are above a threshold. We discuss the complexity of the defined problems and design polynomial-time optimum algorithms for the non NP-hard variants of them. We also propose polynomial-time approximation algorithms with guaranteed performances and prove inapproximability results for the NP-hard variants of these problems. Furthermore, we run simulations on real-world social networks and show our proposed algorithm outperforms the classical algorithms such as degree-based algorithm, closeness-based algorithm, and pagerank-based algorithm.
Starting Page	1849
Ending Page	1857
File Size	330870
Page Count	9
File Format	PDF
ISBN	9781479983810
DOI	10.1109/INFOCOM.2015.7218567
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Hong Kong
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cost function Approximation algorithms Algorithm design and analysis Social network services Games Approximation methods Stochastic processes
Content Type	Text
Resource Type	Article

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

Adaptive Seeding in Social Networks

An optimization algorithm with probabilistic estimation

An optimization algorithm driven by probabilistic simulation

A constrained simultaneous perturbation stochastic approximation algorithm based on penalty functions

Efficient Algorithms for Social Network Coverage and Reach

Newton-Raphson version of stochastic approximation over discrete sets

Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms

Cost-distance: two metric network design

Friend recommendation with a target user in social networking services

Forming external behaviors by leveraging internal opinions

Similar Documents

Adaptive Seeding in Social Networks

An optimization algorithm with probabilistic estimation

An optimization algorithm driven by probabilistic simulation

A constrained simultaneous perturbation stochastic approximation algorithm based on penalty functions

Efficient Algorithms for Social Network Coverage and Reach

Newton-Raphson version of stochastic approximation over discrete sets

Optimal routing policy problems in stochastic time-dependent networks. II. Exact and approximation algorithms

Cost-distance: two metric network design

Friend recommendation with a target user in social networking services

Forming external behaviors by leveraging internal opinions