Wikipedia

Talk:Determining the number of clusters in a data set

This is an old revision of this page, as edited by Talgalili (talk | contribs) at 12:36, 20 June 2010 (→Not that common problem). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 15 years ago by Talgalili in topic Not that common problem
Learn more about this page
WikiProject iconStatistics Unassessed
WikiProject iconThis article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the importance scale.

Additional updates coming

Latest comment: 16 years ago1 comment1 person in discussion

A colleague will be adding details to the "Elbow method" and "Information criteria" subsections shortly. -JohnMeier (talk) 15:10, 9 April 2009 (UTC)Reply

Not that common problem

Latest comment: 15 years ago2 comments2 people in discussion

There are lots of alternative algorithms that do not require the specification of k beforehand. This is mostly a problem of k-means, k-medoids and the EM-algorithm. Pretty much none of the more recent algorithms has this parameter. --Chire2 (talk) 14:13, 7 May 2010 (UTC)Reply

Any examples for such algorithms? thanks. Talgalili (talk) 12:36, 20 June 2010 (UTC)Reply
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Determining_the_number_of_clusters_in_a_data_set&oldid=369167895"