کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4639509 1341238 2013 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Sparse spectral clustering method based on the incomplete Cholesky decomposition
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Sparse spectral clustering method based on the incomplete Cholesky decomposition
چکیده انگلیسی

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 LQLQ factorization of the eigenvector matrix, is adapted. This formulation also gives the possibility to extend the method to out-of-sample points.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 237, Issue 1, 1 January 2013, Pages 145–161
نویسندگان
, ,