计算机科学 ›› 2012, Vol. 39 ›› Issue (5): 172-176.
• 数据库与数据挖掘 • 上一篇 下一篇
陈丽敏,杨静,张健沛
出版日期:
发布日期:
Online:
Published:
摘要: 传统谱聚类算法的诸多优点只适合小数据集。根据工aplacian矩阵的特点重新构造新的Gram矩阵,输入新构造矩阵的若千列,然后利用加速迭代法解决大数据集的谱聚类特征提取问题,使得在大数据集条件下,谱聚类算法只需要很小的空间复杂度就可达到非常快的计算速度。
关键词: 聚类,谱聚类,大规模数据集,加速迭代法,Laplacian矩阵
Abstract: The advantage of the traditional spectral clustering algorithm is applicable in the small scale data set. A new method was proposed in the light of the laplacian matrix characteristics. First, a new Gram matrix was reconstructed and some lies of the new matrix were needed, then the eigen-decomposition based on accelerating iterative method was solved. The calculation speed of the proposed method is very fast and the space complexity is small for large scale data set
Key words: Clustering, Spectral clustering, Large-scale data set, Accelerating iterative method, Laplacian matrix
陈丽敏,杨静,张健沛. 一种基于加速迭代的大数据集谱聚类方法[J]. 计算机科学, 2012, 39(5): 172-176. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2012/V39/I5/172
Cited