Rank-Constrained Spectral Clustering With Flexible Embedding.

IEEE Transactions on Neural Networks and Learning Systems(2018)

引用 204|浏览106
暂无评分
摘要
Spectral clustering (SC) has been proven to be effective in various applications. However, the learning scheme of SC is suboptimal in that it learns the cluster indicator from a fixed graph structure, which usually requires a rounding procedure to further partition the data. Also, the obtained cluster number cannot reflect the ground truth number of connected components in the graph. To alleviate ...
更多
查看译文
关键词
Clustering algorithms,Laplace equations,Dimensionality reduction,Manifolds,Learning systems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要