Proximal Optimization for Fuzzy Subspace Clustering

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01364652
Contributor : Arthur Guillon <>
Submitted on : Monday, September 12, 2016 - 5:25:56 PM
Last modification on : Thursday, March 21, 2019 - 1:20:46 PM
Document(s) archivé(s) le : Tuesday, December 13, 2016 - 4:03:38 PM

File

ipmu-article.pdf
Files produced by the author(s)

Identifiers

Citation

Arthur Guillon, Marie-Jeanne Lesot, Christophe Marsala, Nikhil Pal. Proximal Optimization for Fuzzy Subspace Clustering. 16th International Conference on Information processing and Management of Uncertainty (IPMU 2016), Jun 2016, Eindhoven, Netherlands. pp.675-686, ⟨10.1007/978-3-319-40596-4_56⟩. ⟨hal-01364652⟩

Share

Metrics

Record views

213

Files downloads

266