Spectrally Tuned Bandwidth Selection for Kernel Fuzzy Relational Clustering

Fuzzy clustering is used to identify overlapping geometric cluster structures through partial memberships.

However, classical methods are limited by the assumption of equal variable importance and by sensitivity to the fuzzifier parameter.

These limitations may yield equal cluster membership probabilities, which we refer to as the uniform solution.

To address these issues, we propose Kernel Fuzzy Relational Clustering (KFRC) equipped with a bandwidth selection algorithm tuned via the spectral properties of the induced kernel Gram matrix.

The KFRC framework implicitly performs unsupervised kernel metric learning by controlling the geometric embedding of the data through adjustable bandwidth parameters.

We conduct a formal stability analysis to identify the exact theoretical conditions under which relational clustering collapses, thereby ensuring the stable performance of KFRC.

We find that our two-stage bandwidth selection procedure adapts to the data structure while actively avoiding the uniform solution.

Furthermore, this theoretical analysis leads to the proposal of a novel fuzzifier function that presents distinct advantages over the power fuzzifier function.

We conduct experiments on several synthetic and publicly available data sets to demonstrate that the proposed framework consistently recovers complex structures that traditional methods fail to resolve, while ensuring a purely fuzzy solution.