Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Książka = Book ; KS/4/2012/P05
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[5], 45-57 pages ; 21 cm ; Bibliography p. 55-57
Computer aided data mining, and in particular methods of clustering, its widely used technique, develop very rapidly nowadays. Basically, clustering is an unsupervised learning technique. However, there is a growing interest in considering the case where there is a partial knowledge on the actual grouping of the objects available. This knowledge may take form of the hints on the co-occurrence of object in the same clusters. In this paper we propose to solve this problem of constrained clustering using the technique of differential evolution (DE). We show the efficiency and usefulness of differential evolution in hard- and soft-constrained clustering tasks. Some practical examples of the clustering problems are examined and results obtained are compared to two variants of a classic clustering technique, the k-means algorithm.
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 15, 2021
Aug 18, 2021
48
https://rcin.org.pl./publication/242599