847 search results - page 13 / 170 » Approximation algorithms for projective clustering |
JMM2
2007
13 years 8 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
NN
2002
Springer
13 years 8 months ago
2002
Springer
A new neural network architecture (PART) and the resulting algorithm are proposed to
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
COCOON
2010
Springer
14 years 1 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...