<![CDATA[WUJ]]><![CDATA[info@ejournals.eu]]>https://www.ejournals.eu/20200929ejournals.eu.article.361103010610.4467/2353737XCT.14.049.395720<![CDATA[clustering, clique covering problem, clique vertex partitioning problem, ant algorithms]]>00ED031001Number10102<![CDATA[Czasopismo Techniczne]]>03<![CDATA[2013]]>01<![CDATA[Automatyka Zeszyt 4-AC (12) 2013]]>1A01<![CDATA[Krzysztof Schiff]]>0101<![CDATA[Ant colony opimization algorithms for clustering problems]]>01en001003020PLN03<![CDATA[The clustering problem is one of the main problems which can be encountered in a data analysis. This problem can be modelled by means of a graph; finding clusters means finding cliques in the graph. Often there is a need to find clusters (cliques) in a graph in different ways and to construct a list of clusters. This paper describes two such ways, these can be stated as the cluster minimum covering problem and the vertex cluster minimum partitioning problem. This paper describes new ant algorithms which were used in order to make a list of clusters in both presented problems, and also discusses the results of their comparison.]]>012014092515000401http://dx.doi.org/10.4467/2353737XCT.14.049.3957