Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks

Xiaolin Hu, Jun Wang

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы для конференциирецензирование

2 Цитирования (Scopus)

Аннотация

The k-winners-take-all (k-WTA) problem is to select k largest inputs from a set of inputs in a network, which has many applications in machine learning. The Cournot-Nash equilibrium is an important problem in economic models . The two problems can be formulated as linear variational inequalities (LVIs). In the paper, a linear case of the general projection neural network (GPNN) is applied for solving the resulting LVIs, and consequently the two practical problems. Compared with existing recurrent neural networks capable of solving these problems, the designed GPNN is superior in its stability results and architecture complexity.

Язык оригиналаАнглийский
Название основной публикацииNeural Information Processing - 14th International Conference, ICONIP 2007, Revised Selected Papers
Страницы703-712
Число страниц10
ИзданиеPART 1
DOI
СостояниеОпубликовано - 2008
Опубликовано для внешнего пользованияДа
Событие14th International Conference on Neural Information Processing, ICONIP 2007 - Kitakyushu, Япония
Продолжительность: 13 нояб. 200716 нояб. 2007

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
НомерPART 1
Том4984 LNCS
ISSN (печатное издание)0302-9743
ISSN (электронное издание)1611-3349

Конференция

Конференция14th International Conference on Neural Information Processing, ICONIP 2007
Страна/TерриторияЯпония
ГородKitakyushu
Период13/11/0716/11/07

Fingerprint

Подробные сведения о темах исследования «Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать