A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Maximization Influence Flow Using Modified Greedy Algorithm
2017
International Journal Of Engineering And Computer Science
Preserved Fulltext
The influence maximization problem is of finding a set of seed nodes in social network through which we can maximize the spread of influence. These seed nodes can be used in online marketing so as to maximize the profit. Marketers can get particular group of customers through online market. In this paper we are modifying greedy algorithm so as to maximize results of influence maximization.
doi:10.18535/ijecs/v6i1.39
fatcat:ubitwtglrjek5ne4vxu4ibcbde