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

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.

主站蜘蛛池模板: 克东县| 西华县| 内江市| 常熟市| 根河市| 武强县| 大冶市| 泰来县| 乌海市| 边坝县| 建湖县| 景谷| 吉林省| 锡林浩特市| 泌阳县| 盐源县| 襄垣县| 城步| 阿图什市| 丹阳市| 沈丘县| 图们市| 大同县| 漠河县| 平原县| 莱西市| SHOW| 福贡县| 赤壁市| 乌鲁木齐县| 荣昌县| 农安县| 宜宾县| 敦化市| 道孚县| 洛南县| 泉州市| 社会| 靖西县| 班戈县| 亚东县|