Displaying similar documents to “New heuristic algorithms for the rectangular p -cover problem”

Interpretation and optimization of the k -means algorithm

Kristian Sabo, Rudolf Scitovski (2014)

Applications of Mathematics

Similarity:

The paper gives a new interpretation and a possible optimization of the well-known k -means algorithm for searching for a locally optimal partition of the set 𝒜 = { a i ∈ ℝ n : i = 1 , ⋯ , m } which consists of k disjoint nonempty subsets π 1 , ⋯ , π k , 1 ≤ k ≤ m . For this purpose, a new divided k -means algorithm was constructed as a limit case of the known smoothed k -means algorithm. It is shown that the algorithm constructed in this way coincides with the k -means algorithm if during the iterative procedure no data points appear in the...

Consensus clustering with differential evolution

Miroslav Sabo (2014)

Kybernetika

Similarity:

Consensus clustering algorithms are used to improve properties of traditional clustering methods, especially their accuracy and robustness. In this article, we introduce our approach that is based on a refinement of the set of initial partitions and uses differential evolution algorithm in order to find the most valid solution. Properties of the algorithm are demonstrated on four benchmark datasets.