Шукати за:
Роком видання
Автором
Назвою статті
Method of an exact quadratic regularization into clustering problem of data
Повний текст (PDF)
УДК: 519.85
Мова публікації: Російська
Stuc. intelekt. 2013; 18; (1):158–162
Анотація: 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.
Ключові слова: clustering problem of data, optimization, method of an exact quadratic regularization
Посилання:
- Hunt E.B. Artificial Intelligence. Academic Press. Nev York, San Francisco, London, 1975. 468 p.
- Tou J.T., Gonzalez R.C. Pattern Recognition Principles. Addison-Wesley Publishing Company. LondonAmsterdam-DomMills, Ontario-Sydney-Tokyo. 1974. 378 p.
- Mandel I.D. Cluster Analisys. Finances and Statistica. Moscow. 1988. 176 p. (rus)
- Kenneth V.P., Storn R.M., Lampinen J.A. Differential Evolution. A Practical Approach to GlobalOptimization. Springer-Verlag. Berlin Heidelberg. 2005. 542 p.
- Sokurenko V.M. Naukovi visti NTUU “KPI”. No. 1. 2012. Pp. 81–87. (rus)
- Sherali H.D., Jitamitra D. J. Global Optim. No. 32. 2005. Pp. 281–306.
- Kosolap A.I. J. Comp. & Appl. Math. No. 4. 2010. Pp. 44–50. (rus)