International Journal of Management and Applied Science (IJMAS)
current issues
Volume-4,Issue-10  ( Oct, 2018 )
Past issues
  1. Volume-4,Issue-10  ( Oct, 2018 )
  2. Volume-4,Issue-9  ( Sep, 2018 )
  3. Volume-4,Issue-8  ( Aug, 2018 )
  4. Volume-4,Issue-7  ( Jul, 2018 )
  5. Volume-4,Issue-6  ( Jun, 2018 )
  6. Volume-4,Issue-5  ( May, 2018 )
  7. Volume-4,Issue-4  ( Apr, 2018 )
  8. Volume-4,Issue-3  ( Mar, 2018 )
  9. Volume-4,Issue-2  ( Feb, 2018 )
  10. Volume-4,Issue-1  ( Jan, 2018 )

Statistics report
Jan. 2019
Submitted Papers : 80
Accepted Papers : 10
Rejected Papers : 70
Acc. Perc : 12%
Issue Published : 56
Paper Published : 3637
No. of Authors : 7479
  Journal Paper




Paper Title :
Influence Maximization for Social Networks

Author :Siddharth Sabnis, Akash Jagdale, Tousif Shaikh, Hari Prasad Mal

Article Citation :Siddharth Sabnis ,Akash Jagdale ,Tousif Shaikh ,Hari Prasad Mal , (2017 ) " Influence Maximization for Social Networks " , International Journal of Management and Applied Science (IJMAS) , pp. 181-183, Volume-3,Issue-3

Abstract : Influence maximization is introduced to maximize the profit of viral marketing in social networks. The weakness of influence maximization is that it does not distinguish specific users from others, even if some items can be only useful for the specific users. For such items, it is a better strategy to focus on maximizing the influence on the specific users. In this paper, we formulate an influence maximization problem as query processing to distinguish specific users from others. We show that the query processing problem is NP-hard and its objective function is submodular. We propose an expectation model for the value of the objective function and a fast greedy-based approximation method using the expectation model. For the expectation model, we investigate a relationship of paths between users. For the greedy method, we work out an efficient incremental updating of the marginal gain to our objective function. We conduct experiments to evaluate the proposed method with real-life datasets, and compare the results with those of existing methods that are adapted to the problem. From our experimental results, the proposed method is at least an order of magnitude faster than the existing methods in most cases while achieving high accuracy[1]. Keywords - Cascade model, Graph algorithms, Influence maximization, Social networks.

Type : Research paper

Indexed : Google Scholar


Copyright: © Institute of Research and Journals

| PDF |
Viewed - 30
| Published on 2017-06-07
   
   
IRAJ Other Journals
IJMAS updates
IJMAS -THANK YOU ALL FOR CONTRIBUTING YOUR PAPER TO IJMAS DECEMBER ISSUE.ALL AUTHORS ARE REQUESTED TO GET THEIR HARD COPY NOW.
The Conference World
Facebook

JOURNAL SUPPORTED BY