847 search results - page 25 / 170 » Approximation algorithms for projective clustering |
82
Voted
ICDM
2003
IEEE
15 years 4 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
109
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
106
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
ADC
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
CCCG
2010
15 years 15 days ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.