scholarly journals An Adaptive Multiobjective Genetic Algorithm with Fuzzy c-Means for Automatic Data Clustering

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Ze Dong ◽  
Hao Jia ◽  
Miao Liu
Keyword(s):  
Genetic Algorithm ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Majority Vote ◽  
Clustering Algorithms ◽  
Nsga Ii ◽  
Number Of Clusters ◽  
Automatic Data ◽  
Multiobjective Genetic Algorithm ◽  
Fuzzy Clustering Method

This paper presents a fuzzy clustering method based on multiobjective genetic algorithm. The ADNSGA2-FCM algorithm was developed to solve the clustering problem by combining the fuzzy clustering algorithm (FCM) with the multiobjective genetic algorithm (NSGA-II) and introducing an adaptive mechanism. The algorithm does not need to give the number of clusters in advance. After the number of initial clusters and the center coordinates are given randomly, the optimal solution set is found by the multiobjective evolutionary algorithm. After determining the optimal number of clusters by majority vote method, the Jm value is continuously optimized through the combination of Canonical Genetic Algorithm and FCM, and finally the best clustering result is obtained. By using standard UCI dataset verification and comparing with existing single-objective and multiobjective clustering algorithms, the effectiveness of this method is proved.

scholarly journals A novel bidirectional clustering algorithm based on local density

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Baicheng Lyu ◽  
Wenhua Wu ◽  
Zhiqiang Hu
Keyword(s):  
Clustering Algorithm ◽  
Local Density ◽  
Clustering Algorithms ◽  
Cluster Number ◽  
Denoising Method ◽  
Number Of Clusters ◽  
Data Points ◽  
Cutoff Distance ◽  
Large Clusters ◽  
Small Clusters

AbstractWith the widely application of cluster analysis, the number of clusters is gradually increasing, as is the difficulty in selecting the judgment indicators of cluster numbers. Also, small clusters are crucial to discovering the extreme characteristics of data samples, but current clustering algorithms focus mainly on analyzing large clusters. In this paper, a bidirectional clustering algorithm based on local density (BCALoD) is proposed. BCALoD establishes the connection between data points based on local density, can automatically determine the number of clusters, is more sensitive to small clusters, and can reduce the adjusted parameters to a minimum. On the basis of the robustness of cluster number to noise, a denoising method suitable for BCALoD is proposed. Different cutoff distance and cutoff density are assigned to each data cluster, which results in improved clustering performance. Clustering ability of BCALoD is verified by randomly generated datasets and city light satellite images.

AN EXTENDED FUZZY CLUSTERING ALGORITHM AND ITS APPLICATION

1995 ◽  
Vol 05 (02) ◽  
pp. 239-259
Author(s):  
SU HWAN KIM ◽  
SEON WOOK KIM ◽  
TAE WON RHEE
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Main Memory ◽  
Color Image Segmentation ◽  
Occurrence Rate ◽  
Secondary Memory ◽  
Worst Case ◽  
Memory Space ◽  
Fuzzy Clustering Algorithm

For data analyses, it is very important to combine data with similar attribute values into a categorically homogeneous subset, called a cluster, and this technique is called clustering. Generally crisp clustering algorithms are weak in noise, because each datum should be assigned to exactly one cluster. In order to solve the problem, a fuzzy c-means, a fuzzy maximum likelihood estimation, and an optimal fuzzy clustering algorithms in the fuzzy set theory have been proposed. They, however, require a lot of processing time because of exhaustive iteration with an amount of data and their memberships. Especially large memory space results in the degradation of performance in real-time processing applications, because it takes too much time to swap between the main memory and the secondary memory. To overcome these limitations, an extended fuzzy clustering algorithm based on an unsupervised optimal fuzzy clustering algorithm is proposed in this paper. This algorithm assigns a weight factor to each distinct datum considering its occurrence rate. Also, the proposed extended fuzzy clustering algorithm considers the degree of importances of each attribute, which determines the characteristics of the data. The worst case is that the whole data has an uniformly normal distribution, which means the importance of all attributes are the same. The proposed extended fuzzy clustering algorithm has better performance than the unsupervised optimal fuzzy clustering algorithm in terms of memory space and execution time in most cases. For simulation the proposed algorithm is applied to color image segmentation. Also automatic target detection and multipeak detection are considered as applications. These schemes can be applied to any other fuzzy clustering algorithms.

