Improved large data spectral clustering algorithm based on sampling subspace constraint
On the basis of analyzing the equivalent function of the objective function of classical spectral clustering algorithm and the weighted kernel k-means objective function,an improved large-scale data spectrum clustring algorithm based on sampling subspace constraint was designed,the weighted kernel k...
Saved in:
Main Author: | Ru NIE |
---|---|
Format: | Article |
Language: | zho |
Published: |
Beijing Xintong Media Co., Ltd
2018-11-01
|
Series: | Dianxin kexue |
Subjects: | |
Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018277/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient Preference Clustering via Random Fourier Features
by: Jingshu Liu, et al.
Published: (2019-09-01) -
Kernelized correlation tracking based on point trajectories
by: Yunqiu LYU, et al.
Published: (2018-06-01) -
Local density-based similarity matrix construction for spectral clustering
by: Jian WU, et al.
Published: (2013-03-01) -
A Novel Clustering Technique for Efficient Clustering of Big Data in Hadoop Ecosystem
by: Sunil Kumar, et al.
Published: (2019-12-01) -
Big Data Analytics: A Tutorial of Some Clustering Techniques
by: Said Baadel
Published: (2021-09-01)