Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Double Level Fuzzy Adversarial Clustering

View through CrossRef
While conventional Fuzzy C-means (FCM) clustering effectively learns fuzzy membership degrees (FMDs) indicating cluster belongingness probabilities, it faces critical limitations. Single Euclidean distance metric inadequately captures intrinsic sample structures. Moreover, non-fuzzy membership degrees (non-FMDs)---representing multi-label learning perspectives that quantify the likelihood of samples belonging to multiple clusters---have not been sufficiently leveraged to improve FMD estimation. To this end, this paper proposes a novel double level fuzzy adversarial (DLFA) clustering approach that exploits the interplay between FMD and non-FMD through a dual adversarial learning framework. At the fuzzy learning level, FMD and non-FMD establish an adversarial relationship by performing complementary fuzzy clustering operations. At the classifier learning level, they serve as outputs of distinct classifiers to guide adversarial training. This double level adversarial mechanism enforces mutual competition between the two learning streams, ultimately enhancing FCM's effectiveness. To capture richer sample structure, we introduce spectral rotation and scaling to integrate spectral information into FMD, enabling complementary structural representation. Furthermore, recognizing that non-FMD exhibits multi-peak characteristics akin to fuzzy multi-labels, we extend FCM by incorporating FMD results into the sample-prototype distance calculation. This strategy emphasizes samples with higher non-FMD values, thereby suppressing incorrect cluster assignments in FMD while amplifying correct ones, yielding more accurate membership estimation. Extensive experiments on 28 benchmark datasets demonstrate that DLFA achieves state-of-the-art clustering performance.
Title: Double Level Fuzzy Adversarial Clustering
Description:
While conventional Fuzzy C-means (FCM) clustering effectively learns fuzzy membership degrees (FMDs) indicating cluster belongingness probabilities, it faces critical limitations.
Single Euclidean distance metric inadequately captures intrinsic sample structures.
Moreover, non-fuzzy membership degrees (non-FMDs)---representing multi-label learning perspectives that quantify the likelihood of samples belonging to multiple clusters---have not been sufficiently leveraged to improve FMD estimation.
To this end, this paper proposes a novel double level fuzzy adversarial (DLFA) clustering approach that exploits the interplay between FMD and non-FMD through a dual adversarial learning framework.
At the fuzzy learning level, FMD and non-FMD establish an adversarial relationship by performing complementary fuzzy clustering operations.
At the classifier learning level, they serve as outputs of distinct classifiers to guide adversarial training.
This double level adversarial mechanism enforces mutual competition between the two learning streams, ultimately enhancing FCM's effectiveness.
To capture richer sample structure, we introduce spectral rotation and scaling to integrate spectral information into FMD, enabling complementary structural representation.
Furthermore, recognizing that non-FMD exhibits multi-peak characteristics akin to fuzzy multi-labels, we extend FCM by incorporating FMD results into the sample-prototype distance calculation.
This strategy emphasizes samples with higher non-FMD values, thereby suppressing incorrect cluster assignments in FMD while amplifying correct ones, yielding more accurate membership estimation.
Extensive experiments on 28 benchmark datasets demonstrate that DLFA achieves state-of-the-art clustering performance.

Related Results

Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Konstruksi Sistem Inferensi Fuzzy Menggunakan Subtractive Fuzzy C-Means pada Data Parkinson
Abstract. Fuzzy Inference System requires several stages to get the output, 1) formation of fuzzy sets, 2) formation of rules, 3) application of implication functions, 4) compositi...
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Generated Fuzzy Quasi-ideals in Ternary Semigroups
Here in this paper, we provide characterizations of fuzzy quasi-ideal in terms of level and strong level subsets. Along with it, we provide expression for the generated fuzzy quasi...
ω – SUBSEMIRING FUZZY
ω – SUBSEMIRING FUZZY
Mapping ρ is called a fuzzy subset of an empty set of S if ρ is the mapping from S to the closed interval [0,1]. A fuzzy subset ρ introduced into this paper is a fuzzy subset of se...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
New Approaches of Generalised Fuzzy Soft sets on fuzzy Codes and Its Properties on Decision-Makings
Background Several scholars defined the concepts of fuzzy soft set theory and their application on decision-making problem. Based on this concept, researchers defined the generalis...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...
An optimal communication in WSN enabled by fuzzy clustering and improved meta-heuristic model
An optimal communication in WSN enabled by fuzzy clustering and improved meta-heuristic model
Purpose Wireless sensor networks (WSN) have been widely adopted for various applications due to their properties of pervasive computing. It is necessary to prolong the WSN lifetime...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...

Back to Top