Abstract
We present an algorithm of clustering of many-dimensional objects, where only the distances between objects are used. Centers of classes are found with the aid of neuron-like procedure with lateral inhibition. The result of clustering does not depend on starting conditions. Our algorithm makes it possible to give an idea about classes that really exist in the empirical data. The results of computer simulations are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tou, J.T., Gonzales, R.C.: Pattern recognition principles. Addison-Wesley, London (1974)
Ayvazyan, S., Bukhstaber, V., Enyukov, I., Meshalkin, L.: Applied statistics. In: Clustering and Reduction of Dimension. Finansy i Satitistika, Moscow (1989) (in Russian)
Zagoruyko, N.: Applied Methods of Data and Knowledge Analysis. Institute of Mathematics Press, Novosibirsk (1999) (in Russian)
Blatt, M., Wiseman, S., Domany, E.: Super-paramagnetic Clustering of Data. Phys. Rev. Letters 76, 3251–3255 (1996)
Giada, L., Marsili, M.: Algorithms of maximal likelihood data clustering with applications. Cond-mat/0204202
Mantegna, R.N.: Hierarchical structure in financial markets. European Phys. Journal B 11, 193–197 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Litinskii, L.B., Romanov, D.E. (2006). Neural Network Clustering Based on Distances Between Objects. In: Kollias, S., Stafylopatis, A., Duch, W., Oja, E. (eds) Artificial Neural Networks – ICANN 2006. ICANN 2006. Lecture Notes in Computer Science, vol 4132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11840930_45
Download citation
DOI: https://doi.org/10.1007/11840930_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38871-5
Online ISBN: 978-3-540-38873-9
eBook Packages: Computer ScienceComputer Science (R0)