QQ客服 官方微博 反馈留言

	Fast spectral clustering of data using sequential matrix compression
	Chen, Bo ; Gao, Bin ; Liu, Tie-Van ; Chen, Yu-Fu ; Ma, Wei-Ying
	2006
英文摘要	Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first solve an eigenvalue decomposition problem to get the low-dimensional embedding of the data points, and then apply some heuristic methods such as k-means to get the desired clusters. However, eigenvalue decomposition is very time-consuming, making the overall complexity of spectral clustering very high, and thus preventing spectral clustering from being widely applied in large-scale problems. To tackle this problem, different from traditional algorithms, we propose a very fast and scalable spectral clustering algorithm called the sequential matrix compression (SMC) method. In this algorithm, we scale down the computational complexity of spectral clustering by sequentially reducing the dimension of the Laplacian matrix in the iteration steps with very little loss of accuracy. Experiments showed the feasibility and efficiency of the proposed algorithm. ? Springer-Verlag Berlin Heidelberg 2006.; EI; 0
语种	英语
出处	EI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/328082]
专题	数学科学学院
推荐引用方式 GB/T 7714	Chen, Bo,Gao, Bin,Liu, Tie-Van,et al. Fast spectral clustering of data using sequential matrix compression. 2006-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。