官术网_书友最值得收藏!

  • The Unsupervised Learning Workshop
  • Aaron Jones Christopher Kruger Benjamin Johnston
  • 314字
  • 2021-06-18 18:12:52

k-means versus Hierarchical Clustering

In the previous chapter, we explored the merits of k-means clustering. Now, it is important to explore where hierarchical clustering fits into the picture. As we mentioned in the Linkage section, there is some potential direct overlap when it comes to grouping data points together using centroids. Universal to all of the approaches we've mentioned so far is the use of a distance function to determine similarity. Due to our in-depth exploration in the previous chapter, we used the Euclidean distance here, but we understand that any distance function can be used to determine similarities.

In practice, here are some quick highlights for choosing one clustering method over another:

  • Hierarchical clustering benefits from not needing to pass in an explicit "k" number of clusters a priori. This means that you can find all the potential clusters and decide which clusters make the most sense after the algorithm has completed.
  • The k-means clustering benefits from a simplicity perspective – oftentimes, in business use cases, there is a challenge when it comes to finding methods that can be explained to non-technical audiences but are still accurate enough to generate quality results. k-means can easily fill this niche.
  • Hierarchical clustering has more parameters to tweak than k-means clustering when it comes to dealing with abnormally shaped data. While k-means is great at finding discrete clusters, it can falter when it comes to mixed clusters. By tweaking the parameters in hierarchical clustering, you may find better results.
  • Vanilla k-means clustering works by instantiating random centroids and finding the closest points to those centroids. If they are randomly instantiated in areas of the feature space that are far away from your data, then it can end up taking quite some time to converge, or it may never even get to that point. Hierarchical clustering is less prone to falling prey to this weakness.
主站蜘蛛池模板: 罗定市| 东丽区| 巧家县| 轮台县| 华安县| 乌拉特后旗| 南华县| 大同市| 青神县| 宣城市| 湾仔区| 洪泽县| 巴青县| 遵义县| 宣武区| 和硕县| 永泰县| 新安县| 洛隆县| 甘洛县| 阿合奇县| 门头沟区| 城固县| 鄂尔多斯市| 沈丘县| 北京市| 方城县| 正定县| 绥化市| 苍溪县| 昌乐县| 遂溪县| 定襄县| 周至县| 广平县| 香格里拉县| 民权县| 大悟县| 唐山市| 浏阳市| 怀来县|