Targeted Influential Nodes Selection in Location-Aware Social Networks

Complexity 2018:1-10 (2018)
  Copy   BIBTEX

Abstract

Given a target area and a location-aware social network, the location-aware influence maximization problem aims to find a set of seed users such that the information spread from these users will reach the most users within the target area. We show that the problem is NP-hard and present an approximate algorithm framework, namely, TarIM-SF, which leverages on a popular sampling method as well as spatial filtering model working on arbitrary polygons. Besides, for the large-scale network we also present a coarsening strategy to further improve the efficiency. We theoretically show that our approximate algorithm can provide a guarantee on the seed quality. Experimental study over three real-world social networks verified the seed quality of our framework, and the coarsening-based algorithm can provide superior efficiency.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Research on Context-Awareness Mobile SNS Recommendation Algorithm.Zhijun Zhang & Hong Liu - 2015 - Pattern Recognition and Artificial Intelligence 28.

Analytics

Added to PP
2018-11-02

Downloads
8 (#517,646)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Hui Li
National University of Singapore

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references