Kernel-Based Fuzzy Local Information Clustering Algorithm Self-integrating Non-Local Information

2021 ◽  
Author(s):  
Qiuyu Song ◽  
Chengmao Wu ◽  
Xiaoping Tian ◽  
Yue Song ◽  
Xiaokang Guo
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Integration Method ◽  
Clustering Algorithms ◽  
Noise Removal ◽  
Local Information ◽  
Gaussian Kernel ◽  
Distance Metric ◽  
High Noise ◽  
Non Local

Abstract The application of fuzzy clustering algorithms in image segmentation is a hot research topic nowadays. Existing fuzzy clustering algorithms have the following three problems: (1)The parameters of spatial information constraints can$'$t be selected adaptively; (2)The image corrupted by high noise can$'$t be segmented effectively; (3)It is difficult to achieve a balance between noise removal and detail preservation. In the fuzzy clustering based on the optimization model, the choice of distance metric is very important. Since the use of Euclidean distance will lead to sensitivity to outliers and noise, it is difficult to obtain satisfactory segmentation results, which will affect the clustering performance. This paper proposes an optimization algorithm based on the kernel-based fuzzy local information clustering integrating non-local information (KFLNLI). The algorithm adopts a self-integration method to introduce local and non-local information of images, which solves the common problems of current clustering algorithm. Firstly, the self-integration method solves the problem of selecting spatial constraint parameters. The algorithm uses continuous self-learning iteration to calculate the weight coefficients; Secondly, the distance metric uses Gaussian kernel function to induce the distance to further enhance the robustness against noise and the adaptivity of processing different images; Finally, both local and non-local information are introduced to achieve a segmentation effect that can eliminate most of the noise and retain the original details of the image. Experimental results show that the algorithm is superior to existing state-of-the-art fuzzy clustering-related algorithm in the presence of high noise.

scholarly journals Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients

Algorithms ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 158
Author(s):  
Tran Dinh Khang ◽  
Nguyen Duc Vuong ◽  
Manh-Kien Tran ◽  
Michael Fowler
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Methods ◽  
Clustering Method ◽  
Machine Learning Technique ◽  
Practical Applications ◽  
Fuzzy C Means ◽  
Fuzzy Clustering Method ◽  
Learning Technique ◽  
Fuzzy C Means Clustering

Clustering is an unsupervised machine learning technique with many practical applications that has gathered extensive research interest. Aside from deterministic or probabilistic techniques, fuzzy C-means clustering (FCM) is also a common clustering technique. Since the advent of the FCM method, many improvements have been made to increase clustering efficiency. These improvements focus on adjusting the membership representation of elements in the clusters, or on fuzzifying and defuzzifying techniques, as well as the distance function between elements. This study proposes a novel fuzzy clustering algorithm using multiple different fuzzification coefficients depending on the characteristics of each data sample. The proposed fuzzy clustering method has similar calculation steps to FCM with some modifications. The formulas are derived to ensure convergence. The main contribution of this approach is the utilization of multiple fuzzification coefficients as opposed to only one coefficient in the original FCM algorithm. The new algorithm is then evaluated with experiments on several common datasets and the results show that the proposed algorithm is more efficient compared to the original FCM as well as other clustering methods.

Fuzzified Even-Sized Clustering Based on Optimization

2018 ◽  
Vol 22 (4) ◽  
pp. 537-543 ◽  
Author(s):  
Kei Kitajima ◽  
Yasunori Endo ◽  
Yukihiro Hamasuna ◽  
◽  
◽  
...  
Keyword(s):  
Data Analysis ◽  
Fuzzy Clustering ◽  
Cluster Size ◽  
Clustering Algorithm ◽  
Clustering Method ◽  
Numerical Examples ◽  
Fuzzy Clustering Method

Clustering is a method of data analysis without the use of supervised data. Even-sized clustering based on optimization (ECBO) is a clustering algorithm that focuses on cluster size with the constraints that cluster sizes must be the same. However, this constraints makes ECBO inconvenient to apply in cases where a certain margin of cluster size is allowed. It is believed that this issue can be overcome by applying a fuzzy clustering method. Fuzzy clustering can represent the membership of data to clusters more flexible. In this paper, we propose a new even-sized clustering algorithm based on fuzzy clustering and verify its effectiveness through numerical examples.

scholarly journals Single-reservoir operating rules for a year using multiobjective genetic algorithm

