Displaying similar documents to “How the initialization affects the stability of the қ-means algorithm∗”

How the initialization affects the stability of the қ-means algorithm

Sébastien Bubeck, Marina Meilă, Ulrike von Luxburg (2012)

ESAIM: Probability and Statistics

Similarity:

We investigate the role of the initialization for the stability of the қ-means clustering algorithm. As opposed to other papers, we consider the actual қ-means algorithm (also known as Lloyd algorithm). In particular we leverage on the property that this algorithm can get stuck in local optima of the қ-means objective function. We are interested in the actual clustering, not only in the costs of the solution. We analyze when different initializations lead to the same local optimum, and...

A frictionless contact algorithm for deformable bodies

Olivier Pantz (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

This article is devoted to the presentation of a new contact algorithm for bodies undergoing finite deformations. We only address the kinematic aspect of the contact problem, that is the numerical treatment of the non-intersection constraint. In consequence, mechanical aspects like friction, adhesion or wear are not investigated and we restrict our analysis to the simplest frictionless case. On the other hand, our method allows us to treat contacts and self-contacts, thin or non-thin...

Extending the MAX Algorithm for Maximum Independent Set

Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

Parallelization of artificial immune systems using a massive parallel approach via modern GPUs

Khun, Jiří, Šimeček, Ivan

Similarity:

Parallelization is one of possible approaches for obtaining better results in terms of algorithm performance and overcome the limits of the sequential computation. In this paper, we present a study of parallelization of the opt-aiNet algorithm which comes from Artificial Immune Systems, one part of large family of population based algorithms inspired by nature. The opt-aiNet algorithm is based on an immune network theory which incorporates knowledge about mammalian immune systems in...