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

Clusters as Neighborhoods

Until now, we have explored the concept of likeness being described as a function of Euclidean distance – data points that are closer to any one point can be seen as similar, while those that are further away in Euclidean space can be seen as dissimilar. This notion is seen once again in the DBSCAN algorithm. As alluded to by the lengthy name, the DBSCAN approach expands upon basic distance metric evaluation by also incorporating the notion of density. If there are clumps of data points that all exist in the same area as one another, they can be seen as members of the same cluster:

Figure 3.1: Neighbors have a direct connection to clusters

In the preceding figure, we can see four neighborhoods. The density-based approach has a number of benefits when compared to the past approaches we've covered that focus exclusively on distance. If you were just focusing on distance as a clustering threshold, then you may find your clustering makes little sense if faced with a sparse feature space with outliers. Both k-means and hierarchical clustering will automatically group together all data points in the space until no points are left.

While hierarchical clustering does provide a path around this issue somewhat, since you can dictate where clusters are formed using a dendrogram post-clustering run, k-means is the most susceptible to failure as it is the simplest approach to clustering. These pitfalls are less evident when we begin evaluating neighborhood approaches to clustering. In the following dendrogram, you can see an example of the pitfall where all data points are grouped together. Clearly, as you travel down the dendrogram, there is a lot of potential variation that gets grouped together since every point needs to be a member of a cluster. This is less of an issue with neighborhood-based clustering:

Figure 3.2: Example dendrogram

By incorporating the notion of neighbor density in DBSCAN, we can leave outliers out of clusters if we choose to, based on the hyperparameters we choose at runtime. Only the data points that have close neighbors will be seen as members within the same cluster, and those that are farther away can be left as unclustered outliers.

主站蜘蛛池模板: 娱乐| 东明县| 栾川县| 新安县| 都江堰市| 阿拉尔市| 新津县| 丰顺县| 盐亭县| 安多县| 商河县| 静海县| 乐安县| 南康市| 辽阳市| 舟山市| 西峡县| 桂平市| 江都市| 盖州市| 遂平县| 榕江县| 徐闻县| 东港市| 桦南县| 余江县| 湛江市| 曲麻莱县| 海晏县| 芷江| 富裕县| 洛南县| 正宁县| 阜新市| 雷州市| 彩票| 承德市| 汉川市| 普安县| 巩留县| 保康县|