PL EN


Preferences help
enabled [disable] Abstract
Number of results
- |
Article title

Ant colony opimization algorithms for clustering problems

Content
Title variants
Languages of publication
PL
Abstracts
PL
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.
Publisher
Year
-
Physical description
Dates
online
2015-04-21
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-nameId-6e3e8ea9-5a94-37a7-828b-e6cd5da23db6-year-2015-article-1745
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.