524 search results - page 7 / 105 » On the Performance of Clustering in Hilbert Spaces |
144
click to vote
PODS
1997
ACM
15 years 2 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
SIGIR
2008
ACM
14 years 10 months ago
2008
ACM
In most IR clustering problems, we directly cluster the documents, working in the document space, using cosine similarity between documents as the similarity measure. In many real...
100
click to vote
TNN
2008
14 years 10 months ago
2008
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
109
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...