A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization

Kiichi Urahama

Research output: Contribution to journalArticle

Abstract

Using a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered. The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.

Original languageEnglish
Pages (from-to)93-100
Number of pages8
JournalSystems and Computers in Japan
Volume24
Issue number6
DOIs
Publication statusPublished - Jan 1 1993
Externally publishedYes

Fingerprint

Combinatorial optimization
Combinatorial Optimization
Neural networks
Set Partitioning
Neural Nets
Approximate Algorithm
Modes of Operation
Combinatorial Optimization Problem
Approximate Solution
Experiments
Experimental Results
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization. / Urahama, Kiichi.

In: Systems and Computers in Japan, Vol. 24, No. 6, 01.01.1993, p. 93-100.

Research output: Contribution to journalArticle

@article{b3dc942cdad546e19088ea5d68673f03,
title = "A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization",
abstract = "Using a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered. The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.",
author = "Kiichi Urahama",
year = "1993",
month = "1",
day = "1",
doi = "10.1002/scj.4690240609",
language = "English",
volume = "24",
pages = "93--100",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

T1 - A neural algorithm incorporating winner‐take‐all subnets for combinatorial optimization

AU - Urahama, Kiichi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Using a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered. The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.

AB - Using a neural net composed of subnets with a winner‐take‐all (WTA) mode of operations, the constraint that the variables must form a probability vector or a probability matrix can automatically be satisfied. Taking advantage of this property, this paper proposes a neural algorithm than can derive the approximate solution for a combinatorial optimization problem such as set partitioning. As a simple example, the 3‐partition maximum‐cut problem is considered. The worst‐case error is evaluated theoretically, and it is shown that the proposed method is one‐third (relative) approximate algorithm. For comparison, the performance of the conventional method also is evaluated theoretically. The performances also are compared by experiment. Both the theoretical and experimental results confirm that the proposed method can achieve better performance than the conventional method.

UR - http://www.scopus.com/inward/record.url?scp=0027843120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027843120&partnerID=8YFLogxK

U2 - 10.1002/scj.4690240609

DO - 10.1002/scj.4690240609

M3 - Article

AN - SCOPUS:0027843120

VL - 24

SP - 93

EP - 100

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 6

ER -