How to optimal K in K - Means Algorithm [duplicate]

白昼怎懂夜的黑 提交于 2019-11-27 09:45:49

The base idea is to evaluate cluster scoring on sample data, usally it is distance inside cluster and distance between clusters. The more this measure the better clustering, based on this mesure you can select best clustring paramters. One of metrics can be found here http://alias-i.com/lingpipe/docs/api/com/aliasi/cluster/ClusterScore.html

Felix Kling

Seriously, what do you want to know? Do you want us to tell you some number? Or a strategy how to find the optimal k? You have to read a book or other resources about k-means, I'm pretty sure it is covered there.

There is something on Wikipedia about it:

http://en.wikipedia.org/wiki/Determining_the_number_of_clusters_in_a_data_set

Before you use an algorithm, read about it.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!