返回
An efficient Nystrom spectral clustering algorithm using incomplete Cholesky decomposition
DOI:10.1016/j.eswa.2021.115813.png)
摘要
En 中文
Nystrom method can estimate the eigenvectors of a large kernel matrix with the eigenvectors of a small sampled sub-matrix. However, we may encounter two problems when using Nystrom method to speed up spectral clustering: one problem is the approximate eigenvectors generated by standard Nystrom method are sub-optimal, so they may impair the performance of spectral clustering; another one is the accurate Nystrom approximation needs a sufficient number of samples, which will increase the eigen-decomposition cost on the sampled sub-matrix. To solve these problems, this paper proposes an efficient Nystrom spectral clustering algorithm using incomplete Cholesky decomposition, in which a new matrix factorization strategy is designed for Nystrom spectral clustering to meet the orthogonal constraints, and an efficient eigensolver based on incomplete Cholesky decomposition is developed to accelerate the Nystrom approximation. In this way, the obtained approximate orthogonal eigenvectors will help to improve the clustering quality, and the developed eigenvector calculation method will help to reduce the clustering complexity. The experimental results show that the proposed algorithm performs well on many challenging data sets, and it can accomplish more complex clustering tasks with limited computing resources.
Keyword:
Spectral clustering
Nystrom approximation
Incomplete Cholesky decomposition
Large data set
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Effect of bake hardening treatment on the mechanical behaviors of aluminum alloy spot welding joints
Multiple graph semi-supervised clustering with automatic calculation of graph associations
NEUROCOMPUTING
IF6.5

