Letters: A TCNN filter algorithm to maximum clique problem

Authors:
Gang Yang;Junyan Yi;Zhiqiang Zhang;Zheng Tang
Affiliations:
Faculty of Engineering, University of Toyama, Toyama, Japan;Faculty of Engineering, University of Toyama, Toyama, Japan;Faculty of Engineering, University of Toyama, Toyama, Japan;Faculty of Engineering, University of Toyama, Toyama, Japan
Venue:
Neurocomputing
Year:
2009

Citing 8
Cited 2

Chaotic simulated annealing by a neural network model with transient chaos

Neural Networks
An investigation into the improvement of local minima of the Hopfield network

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
Letter: A method to improve the transiently chaotic neural network

Neurocomputing
Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers

IEEE Transactions on Neural Networks
Approximating maximum clique with a Hopfield network

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, coefficient sensitiveness of transiently chaotic neural network (TCNN) for maximum clique problem (MCP) is analyzed. By introducing a new definition of adaptivity into TCNN and utilizing a neuron filter, the domain of coefficient selection is enlarged to search globally optimal solution and near-optimal solution on MCP. Based on our analysis on the characteristic of TCNN, we propose a TCNN filter algorithm to shrink the network scale and improve solution quality. The algorithm effectively relaxes the coefficient sensitiveness and improves network ability to solve MCP. Simulations have been performed to verify the validity of our algorithm.