1227 search results - page 45 / 246 » Approximate Kernel Clustering |
117
click to vote
DAGM
2011
Springer
13 years 9 months ago
2011
Springer
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
73
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
RTCSA
2003
IEEE
15 years 3 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
176
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
ISAAC
2004
Springer
15 years 3 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...