О. І. Chumachenko, V. S. Gorbatiuk


A new “soft” clustering algorithm is proposed based on the use of artificial neural networks as  models of hypersurfaces that separate clusters. The algorithm allows to solve the problem of soft clusterization as a problem of smooth nonlinear function optimization and, therefore, to apply the entire mathematical apparatus of nonlinear optimization, which has evolved significantly in recent years. 


Clustering; artificial neural networks; soft clustering; nonlinear optimization.


Geoffrey Hinton, and Terrence J. Sejnowski, Unsupervised Learning: Foundations of Neural Computation. MIT Press, 1999.

Ken Bailey, Numerical Taxonomy and Cluster Analysis. Typologies and Taxonomies, 1994, 34 p.

D. Aloise, A. Deshpande, P. Hansen, and P. Popat, NP-hardness of Euclidean sum-of-squares clustering, 2009.

M. Mahajan, P. Nimbhorkar, and K. Varadarajan, The Planar k-Means Problem is NP-Hard, 2009.

E. W. Forgy, Cluster Analysis of Multivariate Data: Efficiency Versus Interpretability of Classifications. Biometrics. 1965, 21: 768–769.

Joe H. Ward, Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association. 2009, 58 (301): 236–244.

Teuvo Kohonen, Self-Organized Formation of Topologically Correct Feature Maps. Biological Cybernetics. 1982, 43 (1): 59–69.

Warren McCulloch, and Walter Pitts, A Logical Calculus of Ideas Immanent in Nervous Activity. Bulletin of Mathematical Biophysics. 1943, 5 (4): 115–133.

James C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms. 1981.

Christopher M. Bishop, Pattern Recognition and Machine Learning. Springer. 2006.

Full Text: PDF


  • There are currently no refbacks.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.