Editing Talk:2731: K-Means Clustering
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 22: | Line 22: | ||
There are two types of ''people'' in the world: those ''who'' use the word “who” to refer to people and the word “that” to refer to things, and those ''who'' don’t. [[Special:Contributions/172.71.151.77|172.71.151.77]] 02:58, 31 January 2023 (UTC) | There are two types of ''people'' in the world: those ''who'' use the word “who” to refer to people and the word “that” to refer to things, and those ''who'' don’t. [[Special:Contributions/172.71.151.77|172.71.151.77]] 02:58, 31 January 2023 (UTC) | ||
:...and those whom use "whom"..? [[Special:Contributions/172.70.162.57|172.70.162.57]] 09:00, 31 January 2023 (UTC) | :...and those whom use "whom"..? [[Special:Contributions/172.70.162.57|172.70.162.57]] 09:00, 31 January 2023 (UTC) | ||
− | |||
Methodological note: k-means is a special case of parametric model-based clustering (here spheres with equal variance) which allows to calculate cluster models with different number of clusters and choose the 'best' one according to the best BIC (Bayesian Information Criterion), see https://cran.r-project.org/package=mclust. A broader non-parametric class of cluster solutions can be fitted with the truecluster meta-algorithm and then choose the one with the best CIC (Cluster Information Criterion), see https://arxiv.org/abs/cs/0601001 and https://arxiv.org/abs/0705.4302. [[User:Joehl|Joehl]] ([[User talk:Joehl|talk]]) 16:55, 2 February 2023 (UTC) | Methodological note: k-means is a special case of parametric model-based clustering (here spheres with equal variance) which allows to calculate cluster models with different number of clusters and choose the 'best' one according to the best BIC (Bayesian Information Criterion), see https://cran.r-project.org/package=mclust. A broader non-parametric class of cluster solutions can be fitted with the truecluster meta-algorithm and then choose the one with the best CIC (Cluster Information Criterion), see https://arxiv.org/abs/cs/0601001 and https://arxiv.org/abs/0705.4302. [[User:Joehl|Joehl]] ([[User talk:Joehl|talk]]) 16:55, 2 February 2023 (UTC) |