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

Summary

In this chapter, we discussed how hierarchical clustering works and where it may be best employed. In particular, we discussed various aspects of how clusters can be subjectively chosen through the evaluation of a dendrogram plot. This is a huge advantage over k-means clustering if you have absolutely no idea of what you're looking for in the data. Two key parameters that drive the success of hierarchical clustering were also discussed: the agglomerative versus pisive approach and linkage criteria. Agglomerative clustering takes a bottom-up approach by recursively grouping nearby data together until it results in one large cluster. Divisive clustering takes a top-down approach by starting with the one large cluster and recursively breaking it down until each data point falls into its own cluster. Divisive clustering has the potential to be more accurate since it has a complete view of the data from the start; however, it adds a layer of complexity that can decrease the stability and increase the runtime.

Linkage criteria grapples with the concept of how distance is calculated between candidate clusters. We have explored how centroids can make an appearance again beyond k-means clustering, as well as single and complete linkage criteria. Single linkage finds cluster distances by comparing the closest points in each cluster, while complete linkage finds cluster distances by comparing more distant points in each cluster. With the knowledge that you have gained in this chapter, you are now able to evaluate how both k-means and hierarchical clustering can best fit the challenge that you are working on.

While hierarchical clustering can result in better performance than k-means due to its increased complexity, please remember that more complexity is not always good. Your duty as a practitioner of unsupervised learning is to explore all the options and identify the solution that is both resource-efficient and performant. In the next chapter, we will cover a clustering approach that will serve us best when it comes to highly complex and noisy data: Density-Based Spatial Clustering of Applications with Noise.

主站蜘蛛池模板: 蓬安县| 乌拉特后旗| 余庆县| 昌平区| 饶河县| 宾阳县| 尉犁县| 莆田市| 凉山| 呼玛县| 北宁市| 贵南县| 登封市| 皮山县| 榆树市| 梁平县| 万全县| 镇江市| 应城市| 江都市| 黑河市| 宜章县| 永泰县| 聂拉木县| 洪洞县| 密山市| 佛坪县| 深水埗区| 保山市| 米易县| 札达县| 凌云县| 云浮市| 无棣县| 治县。| 中山市| 新乡市| 芜湖市| 阳春市| 阿城市| 乐陵市|