An improved competitive Hopfield network with inhibitive competitive activation mechanism for maximum clique problem

Authors:
Gang Yang;Nan Yang;Junyan Yi;Zheng Tang
Affiliations:
-;-;-;-
Venue:
Neurocomputing
Year:
2014

Citing 12
Cited 0

Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework

Neural Networks
Solving large scale traveling salesman problems by chaotic neurodynamics

Neural Networks
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research
Letters: A TCNN filter algorithm to maximum clique problem

Neurocomputing
Letter: A discrete competitive Hopfield neural network for cellular channel assignment problems

Neurocomputing
A neuro-GA approach for the maximum fuzzy clique problem

ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Multi-start stochastic competitive Hopfield neural network for frequency assignment problem in satellite communications

Expert Systems with Applications: An International Journal
Exploratory Social Network Analysis with Pajek

Exploratory Social Network Analysis with Pajek
Design and analysis of maximum Hopfield networks

IEEE Transactions on Neural Networks
A parallel improvement algorithm for the bipartite subgraph problem

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we analyze the formula of weights definition in the discrete competitive Hopfield network (DCHOM) and point out its flaw when using it to solve some special instances of maximum clique problem (MCP). Based on the analysis, we propose an improved competitive Hopfield network algorithm (ICHN). In ICHN, we introduce a flexible weight definition method which excites the competitive dynamics, and we also present an initial values setting strategy which efficiently increases the probability of finding optimal solutions. Furthermore, an inhibitive competitive activation mechanism is introduced to form a new input updating rule which reduces significantly the number of neurons with an intermediate level of activations. Our algorithm effectively overcomes the flaw of the DCHOM, and exhibits powerful solving ability for the MCP. Experiments on the benchmark problems and practical applications verify the validity of our algorithm.