It is an implementation for expectation maximization algorithm that came with full graphs and plots for datasets. No complicated attributes to specify, and just run the scr ipt and enjoy!
K means segmentation method has an underlying assumption that each element cannot belong to two clusters at the same time. Sometimes, an element in transition area between two clusters are hard to define. This element may belong to multiple clusters
