5595 search results - page 139 / 1119 » Approximation Algorithms for Clustering Problems |
146
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
141
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
146
Voted
COCO
2004
Springer
15 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
140
Voted
TON
2008
15 years 4 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
117
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...