388 search results - page 19 / 78 » Convergence Properties of the K-Means Algorithms |
121
click to vote
JCP
2007
15 years 1 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
101
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Multiplicative update algorithms have encountered a great success to solve optimization problems with non-negativity constraints, such as the famous non-negative matrix factorizat...
120
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...