Laplacian Regularization For Fuzzy Subspace Clustering

This paper studies a well-established fuzzy subspace clustering paradigm and identifies a discontinuity in the produced solutions, which assigns neighbor points to different clusters and fails to identify the expected subspaces in these situations. To alleviate this drawback, a regularization term is proposed, inspired from clustering tasks for graphs such as spectral clustering. A new cost function is introduced, and a new algorithm based on an alternate optimization algorithm, called Weighted Laplacian Fuzzy Clustering, is proposed and experimentally studied.