5595 search results - page 387 / 1119 » Approximation Algorithms for Clustering Problems |
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
171
click to vote
SIAMJO
2011
15 years 1 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
178
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
162
click to vote
CEC
2005
IEEE
16 years 12 days ago
2005
IEEE
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...
176
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...