A discrete-time recurrent neural network with one neuron for k-winners-take-all operation

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a discrete-time recurrent neural network with one neuron and global convergence is proposed for k-winners-take-all (kWTA) operation. Comparing with the existing kWTA networks, the proposed network has simpler structure with only one neuron. The global convergence of the network can be guaranteed for kWTA operation. Simulation results are provided to show that the outputs vector of the network is globally convergent to the solution of the kWTA operation. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Liu, Q., Cao, J., & Liang, J. (2009). A discrete-time recurrent neural network with one neuron for k-winners-take-all operation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5551 LNCS, pp. 272–278). https://doi.org/10.1007/978-3-642-01507-6_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free