Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Select your language


Method of an exact quadratic regularization into clustering problem of data

Kosolap A.1
1 The Ukrainian State Chemical-Technological University

Full text (PDF)

UDC: 519.85
Publication Language: Russian
Stuc. intelekt. 2013; 18(1):158–162

Abstract: In this paper, we consider a problem clustering of data. The set of points cover of spheres in space ndimensional. This problem is reduced to of vector norm maximization on feasible nonconvex set. Then we use a method of an exact quadratic regularization for the solution of an optimizing problem which has shown its superiority over genetic and evolution methods at the solution of numerous test problems.

Keywords: clustering problem of data, optimization, method of an exact quadratic regularization

References:

  1. Hunt E.B. Artificial Intelligence. Academic Press. Nev York, San Francisco, London, 1975. 468 p.
  2. Tou J.T., Gonzalez R.C. Pattern Recognition Principles. Addison-Wesley Publishing Company. LondonAmsterdam-DomMills, Ontario-Sydney-Tokyo. 1974. 378 p.
  3. Mandel I.D. Cluster Analisys. Finances and Statistica. Moscow. 1988. 176 p. (rus)
  4. Kenneth V.P., Storn R.M., Lampinen J.A. Differential Evolution. A Practical Approach to GlobalOptimization. Springer-Verlag. Berlin Heidelberg. 2005. 542 p.
  5. Sokurenko V.M. Naukovi visti NTUU “KPI”. No. 1. 2012. Pp. 81–87. (rus)
  6. Sherali H.D., Jitamitra D. J. Global Optim. No. 32. 2005. Pp. 281–306.
  7. Kosolap A.I. J. Comp. & Appl. Math. No. 4. 2010. Pp. 44–50. (rus)

View full text (PDF)