hierarchical Clustering VS Kmeans Clustering

answered 2013-07-31 02:41:41 -0600

updated 2013-07-31 02:53:28 -0600

Siegfried
1393 ●10 ●26

That is not bad the explanation of the differences between hierarchical and k-means clustering(page 46): http://www.lcb.uu.se/KBIB/materials/L1.pdf. And there is an rational thought about the using of hierarchical k-means (top-down hierarchical clustering using k-means iteratively) there. The advantage of one or the other method depends of the task's conditions.

edit flag offensive delete link

Comments

One of the differences between these two algorithms is number of center.In the Kmeans have to determine K param but in hierarchical clustering does not require specify K param & algorithm determines K param.Why in the opencv hierarchical Clustering have to send center Mat?

Mostafa Sataki ( 2013-07-31 03:29:40 -0600 )edit

If you mean flann::hierarchicalClustering in OpenCV it is a hierarchical k-means tree. You need to create a matrix for centers. The centers.rows will be the upper limit of clusters which you need. This matrix will contain the obtained centers of clusters.

red_sonya ( 2013-07-31 05:03:20 -0600 )edit

add a comment

hierarchical Clustering VS Kmeans Clustering

1 answer

Comments

Links

Question Tools

Stats

Related questions

hierarchical Clustering VS Kmeans Clustering edit

1 answer

Comments

Links

Question Tools

Stats

Related questions

hierarchical Clustering VS Kmeans Clustering