5595 search results - page 185 / 1119 » Approximation Algorithms for Clustering Problems |
157
click to vote
CEC
2009
IEEE
16 years 24 days ago
2009
IEEE
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
160
click to vote
SIGIR
2006
ACM
15 years 12 months ago
2006
ACM
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
163
click to vote
WADS
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
155
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
145
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...