5595 search results - page 724 / 1119 » Approximation Algorithms for Clustering Problems |
262
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
208
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
229
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
177
click to vote
ACMSE
2006
ACM
16 years 24 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
195
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...