1161 search results - page 41 / 233 » Approximation schemes for clustering problems |
138
Voted
MCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
106
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
136
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
144
Voted
IPL
2007
15 years 3 months ago
2007
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
168
Voted
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...