超级会员免费看
本文介绍了数据挖掘中的一些聚类算法，包括CURE、SNN和ROCK。CURE是一种能够处理任意形状和大小的聚类的层次聚类方法，通过代表点来改善噪声和离群点的问题。SNN算法基于共享最近邻，通过计算相似矩阵和共享邻居来构建聚类。ROCK则适用于具有分类和布尔属性的数据。这些算法各有特点，适用于不同场景和数据集。
文章目录
Hierarchical clustering: revisited
- create nested clusters
- agglomerative clustering algorithms vary in terms of how the proximity of two clusters are computed
- MIN(single link): susceptible to noise/outliers
- MAX/GROUP AVERAGE: may not work well with non-globular clusters
- CURE algorithm tries to handle both problems
- Often starts with a proximity matrix
- a type of graph-based algorithm
CURE: another hierarchical approach
- uses a number of points to represent a cluster
- Representative points are found by selecting a constant number of points from a cluster and then “shrinking” them toward the center of the cluster
- Cluster similarity is the similarity of the closest pair of representative points from different clusters
Shrinking
订阅专栏 解锁全文
1629
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
