- 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.
- 零點起飛學Xilinx FPG
- ATmega16單片機項目驅動教程
- 數字道路技術架構與建設指南
- The Applied AI and Natural Language Processing Workshop
- AMD FPGA設計優化寶典:面向Vivado/SystemVerilog
- 嵌入式系統中的模擬電路設計
- CC2530單片機技術與應用
- Blender Quick Start Guide
- 電腦橫機使用與維修
- 嵌入式系統原理及應用:基于ARM Cortex-M4體系結構
- 微服務實戰(Dubbox +Spring Boot+Docker)
- Building Machine Learning Systems with Python
- FPGA實戰訓練精粹
- 嵌入式系統設計大學教程(第2版)
- 筆記本電腦現場維修實錄