Javascript must be enabled to continue!
On fuzzification and optimization problems of clustering indices
View through CrossRef
Results of clustering are qualitatively evaluated by quantities called clustering indices. While many clustering indices are proposed, in B. Desgraupes [Clustering Indices (2016)], Desgraupes reviewed 27 indices, most of which are applicable only to crisp clustering and only one of which is applicable to fuzzy clustering. In the previous article [D. R. Sope and M. Fujio, On a fuzzification of clustering indices, in Proc. Fuzzy System Symposium of the Japan Intelligent Information Fuzzy Society, Vol. 35 (2002), pp. 443–448], the authors gazed on analytic 3 indices among them and modified them to fit fuzzy clustering by regarding the membership degrees as distribution functions of objects over clusters. In this paper, this method called fuzzification, is applied to all the indices of Desgraupes. This investigation also includes optimization of indices. A significant benefit of fuzzy clustering is that the membership degrees allow the optimization problems to be treated as continuous, whereas the ones in the crisp case are discrete, making it generally easier to solve. After giving a precise description of fuzzification which is briefly given in D. R. Sope and M. Fujio [On a fuzzification of clustering indices, in Proc. Fuzzy System Symposium of the Japan Intelligent Information Fuzzy Society, Vol. 35 (2002), pp. 443–448], the authors fuzzify all of 27 indices of Desgraupes and then solve the fuzzy clustering problems having 13 analytic indices among them as the objective functions by the gradient method.
World Scientific Pub Co Pte Ltd
Title: On fuzzification and optimization problems of clustering indices
Description:
Results of clustering are qualitatively evaluated by quantities called clustering indices.
While many clustering indices are proposed, in B.
Desgraupes [Clustering Indices (2016)], Desgraupes reviewed 27 indices, most of which are applicable only to crisp clustering and only one of which is applicable to fuzzy clustering.
In the previous article [D.
R.
Sope and M.
Fujio, On a fuzzification of clustering indices, in Proc.
Fuzzy System Symposium of the Japan Intelligent Information Fuzzy Society, Vol.
35 (2002), pp.
443–448], the authors gazed on analytic 3 indices among them and modified them to fit fuzzy clustering by regarding the membership degrees as distribution functions of objects over clusters.
In this paper, this method called fuzzification, is applied to all the indices of Desgraupes.
This investigation also includes optimization of indices.
A significant benefit of fuzzy clustering is that the membership degrees allow the optimization problems to be treated as continuous, whereas the ones in the crisp case are discrete, making it generally easier to solve.
After giving a precise description of fuzzification which is briefly given in D.
R.
Sope and M.
Fujio [On a fuzzification of clustering indices, in Proc.
Fuzzy System Symposium of the Japan Intelligent Information Fuzzy Society, Vol.
35 (2002), pp.
443–448], the authors fuzzify all of 27 indices of Desgraupes and then solve the fuzzy clustering problems having 13 analytic indices among them as the objective functions by the gradient method.
Related Results
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...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...
Optimizing machine learning techniques for genomics clustering
Optimizing machine learning techniques for genomics clustering
Optimisation des techniques d’apprentissage automatique pour le clustering génomique
Dans le domaine de la bioinformatique, le clustering est une technique efficace...
Intelligent clustering using moth flame optimizer for vehicular ad hoc networks
Intelligent clustering using moth flame optimizer for vehicular ad hoc networks
Vehicular ad hoc networks consist of access points for communication, transmission, and collecting information of nodes and environment for managing traffic loads. Clustering can b...
A Novel Semi-Supervised Fuzzy C-Means Clustering Algorithm Using Multiple Fuzzification Coefficients
A Novel Semi-Supervised Fuzzy C-Means Clustering Algorithm Using Multiple Fuzzification Coefficients
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 in...
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
<p>Clustering is an important technique for data analysis and knowledge discovery. In the context of big data, the density-based clustering algorithm faces three challenging ...
Efektivitas Penerapan Teknik Clustering Terhadap Keterampilan Menulis Puisi Bebas Siswa Sekolah Dasar Gugus IV Kecamatan Biringkanaya Kota Makassar
Efektivitas Penerapan Teknik Clustering Terhadap Keterampilan Menulis Puisi Bebas Siswa Sekolah Dasar Gugus IV Kecamatan Biringkanaya Kota Makassar
Penelitian ini bertujuan untuk mendeskripsikan keefektifan penerapan teknik Clustering, mengetahui gambaran keterampilan menulis puisi bebas siswa, menguji keefektifan penerapan te...

