14 search results - page 3 / 3 » Probabilistic clustering of time-evolving distance data |
NIPS
2007
13 years 6 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
MICAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
ECML
2001
Springer
13 years 9 months ago
2001
Springer
In many applications, modelling techniques are necessary which take into account the inherent variability of given data. In this paper, we present an approach to model class speci...