Analyses on the Generalised Lotto-Type Competitive Learning

Authors:
Andrew Luk
Affiliations:
-
Venue:
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
Year:
2000

Citing 5
Cited 2

Competitive learning algorithms for vector quantization

Neural Networks
Self-organizing maps

Self-organizing maps
Competitively Inhibited Neural Networks for Adaptive Parameter Estimation

Competitively Inhibited Neural Networks for Adaptive Parameter Estimation
Winner-take-all neural networks using the highest threshold

IEEE Transactions on Neural Networks
Centroid neural network for unsupervised competitive learning

IEEE Transactions on Neural Networks

Dynamic Growing Self-organizing Neural Network for Clustering

ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Double enhancement learning for explicit internal representations: unifying self-enhancement and information enhancement to incorporate information on input variables

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In generalised lotto-type competitive learning algorithm more than one winner exist. The winners are divided into a number of tiers (or divisions), with each tier being rewarded differently. All the losers are penalised (which can be equally or differently). In order to study the various properties of the generalised lotto-type competitive learning, a set of equations, which governs its operations, is formulated. This is then used to analyse the stability and other dynamic properties of the generalised lotto-type competitive learning.