Community-based greedy algorithm for mining top-K influential nodes in mobile social networks

Citations Over TimeTop 1% of 2010 papers

Abstract

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 fundamental issue to find a subset of influential individuals in a mobile social network such that targeting them initially (e.g. to adopt a new product) 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 that a Greedy algorithm with provable approximation guarantees can give good approximation; However, it is computationally expensive, if not prohibitive, to run the greedy algorithm on a large mobile network.

Related Papers

• → A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks(2021)8 cited
• → Tight Approximation Ratios of Two Greedy Algorithms for Optimal RSU Deployment in One-Dimensional VANETs(2020)14 cited
• → Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search(2007)19 cited
• → A Practical Greedy Approximation for the Directed Steiner Tree Problem(2014)6 cited
• → Greedy Approximation with Regard to Some Normalized Bases(2010)