388 search results - page 19 / 78 » Convergence Properties of the K-Means Algorithms |
168
click to vote
JCP
2007
15 years 6 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...
155
click to vote
ICASSP
2011
IEEE
14 years 10 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...
169
click to vote
CDC
2010
IEEE
15 years 1 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 ...
151
click to vote
ICDM
2009
IEEE
16 years 24 days 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...
143
click to vote
GECCO
2006
Springer
15 years 9 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...