%0 Journal Article
%T Order Sensibility of Spectral Clustering on Input Data Sets<br>谱聚类算法对输入数据顺序的敏感性*
%A ZHU Qiang sheng
%A HE Hua can
%A ZHOU Yan quan
%A <br>朱强生
%A 何华灿
%A 周延泉
%J 计算机应用研究
%D 2007
%I 
%X Using tools from the matrix analysis,matrix representations of the spectral clustering algorithms was given.The corresponding matrixes getting from the different input order of the data set were similar to each other,so do the Laplacian matrixes.Then the matrixes Y whose columns were the top k eigenvectors of the Laplacian matrixes were similar to each other also.K-means algorithms using Y's row vectors as the clustering data set was one of the initialization-dependent algorithms.Then get the reason of why spectral clustering algorithms were sensitive to the input order of data set.
%K spectral clustering
%K affinity matrix
%K Laplacian matrix
%K order sensibility<br>谱聚类
%K 关联矩阵
%K 拉普拉斯矩阵
%K 顺序敏感性
%K 谱聚类算法
%K 输入数据
%K 敏感性
%K Sets
%K Data
%K Input
%K Clustering
%K Sensibility
%K 的选择
%K 对象
%K 平均算法
%K 行向量
%K 特征向量
%K 相似
%K Laplacian
%K 矩阵表示
%K Affinity
%K 数据输入
%K 发现
%K 过程
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=EF4AD2E7BFCF0B30D63A63AE72F11F30&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=E158A972A605785F&sid=95D537AC89B28832&eid=E84BBBDDD74F497C&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9