This problem is known as multimedia multicast routing and has been proved to be NP-complete. Some examples are provided to illustrate the effectiveness of this algorithm over conventional algorithms. 2010 Production and hosting by Elsevier B. A couple of weeks ago, here at The Data Science Lab we showed how Lloydâ€™s finding k value when pdf given can be used to cluster points using k-means with a simple python implementation.

A couple of weeks ago, here at The Data Science Lab we showed how Lloyd’s algorithm can be used to cluster points using k-means with a simple python implementation. We also produced interesting visualizations of the Voronoi tessellation induced by the clustering. Voronoi tessellation induced by the clustering. At the end of the post we hinted at some of the shortcomings of this clustering procedure. The basic k-means is an extremely simple and efficient algorithm.