Solving maximum clique problem in stochastic graphs using learning automata

The maximum clique of a given graph G is the subgraph C of G such that two vertices in C are adjacent in G with maximum cardinality. Finding the maximum clique in an arbitrary graph is an NP-Hard problem, motivated by the social networks analysis. In the real world applications, the nature of interaction between nodes is stochastic and the probability distribution function of the vertex weight is unknown. In this paper a learning automata-based algorithm is proposed for solving maximum clique problem in the stochastic graph. The simulation results on stochastic graph demonstrate that the proposed algorithm outperforms standard sampling method in terms of the number of samplings taken by algorithm.

[1]  Mauro Brunato,et al.  R-EVO: A Reactive Evolutionary Algorithm for the Maximum Clique Problem , 2011, IEEE Transactions on Evolutionary Computation.

[2]  Mohammad Reza Meybodi,et al.  Tracking Extrema in Dynamic Environments Using a Learning Automata-Based Immune Algorithm , 2010, FGIT-GDC/CA.

[3]  Ruixuan Li,et al.  Incremental K-clique clustering in dynamic social networks , 2012, Artificial Intelligence Review.

[4]  Mohammad Reza Meybodi,et al.  LACAIS: Learning Automata Based Cooperative Artificial Immune System for Function Optimization , 2010, IC3.

[5]  Fred W. Glover,et al.  Multi-neighborhood tabu search for the maximum weight clique problem , 2012, Annals of Operations Research.

[6]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[7]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[8]  Mohammad Reza Meybodi,et al.  Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[9]  Piotr Bródka,et al.  International Conference on Computational Aspects of Social Networks , 2009, Computational Aspects of Social Networks.

[10]  Alfonso Rodríguez-Patón,et al.  On the scalability of biocomputing algorithms: The case of the maximum clique problem , 2011, Theor. Comput. Sci..

[11]  Mohammad Reza Meybodi,et al.  A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs , 2012, The Journal of Supercomputing.

[12]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[13]  Mohammad Reza Meybodi,et al.  Learning automata-based algorithms for solving stochastic minimum spanning tree problem , 2011, Appl. Soft Comput..

[14]  Selim Mimaroglu,et al.  CLICOM: Cliques for combining multiple clusterings , 2012, Expert Syst. Appl..

[15]  Pedro Martins,et al.  Cliques with maximum/minimum edge neighborhood and neighborhood density , 2012, Comput. Oper. Res..

[16]  Nasser Yazdani,et al.  A Novel Community Detection Algorithm for Privacy Preservation in Social Networks , 2012, ISI.

[17]  Mohammad Reza Meybodi,et al.  An adaptive mutation operator for artificial immune network using learning automata in dynamic environments , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).