847 search results - page 73 / 170 » Approximation algorithms for projective clustering |
95
Voted
CIKM
2003
Springer
15 years 5 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
112
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...
149
Voted
COMGEO
2002
ACM
15 years 15 days ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
112
click to vote
SYNASC
2006
IEEE
15 years 6 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
118
Voted
ASPDAC
2010
ACM
14 years 10 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...