3934 search results - page 57 / 787 » A monothetic clustering method |
IDA
2007
Springer
13 years 10 months ago
2007
Springer
The performance of K-means and Gaussian mixture model (GMM) clustering depends on the initial guess of partitions. Typically, clus∗ corresponding author 1
NIPS
2003
13 years 11 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
CVIU
1999
13 years 9 months ago
1999
An important problem in computer vision is to determine how features extracted from images are connected to an existing model. In this paper, we focus on solving the registration ...
PR
2010
13 years 8 months ago
2010
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
ICCD
2007
IEEE
14 years 6 months ago
2007
IEEE
Microarchitectural simulation is orders of magnitude slower than native execution. As more elements are accurately modeled, problems associated with slow simulation are further ex...