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

A Novel Semi-Supervised Fuzzy C-Means Clustering Algorithm Using Multiple Fuzzification Coefficients

View through CrossRef
Clustering is an unsupervised machine learning method with many practical applications that has gathered extensive research interest. It is a technique of dividing data elements into clusters such that elements in the same cluster are similar. Clustering belongs to the group of unsupervised machine learning techniques, meaning that there is no information about the labels of the elements. However, when knowledge of data points is known in advance, it will be beneficial to use a semi-supervised algorithm. Within many clustering techniques available, fuzzy C-means clustering (FCM) is a common one. To make the FCM algorithm a semi-supervised method, it was proposed in the literature to use an auxiliary matrix to adjust the membership grade of the elements to force them into certain clusters during the computation. In this study, instead of using the auxiliary matrix, we proposed to use multiple fuzzification coefficients to implement the semi-supervision component. After deriving the proposed semi-supervised fuzzy C-means clustering algorithm with multiple fuzzification coefficients (sSMC-FCM), we demonstrated the convergence of the algorithm and validated the efficiency of the method through a numerical example.
Title: A Novel Semi-Supervised Fuzzy C-Means Clustering Algorithm Using Multiple Fuzzification Coefficients
Description:
Clustering is an unsupervised machine learning method with many practical applications that has gathered extensive research interest.
It is a technique of dividing data elements into clusters such that elements in the same cluster are similar.
Clustering belongs to the group of unsupervised machine learning techniques, meaning that there is no information about the labels of the elements.
However, when knowledge of data points is known in advance, it will be beneficial to use a semi-supervised algorithm.
Within many clustering techniques available, fuzzy C-means clustering (FCM) is a common one.
To make the FCM algorithm a semi-supervised method, it was proposed in the literature to use an auxiliary matrix to adjust the membership grade of the elements to force them into certain clusters during the computation.
In this study, instead of using the auxiliary matrix, we proposed to use multiple fuzzification coefficients to implement the semi-supervision component.
After deriving the proposed semi-supervised fuzzy C-means clustering algorithm with multiple fuzzification coefficients (sSMC-FCM), we demonstrated the convergence of the algorithm and validated the efficiency of the method through a numerical example.

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...
On fuzzification and optimization problems of clustering indices
On fuzzification and optimization problems of clustering indices
Results of clustering are qualitatively evaluated by quantities called clustering indices. While many clustering indices are proposed, in B. Desgraupes [Clustering Indices (2016)],...
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...
Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients
Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients
Clustering is an unsupervised machine learning technique with many practical applications that has gathered extensive research interest. Aside from deterministic or probabilistic t...
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...
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...
CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING
CHOOSING SEEDS FOR SEMI-SUPERVISED GRAPH BASED CLUSTERING
Though clustering algorithms have long history, nowadays clustering topic still attracts a lot of attention because of the need of efficient data analysis tools in many application...

Back to Top