KWTA networks and their applications |
| |
Authors: | Taek Mu Kwon Michael Zervakis |
| |
Affiliation: | (1) Department of Computer Engineering, University of Minnesota, Duluth, 271 MWAH, 10 University Dr., 55812 Duluth, MN |
| |
Abstract: | Winner-Take-All (WTA) or K-Winner-Take-All (KWTA) networks have been frequently used as the basic building blocks of complex neural networks. This paper introduces a new selection rule for network connections that implements stable KWTA networks. To widen the applications of WTA networks, a new class of WTA networks is proposed, and their efficient design methods are presented. We demonstrate the properties of the generalized class of WTA networks, through three application examples. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|