Skip to main content
Log in

Neural clustering networks based on global optimisation of prototypes in metric spaces

  • Articles
  • Published:
Neural Computing & Applications Aims and scope Submit manuscript

Abstract

The utilisation of clustering algorithms based on the optimisation of prototypes in neural networks is demonstrated for unsupervised learning. Stimulated by common clustering methods of this type (learning vector quantisation [LVQ, GLVQ] and K-means) a globally operating algorithm was developed to cope with known shortcomings of existing tools. This algorithm and K-means (for the common methods) were applied to the problem of clustering EEG patterns being pre-processed. It can be shown that the algorithm based on global random optimisation may find an optimal solution repeatedly, whereas K-means provides different sub-optimal solutions with respect to the quality measure defined as objective function. The results are presented. The performance of the algorithms is discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kohonen T. Self-Organization and Associative Memory. 3rd edn. Springer, Berlin Heidelberg, 1984

    Google Scholar 

  2. Pal NR, Bezdek JC, Tsao ECK. Generalized clustering networks and Kohonen's self-organizing scheme. IEEE Transactions on Neural Networks 1993; 4(4) July

  3. Matyas J. Random optimization method. Automation and Remote Control 1965; 26: 246–253

    Google Scholar 

  4. Solis FJ, Wets JB. Minimization by random search techniques. Mathematics of Operations Research 1981; 6: 19–30

    Google Scholar 

  5. SPSS Inc. Statistical package. Professional Statistics Release 6.0, 1993

  6. Anderberg MR. Cluster Analysis for Applications. Academic Press, New York, 1973

    Google Scholar 

  7. Dillon WR, Goldstein M. Multivariate Analysis. Methods and Applications. John Wiley & Sons, Inc. New York, 1984

    Google Scholar 

  8. Polak E, Mayne DQ, Wardi Y. On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems. SIAM J Contr Optimiz 1983; 21: 179–203

    Google Scholar 

  9. Polak E, Mayne DQ. Algorithm models for nondifferentiable optimization. Proc. IEEE Cont. Decision and Control 1983; IX: 934–939

    Google Scholar 

  10. Baba N et al. A modified convergence theorem for a random optimisation method. Information Sciences 1977; 17: 159–166

    Google Scholar 

  11. Baba N et al. A hybrid algorithm for finding the global minimum of error function of neural networks and its applications. Neural Networks 1994; 7(8): 1253–1265

    Google Scholar 

  12. černy V. Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. JOTA 1985; 45: 41–51

    Google Scholar 

  13. German S, Hwang C. Diffusion for global optimization. SIAM Journal of Control and Optimization 1986; 24: 1031–1043

    Google Scholar 

  14. Styblinski MA, Tang TS. Experiments in nonconvex optimization: stochastic approximation with function smoothing and simulated annealing. Neural Networks 1990; 3(4): 467–483

    Google Scholar 

  15. Tang Z, Koehler GJ. Deterministic global optimal FNN training algorithms. Neural Networks 1994; 7(2): 301–311

    Google Scholar 

  16. Baba N. A new approach for finding the global minimum of error function of neural networks. Neural Networks 1989; 2(2): 367–373

    Google Scholar 

  17. Kaufman L, Rousseeuw PJ. Finding Groups in Data: An introduction to cluster analysis. John Wiley & Sons, New York, 1990

    Google Scholar 

  18. Krajča V, Petránek S, Patáková I, VÄrri A. Automatic identification of significant graphoelements in multichannel EEG-recordings by adaptive segmentation and fuzzy clustering. Int J Biomed Comput 1991; 28: 71–89

    Google Scholar 

  19. Bodenstein G, Schneider W, Malsburg Cvd. Computerized EEG pattern classification by adaptive segmentation and probability-density-function classification. Description of the method. Comput Biol Med 1985; 15(5): 297–313

    Google Scholar 

  20. VÄrri A. Digital processing of EEG in epilepsy. Licentiate Thesis. Tampere University of Technology, Tampere, Finland, 1988

    Google Scholar 

  21. Krajča V, Petránek S, PietilÄ T, Frey H. ‘Wave-Finder’: A new system for an automatic processing of long-term EEG-recordings. In: Rother M, Zweiner U (eds), Quantitative EEG analysis — clinical utility and new methods, UniversitÄtsverlag Jena, 1993

  22. Duda R, Hart P. Pattern Classification and Scene Analysis. John Wiley & Sons, New York 1973

    Google Scholar 

  23. Jain A, Dubes R. Algorithms that Cluster Data. Englewood Cliffs, Prentice Hall, New Jersey

  24. Kruse H. Programmierung Neuronaler Netze. Addison-Wesley, Bonn, München, 1991

    Google Scholar 

  25. Abramowitz M, Steugen I. Handbook of Mathematical Functions with Formulas, Graphs and Mathematical tables, 7th printing. US Govt. Printing Office, Washington, DC

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galicki, M., Möller, U. & Witte, H. Neural clustering networks based on global optimisation of prototypes in metric spaces. Neural Comput & Applic 5, 2–13 (1997). https://doi.org/10.1007/BF01414098

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01414098

Keywords

Navigation