Spectral Clustering(谱聚类)
Abstract
This article isn't finished yet...
Graph Partitioning
Bi-partitioning task
Minmal-cut¶
Normalized-cut¶
Criterion: Normalized-cut [Shi-Malik, '97]
Define: Connectivity between groups relative to the density of each group
The purpose of this criterion is to produce more balanced partitions.
Spectral Graph Theory:
Analyze the "spectrum" of matrix(s) representing
Spectrum: Eigenvectors
Abstract
If
Abstract
每一个特征向量表现了图的划分方式
What are some eigenvectors?
Spectral Partitioning Algorithm¶
算法流程¶
Pre-processing¶
根据图构建拉普拉斯矩阵
Decomposition¶
*分解
求