Search engine for discovering works of Art, research articles, and books related to Art and Culture
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...
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...
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 ...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
Clustering is the process of arranging comparable data elements into groups. One of the most frequent data mining analytical techniques is clustering analysis; the clustering algor...
Research on a microseismic signal picking algorithm based on GTOA clustering
Research on a microseismic signal picking algorithm based on GTOA clustering
Abstract. Clustering is one of the challenging problems in machine learning. Adopting clustering methods for the picking of microseismic signals has emerged as a new approach. Howe...
Hamiltonian formulations of centroid-based clustering
Hamiltonian formulations of centroid-based clustering
Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to dete...
Clustering Analysis of Data with High Dimensionality
Clustering Analysis of Data with High Dimensionality
Clustering analysis has been widely applied in diverse fields such as data mining, access structures, knowledge discovery, software engineering, organization of information systems...