Analyses on the generalised lotto-type competitive learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1983, Issue , 2000, Pages 9-16

  Luk, Andrew ^a  

^a St B and P Neural Investments Pty Limited   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INTELLIGENT AGENTS; LEARNING ALGORITHMS;

COMPETITIVE LEARNING; DYNAMIC PROPERTY;

ENGINEERING EDUCATION;

EID: 33750129144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44491-2_2     Document Type: Conference Paper

References (15)

1. Proceedings of the IEEE/IAFE 1996-2000 Conference on Computational Intelligence for Financial Engineering (CIFEr), New York City, USA, 1996-2000.
2. S. Grossberg, “On learning and energy-entropy dependence in recurrent and nonrecurrent signed networks,” Journal of Statistical Physics, vol. 48, pp. 105-132, 1968.
3. S. Grossberg, “Adaptive pattern classification and universal recording: I. Parallel development and coding of neural feature detectors,” Biol. Cybern., vol. 23, pp. 121-134, 1976.
4. T. Kohonen, Self-Organizing Maps. Second Edition. Berlin: Springer-Verlag, 1997.
5. J.F. Yang and CM. Chen, “Winner-take-all neural networks using the highest threshold,” IEEE Trans, on Neural Networks, vol. 11, no. 1, pp. 194-199, 2000.
6. R.P. Lippmann, “An introduction to computing with neural nets,” IEEE ASSP Magazine, vol. 4, no. 2, pp.4-22, 1987.
7. S.C. Ahalt, A.K. Krishnamurty, P. Chen and D.E. Melton, “Competitive learning algorithms for vector quantization,” Neural Networks, vol. 3, no. 3, pp. 277-291, 1990.
8. L. Xu, A. Krzyzark and E. Oja, “Rival penalized competitive learning for clustering analysis, RBF net and curve detection,” IEEE Trans, on Neural Network, vol. 4, no. 4, pp. 636-649, 1993.
9. J. Ma and L. Xu, “The correct convergence of the rival penalized competitive learning (RPCL) algorithm,” 5th Intl. Confern. on Neural Information Processing (ICONIP ‘98), Kitakyushu, Japan, Oct. 21-23,1998, vol. 1, pp. 239-242.
10. L. Xu, “Rival penalized competitive learning, finite mixture, and multisets clustering”, Proceedings of the 1998 International Joint Conference on Neural Networks, Anchorage, Alasaka, USA, May 4-9, 1998, pp. 2525-2530.
11. A. Luk and S. Lien, “Rival rewarded and randomly rewarded rival competitive learning,” Proceedings of the 1999 International Joint Conference on Neural Networks, Washington, D.C., USA, July 10-16, 1999.
12. D.C. Park, “Centroid neural network for unsupervised competitive learning,” IEEE Trans, on Neural Networks, vol. 11, no. 2, pp. 520-528, 2000.
13. A. Luk and S. Lien, “Lotto-type competitive learning,” Progress in Connectionist-Based Information System, vol. 1, Singapore: Springer-Verlag, 1997, pp. 510-513.
14. A. Luk and S. Lien, “Lotto-type competitive learning and its stability,” Proceedings of the 1999 International Joint Conference on Neural Networks, Washington, D.C, USA, July 10-16, 1999.
15. M. Lemmon, Competitively Inhibited Neural Networks for Adaptive Parameter Estimation, Boston: Kluwer Academic Publishers, 1991.