International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 129 - Number 8 |
Year of Publication: 2015 |
Authors: Afshin Mohammadi, Keyhan Khamforoosh |
10.5120/ijca2015906898 |
Afshin Mohammadi, Keyhan Khamforoosh . Influence Maximization in Social Networks using Learning Automata. International Journal of Computer Applications. 129, 8 ( November 2015), 4-10. DOI=10.5120/ijca2015906898
Influence maximization problem is one of the challenges in online social networks. This problem refers to finding a small set of members of a social network, by activation of whichinformation propagation can be maximized using one of the propagation models such as independent cascade model. For the maximization problem, the greedy algorithm has beenpresented which isclose to optimal response by 67% in terms of accuracy; but, the problem of this method is its inefficiency in the social networks with a large number of members. The performed works on the improvement of the greedy algorithm have been mostly faced with the problem of scalability, dependence on graph structure, or need for large memory. In this paper, a method was presented using automata learning which could preserve its efficiency in large social networks and obtainresults with near-optimal values. For this purpose, space of the problem was reduced by removing low-degree nodes and the effective nodes for starting propagation in social network was found by automata learning which is optimal for achieving global optimization. The obtained results of this paper showed that the proposed method was efficient in large social networks and its results wereclose to the ones obtained by the greedy algorithm in terms of accuracy.