388 search results - page 14 / 78 » Convergence Properties of the K-Means Algorithms |
106
click to vote
SIAMJO
2010
14 years 6 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
FOCM
2010
14 years 10 months ago
2010
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal mino...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper proposes a particle swarm multiobjective optimiser, max...
118
click to vote
FCS
2006
15 years 1 months ago
2006
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...
100
click to vote
TEC
2002
14 years 11 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...