1227 search results - page 14 / 246 » Approximate Kernel Clustering |
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian mixture density e...
NN
2006
Springer
14 years 9 months ago
2006
Springer
We introduce a new learning algorithm for topographic map formation of Edgeworth-expanded Gaussian activation kernels. In order to avoid the rapid increase in kernel parameters, a...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
MLDM
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...