.png){kind=icon}
返回
A Sparse Spectral Clustering Framework via Multiobjective Evolutionary Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2015.2476359.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces sparse representation into spectral clustering and provides a sparse spectral clustering framework via a multiobjective evolutionary algorithm. In contrast to conventional spectral clustering, the main contribution of this paper is to construct the similarity matrix using a sparse representation approach by modeling spectral clustering as a constrained multiobjective optimization problem. Specific operators are designed to obtain a set of high quality solutions in the optimization process. Furthermore, we design a method to select a tradeoff solution from the Pareto front using a measurement called ratio cut based on an adjacency matrix constructed by all the nondominated solutions. We also extend the framework to the semi-supervised clustering field by using the semi-supervised information brought by the labeled samples to set some constraints or to guide the searching process. Experiments on commonly used datasets show that our approach outperforms four well-known similarity matrix construction methods in spectral clustering, and one multiobjective clustering algorithm. A practical application in image segmentation also demonstrates the efficiency of the proposed algorithm.
Keyword:
Constrained multiobjective evolutionary algorithm
similarity matrix
sparse representation
spectral clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation同时稀疏逼近的算法。第二部分: 凸松弛.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏
分享收藏Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏
查看更多内容