2008 ◽  
Vol 10 (2) ◽  
pp. 163-179 ◽  
Author(s):  
Taesoon Kim ◽  
Jun-Haeng Heo ◽  
Deg-Hyo Bae ◽  
Jin-Hoon Kim
Keyword(s):  
Genetic Algorithm ◽  
Piecewise Linear ◽  
Search Space ◽  
Optimization Method ◽  
Optimal Number ◽  
Current Status ◽  
Nsga Ii ◽  
Multiobjective Genetic Algorithm ◽  
Operating Rules ◽  
Operating Rule

A monthly operating rule for single-reservoir operation is developed in this study. Synthetic inflow data over 100 years are generated by using a time series model, AR(1), and piecewise-linear operating rules consisting of 4 and 5 linear lines are found using the implicit stochastic optimization method. In order to consider multiobjective functions in reservoir system operation, a multiobjective genetic algorithm (NSGA-II) is adopted to obtain the optimization results. The search space of NSGA-II is carefully refined using frequency analysis of historical data, and the relationship between inflow and constraints is also investigated. It is determined that 4 and 5 segments are the optimal number of segments for the piecewise-linear operating rule, and the effect of random number seeding on NSGA-II is evaluated. Six years of historical inflow data are used for the simulation model and the results show that the developed operating rule would handle various inflow series. As a result, probabilistic reservoir storage forecasts can be provided to a system operator so as to enable the operator to evaluate the current status of a reservoir quantitatively.

A Dynamic Genetic Algorithm for Clustering Problems

2013 ◽  
Vol 411-414 ◽  
pp. 1884-1893
Author(s):  
Yong Chun Cao ◽  
Ya Bin Shao ◽  
Shuang Liang Tian ◽  
Zheng Qi Cai
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Life ◽  
Search Space ◽  
Adaptive Mutation ◽  
Data Sets ◽  
Data Set ◽  
Local Optima ◽  
Clustering Problems

Due to many of the clustering algorithms based on GAs suffer from degeneracy and are easy to fall in local optima, a novel dynamic genetic algorithm for clustering problems (DGA) is proposed. The algorithm adopted the variable length coding to represent individuals and processed the parallel crossover operation in the subpopulation with individuals of the same length, which allows the DGA algorithm clustering to explore the search space more effectively and can automatically obtain the proper number of clusters and the proper partition from a given data set; the algorithm used the dynamic crossover probability and adaptive mutation probability, which prevented the dynamic clustering algorithm from getting stuck at a local optimal solution. The clustering results in the experiments on three artificial data sets and two real-life data sets show that the DGA algorithm derives better performance and higher accuracy on clustering problems.

scholarly journals Extracting physical homogeneous regions out of irrigation networks using fuzzy clustering method: a case study for the Ghazvin canal irrigation network

2010 ◽  
Vol 13 (4) ◽  
pp. 652-660 ◽  
Author(s):  
M. J. Monem ◽  
S. M. Hashemy
Keyword(s):  
Fuzzy Clustering ◽  
Spatial Clustering ◽  
Clustering Algorithms ◽  
Spatial Diversity ◽  
Optimal Number ◽  
Irrigation Network ◽  
Irrigation Networks ◽  
Fuzzy Clustering Method ◽  
Physical Attributes ◽  
Homogeneous Regions

Improving the current operation and maintenance activities is one of the main steps in achieving higher performance of irrigation networks. Improving the irrigation network management, influenced by different spatial and temporal parameters, is confronted with special difficulties. One of the controversial issues often faced by decision-makers is how to cope with the spatial diversity of irrigation systems. Homogeneous area detection out of the irrigation networks could improve the current management of networks. The idea behind this research is to present a quantitative benchmark for exploring the homogeneous areas with similar physical attributes out of the network region. Five physical attributes, such as length, capacity, number of intakes, number of conveyance structures and the covered irrigated area for each canal reach, are used for spatial clustering. Two fuzzy clustering algorithms, namely FCM and GK, are applied to the Ghazvin irrigation network. Using a clustering validity index, SC, shows that the GK algorithm is the more appropriate tool for clustering of the considered dataset. According to the results the optimal number of clusters for the Ghazvin irrigation project is derived as nine clusters and the irrigated district is classified into nine homogeneous areas. Physical homogeneous regions provide a context for better and easier decision-making.

Sign in / Sign up

Export Citation Format

Share Document