申请试用
HOT
登录
注册
 
Spectral Clustering

Spectral Clustering

深度递归
/
发布于
/
2001
人观看
Spectral Clustering Algorithms Three basic stages: 1) Pre-processing Construct a matrix representation of the graph 2) Decomposition Compute eigenvalues and eigenvectors of the matrix Map each point to a lower-dimensional representation based on one or more eigenvectors 3) Grouping Assign points to two or more clusters, based on the new representation
10 点赞
3 收藏
0下载
相关文档
确认
3秒后跳转登录页面
去登陆