Proximal Optimization for Fuzzy Subspace Clustering.

Communications in Computer and Information Science(2016)

引用 2|浏览3
暂无评分
摘要
This paper proposes a fuzzy partitioning subspace clustering algorithm that minimizes a variant of the FCM cost function with a weighted Euclidean distance and a penalty term. To this aim it considers the framework of proximal optimization. It establishes the expression of the proximal operator for the considered cost function and derives PFSCM, an algorithm combining proximal descent and alternate optimization. Experiments show the relevance of the proposed approach.
更多
查看译文
关键词
Fuzzy partitioning clustering,Subspace clustering,Proximal descent
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要