847 search results - page 57 / 170 » Approximation algorithms for projective clustering |
107
Voted
MP
2006
15 years 17 days ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
119
Voted
DEXAW
2010
IEEE
15 years 1 months ago
2010
IEEE
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
104
click to vote
DIS
2006
Springer
15 years 4 months ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...
109
Voted
SIAMNUM
2010
14 years 7 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
140
Voted
KDD
2003
ACM
16 years 1 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...