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

Introduction

In this chapter, we will expand on the basic ideas that we built in Chapter 1, Introduction to Clustering, by surrounding clustering with the concept of similarity. Once again, we will be implementing forms of the Euclidean distance to capture the notion of similarity. It is important to bear in mind that the Euclidean distance just happens to be one of the most popular distance metrics; it's not the only one. Through these distance metrics, we will expand on the simple neighbor calculations that we explored in the previous chapter by introducing the concept of hierarchy. By using hierarchy to convey clustering information, we can build stronger groupings that make more logical sense. Similar to k-means, hierarchical clustering can be helpful for cases such as customer segmentation or identifying similar product types. However, there is a slight benefit in being able to explain things in a clearer fashion with hierarchical clustering. In this chapter, we will outline some cases where hierarchical clustering can be the solution you're looking for.

主站蜘蛛池模板: 伊宁县| 芒康县| 那坡县| 栾川县| 洪洞县| 凯里市| 辉县市| 铁力市| 呼伦贝尔市| 佛冈县| 安徽省| 象州县| 山丹县| 通州市| 塔城市| 连南| 通山县| 黑龙江省| 寿宁县| 富锦市| 邯郸县| 星座| 泊头市| 长兴县| 万载县| 诏安县| 林州市| 邯郸市| 安新县| 永定县| 胶南市| 微博| 县级市| 长沙县| 乌鲁木齐县| 工布江达县| 文登市| 巴彦淖尔市| 镇坪县| 贡嘎县| 轮台县|