Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26954
Title: Algorithm for solving bipartite subgraph problem with probabilistic self-organizing learning
Authors: Choy, CST
Siu, WC 
Issue Date: 1995
Source: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 1995, v. 5, p. 3351-3354 How to cite?
Abstract: Self-organizing model has been successfully applied to solve some combinatorial optimization problems, including travelling salesman problem, routing problem and cell-placement problem, but there has not much work reported on its application to solve graph partitioning problem. In this paper, we propose a novel mapping which has not been proposed before, with some changes to the original Kohonen's algorithm so as to enable it to solve a partitioning problem - the bipartite subgraph problem. This new approach is compared with the maximum neural network for solving the same problem, and shows that the performance of our new approach is superior over the maximum neural network.
Description: Proceedings of the 1995 20th International Conference on Acoustics, Speech, and Signal Processing. Part 2 (of 5), Detroit, MI, USA, 9-12 May 1995
URI: http://hdl.handle.net/10397/26954
ISSN: 0736-7791
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Citations as of Sep 15, 2017

Page view(s)

35
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.