原书出处
Introduction to Algorithms, Fourth Edition
33 第33章 机器学习算法
he example in Figure 33.1, each capital x has its latitude in x1 and its longitude in x2.
In order to cluster similar points together, we need to define similarity. Instead, let’s define the opposite: the dissimilarity Δ(x, y) of points x and y is the squared Euclidean distance between them: Of course, for Δ(x, y) to be well defined, all attribute values must be present. If any are missing, then you might just ignore that example, or you could fill in a missing attribute value with the median value for that attribute. The attribute values are often “messy” in other ways, so that some “data cleaning” is necessary before the clustering algorithm is run. For example, the scale
of attribute values can vary widely across attributes. In the example of Figure 33.1, the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter033.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea