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

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.

主站蜘蛛池模板: 长阳| 霍州市| 镇安县| 藁城市| 桂阳县| 沂水县| 将乐县| 商河县| 修文县| 兰坪| 东乌| 临泉县| 和田市| 上思县| 车险| 怀来县| 石首市| 吕梁市| 遂昌县| 丹江口市| 玛纳斯县| 宜君县| 奈曼旗| 瑞安市| 新竹市| 洛南县| 资源县| 伊金霍洛旗| 磐石市| 雷州市| 奈曼旗| 高雄县| 林周县| 营山县| 凌海市| 常宁市| 上栗县| 西乡县| 故城县| 绥棱县| 连州市|