17390 search results - page 356 / 3478 » Distributed Data Clustering |
184
Voted
DAGM
2011
Springer
14 years 4 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...
160
click to vote
VLUDS
2010
14 years 11 months ago
2010
Large high-resolution displays combine the images of multiple smaller display devices to form one large display area. A total resolution that can easily comprise several hundred m...
178
click to vote
EMNLP
2011
14 years 4 months ago
2011
Context-dependent word similarity can be measured over multiple cross-cutting dimensions. For example, lung and breath are similar thematically, while authoritative and superfici...
330
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
110
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of learning mixtures of distributions, a natural formalization of clustering. A mixture of distributions is a collection of distributions D = {D1, . . . DT },...