期刊论文详细信息
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 卷:237
Sparse spectral clustering method based on the incomplete Cholesky decomposition
Article
Frederix, Katrijn1  Van Barel, Marc1 
[1] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Heverlee, Belgium
关键词: Spectral clustering;    Eigenvalue problem;    Graph Laplacian;    Structured matrices;   
DOI  :  10.1016/j.cam.2012.07.019
来源: Elsevier
PDF
【 摘 要 】

A novel sparse spectral clustering method using linear algebra techniques is proposed. Spectral clustering methods solve an eigenvalue problem containing a graph Laplacian. The proposed method exploits the structure of the Laplacian to construct an approximation, not in terms of a low rank approximation but in terms of capturing the structure of the matrix. With this approximation, the size of the eigenvalue problem can be reduced. To obtain the indicator vectors from the eigenvectors the method proposed by Zha et al. (2002) [26], which computes a pivoted LQ factorization of the eigenvector matrix, is adapted. This formulation also gives the possibility to extend the method to out-of-sample points. (C) 2012 Elsevier B.V. All rights reserved.

【 授权许可】

Free   

【 预 览 】
附件列表
Files Size Format View
10_1016_j_cam_2012_07_019.pdf 4748KB PDF download
  文献评价指标  
  下载次数:0次 浏览次数:0次