- The Unsupervised Learning Workshop
- Aaron Jones Christopher Kruger Benjamin Johnston
- 170字
- 2021-06-18 18:12:50
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.
- Aftershot Pro:Non-destructive photo editing and management
- Learning AngularJS Animations
- 辦公通信設備維修
- Intel FPGA/CPLD設計(高級篇)
- Mastering Manga Studio 5
- AMD FPGA設計優化寶典:面向Vivado/SystemVerilog
- Large Scale Machine Learning with Python
- 計算機組裝與維修技術
- VCD、DVD原理與維修
- 分布式微服務架構:原理與實戰
- Spring Cloud微服務架構實戰
- 單片機系統設計與開發教程
- Creating Flat Design Websites
- BeagleBone Robotic Projects
- Blender Quick Start Guide