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

Clustering

Clustering is a technique for grouping similar instances into clusters according to some distance measures. The main idea is to put instances that are similar (that is, close to each other) into the same cluster, while keeping the dissimilar points (that is, the ones further apart from each other) in different clusters. An example of how clusters might look like is shown in the following diagram:

The clustering algorithms follow two fundamentally different approaches. The first is a hierarchical or agglomerative approach that first considers each point as its own cluster, and then iteratively merges the most similar clusters together. It stops when further merging reaches a predefined number of clusters, or if the clusters to be merged are spread over a large region.

The other approach is based on point assignment. First, initial cluster centers (that is, centroids) are estimated, for instance, randomly, and then, each point is assigned to the closest cluster, until all of the points are assigned. The most well known algorithm in this group is k-means clustering.

The k-means clustering either picks initial cluster centers as points that are as far as possible from one another, or (hierarchically) clusters a sample of data and picks a point that is the closest to the center of each of the k-clusters.

主站蜘蛛池模板: 工布江达县| 响水县| 涞水县| 福清市| 长海县| 镇安县| 义乌市| 滁州市| 水富县| 江孜县| 军事| 庄河市| 邯郸市| 肇源县| 濮阳县| 沾益县| 胶州市| 孝义市| 延寿县| 抚宁县| 郁南县| 泰安市| 卢湾区| 北安市| 马鞍山市| 阿克苏市| 克拉玛依市| 桐庐县| 蒲江县| 酉阳| 武平县| 斗六市| 共和县| 阳泉市| 务川| 科技| 通道| 洛川县| 疏附县| 阳西县| 拉孜县|