847 search results - page 17 / 170 » Approximation algorithms for projective clustering |
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...