October 10 2007

Euclidean Co-clustering Scheme 2 without Feature Clustering is K-means

In the previous posts, we have presented the results of some experiments about missing values robustness of SVC and Co-clustering.

A note about Co-clustering is dutiful: the Scheme number two of the Bregman Co-clustering without feature clustering and with Euclidean distance, is equal to the K-means algorithm.

Post a comment

This blog is multi language by p.osting.it's Babel