Search Results for author:
Found 2 papers, 0 papers with code
A Theoretical and Experimental Comparison of the EM and SEM Algorithm
In this paper we provide a new analysis of the SEM algorithm.
Analysis of Agglomerative Clustering
Assuming that the dimension $d$ is a constant, we show that for any $k$ the solution computed by this algorithm is an $O(\log k)$-approximation to the diameter $k$-clustering problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
