Stochastic Competitive Hopfield Network and Its Application to Maximum Clique Problem(Neural Networks and Bioengineering)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, introducing a stochastic hill-climbing dynamics into an optimal competitive Hop field network model (OCHOM), we propose a new algorithm that permits temporary energy increases, which helps the OCHOM escape from local minima. In graph theory, a clique is a completely connected subgraph and the maximum clique problem (MCP) is to find a clique of maximum size of a graph. The MCP is a classic optimization problem in computer science and in graph theory with many real-world applications, and is also known to be NP-complete. Recently, Galan-Marin et al. proposed the OCHOM for the MCP. It can guarantee convergence to a global/local minimum of energy function, and performs better than other competitive neural approaches. However, the OCHOM has no mechanism to escape from local minima. The proposed algorithm introduces stochastic hill-climbing dynamics which helps the OCHOM escape from local minima, and it is applied to the MCP. A number of instances have been simulated to verify the proposed algorithm.
- 社団法人電子情報通信学会の論文
- 2004-10-01
著者
-
CAO Qiping
Tateyama Institute of System
-
Cao Q
Tateyama Systems Institute
-
WANG Jiahai
the Faculty of Engineering, Toyama University
-
Wang Jiahai
Faculty Of Engineering Toyama University
-
TANG Zheng
Tateyama Systems Institute
関連論文
- Local Search with Probabilistic Modeling for Learning Multiple-Valued Logic Networks
- An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem(Nonlinear Problems)
- A Neural-based Algorithm for Topological Via-minimization Problem
- Design and realization of a network security model
- An Elastic Net Learning Algorithm for Edge Linking of Images
- An Efficient Neural Algorithm for Two-layer Planarization Problem in Graph Drawing
- Maximum Neural Network with Nonlinear Self-Feedback and Its Application to Maximum Independent Set Problem
- An Improved Local Search Learning Method for Multiple-Valued Logic Network Minimization with Bi-objectives
- A stochastic dynamic local search method for learning Multiple-Valued Logic networks
- A Learning Algorithm of Elastic Net for Multiple Traveling Salesmen Problem
- A Chaotic Clonal Selection Algorithm and its Application to Synthesize Multiple-Valued Logic Functions
- A Chaotic Maximum Neural Network for Maximum Clique Problem(Biocybernetics, Neurocomputing)
- Local Search with Probabilistic Modeling for Learning Multiple-Valued Logic Networks
- A Modified Hopfield Neural Network for the Minimum Vertex Cover Problem
- An Improved Transiently Chaotic Neural Network with Application to the Maximum Clique Problems
- An Elastic Net Learning Algorithm for Edge Linking of Images(Neural Netoworks and Bioengineering)
- Stochastic Competitive Hopfield Network and Its Application to Maximum Clique Problem(Neural Networks and Bioengineering)