524 search results - page 3 / 105 » On the Performance of Clustering in Hilbert Spaces |
NIPS
2008
13 years 7 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
VLDB
2008
ACM
14 years 6 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
ADBIS
2000
Springer
13 years 9 months ago
2000
Springer
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose an independence criterion based on the eigenspectrum of covariance operators in reproducing kernel Hilbert spaces (RKHSs), consisting of an empirical estimate ...
NIPS
2003
13 years 7 months ago
2003
We consider the problem of reconstructing patterns from a feature map. Learning algorithms using kernels to operate in a reproducing kernel Hilbert space (RKHS) express their solu...