期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Spectral clustering based on matrix perturbation theory 被引量:19
1
作者 TIAN Zheng LI XiaoBin JU YanWei 《Science in China(Series F)》 2007年第1期63-81,共19页
This paper exposes some intrlnsic chsracterlstlca of the spectral clustering method by using the tools from the mstrlx perturbation theory. We construct s welght mstrix of s graph and study Its elgenvalues and elgenve... This paper exposes some intrlnsic chsracterlstlca of the spectral clustering method by using the tools from the mstrlx perturbation theory. We construct s welght mstrix of s graph and study Its elgenvalues and elgenvectors. It shows that the number of clusters Is equal to the number of elgenvslues that are larger than 1, and the number of polnts In each of the clusters can be spproxlmsted by the associated elgenvslue. It also shows that the elgenvector of the weight rnatrlx can be used dlrectly to perform clusterlng; that Is, the dlrectlonsl angle between the two-row vectors of the mstrlx derlved from the elgenvectors Is s sultable distance measure for clustsrlng. As s result, an unsupervised spectral clusterlng slgorlthm based on welght mstrlx (USCAWM) Is developed. The experlmental results on s number of srtlficisl and real-world data sets show the correctness of the theoretical analysis. 展开更多
关键词 spectral clustering weight matrix spectrum of weight matrix number of the clusters unsupervised spectral clustering algorithm based on weight matrix
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部