Fuzzy style flat-based clustering

Document Type


Publication Date



The recently developed fuzzy style k-plane clustering (S-KPC) algorithm displays promising clustering quality by leveraging both similarities and distinguishable styles between samples on stylistic data. However, S-KPC becomes vulnerable to similar styles that are not easily distinguishable. In this study, a novel fuzzy style flat-based clustering (FSFC) algorithm is proposed to overcome this vulnerability. In FSFC, a style flat matrix (SFM) is designed to project samples onto appropriate flats while maintaining the styles of different clusters in a reasonable manner. Based on SFM, the core of FSFC is to learn the potentially intersecting manifold structures of clusters in the projected flat space to make samples with the same style close to the cluster center and simultaneously far away from the other cluster centers. Furthermore, the objective function of FSFC can provide scale flexibility for each flat in the projected flat space. In particular, the optimization problem of FSFC can be decomposed into a series of sub-problems about the flat parameters, which can be locally optimized using the concave-convex procedure (CCCP). Extensive experiments on both synthetic and real-world datasets demonstrate the competitive clustering performance of FSFC. Moreover, FSFC outperforms some state-of-the-art manifold clustering algorithms on six case studies about stylistic data.

Publication Title

Information Sciences



This document is currently not available here.