Study of Combined Fuzzy Clustering Algorithm Based on F-Statistics Hierarchy Clustering

2010 ◽  
Vol 29-32 ◽  
pp. 802-808
Author(s):  
Min Min
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cluster Center ◽  
Evaluation Data ◽  
Fuzzy Clustering Algorithm ◽  
Initial Cluster ◽  
The Common ◽  
Common Problems ◽  
F Statistics

On analyzing the common problems in fuzzy clustering algorithms, we put forward the combined fuzzy clustering one, which will automatically generate a reasonable clustering numbers and initial cluster center. This clustering algorithm has been tested by real evaluation data of teaching designs. The result proves that the combined fuzzy clustering based on F-statistic is more effective.

scholarly journals Service Partition Method Based on Particle Swarm Fuzzy Clustering

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Hong Xia ◽  
Qingyi Dong ◽  
Hui Gao ◽  
Yanping Chen ◽  
ZhongMin Wang
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Particle Swarm ◽  
Cluster Center ◽  
Fuzzy Clustering Algorithm ◽  
Partition Method ◽  
Service Data ◽  
Optimal Cluster ◽  
Better Than

It is difficult to accurately classify a service into specific service clusters for the multirelationships between services. To solve this problem, this paper proposes a service partition method based on particle swarm fuzzy clustering, which can effectively consider multirelationships between services by using a fuzzy clustering algorithm. Firstly, the algorithm for automatically determining the number of clusters is to determine the number of service clusters based on the density of the service core point. Secondly, the fuzzy c -means combined with particle swarm optimization algorithm to find the optimal cluster center of the service. Finally, the fuzzy clustering algorithm uses the improved Gram-cosine similarity to obtain the final results. Extensive experiments on real web service data show that our method is better than mainstream clustering algorithms in accuracy.

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.

scholarly journals Extended Single-Iteration Fuzzy C-Means, and Gustafson-Kessel Algorithms for Medium-Sized (106) Multisource Weber Problem

2019 ◽  
Vol 10 (3) ◽  
pp. 1-15 ◽  
Author(s):  
Tarik Kucukdeniz ◽  
Sakir Esnaf ◽  
Engin Bayturk
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cluster Center ◽  
Medium Size ◽  
Weber Problem ◽  
Solution Approach ◽  
Fuzzy C Means ◽  
Novel Approach ◽  
New Facilities

An uncapacitated multisource Weber problem involves finding facility locations for known customers. When this problem is restated as finding locations for additional new facilities, while keeping the current facilities, a new solution approach is needed. In this study, two new and cooperative fuzzy clustering algorithms are developed to solve a variant of the uncapacitated version of a multisource Weber problem (MWP). The first algorithm proposed is the extensive version of the single iteration fuzzy c-means (SIFCM) algorithm. The SIFCM algorithm assigns customers to existing facilities. The new extended SIFCM (ESIFCM), which is first proposed in this study, allocates discrete locations (coordinates) with the SIFCM and locates and allocates continuous locations (coordinates) with the original FCM simultaneously. If the SIFCM and the FCM, show differences between the successive cluster center values are still decreasing, share customer points among facilities. It is simply explained as single-iteration fuzzy c-means with fuzzy c-means. The second algorithm, also proposed here, runs like the ESIFCM. Instead of the FCM, a Gustafson-Kessel (GK) fuzzy clustering algorithm is used under the same framework. This algorithm is based on single-iteration (SIGK) and the GK algorithms. Numerical results are reported using two MWP problems in a class of a medium-size-data (106 bytes). Using clustering algorithms to locate and allocate the new facilities while keeping current facilities is a novel approach. When applied to the big problems, the speed of the proposed algorithms enable to find a solution while mathematical programming solution is not doable due to the great computational costs.

Fuzzy C-Means Clustering Algorithm Based on Coefficient of Variation

2014 ◽  
Vol 998-999 ◽  
pp. 873-877
Author(s):  
Zhen Bo Wang ◽  
Bao Zhi Qiu
Keyword(s):  
Coefficient Of Variation ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Real Data ◽  
Cluster Center ◽  
Data Set ◽  
Fuzzy C Means ◽  
Initial Cluster ◽  
Fuzzy C Means Clustering ◽  
The Impact

To reduce the impact of irrelevant attributes on clustering results, and improve the importance of relevant attributes to clustering, this paper proposes fuzzy C-means clustering algorithm based on coefficient of variation (CV-FCM). In the algorithm, coefficient of variation is used to weigh attributes so as to assign different weights to each attribute in the data set, and the magnitude of weight is used to express the importance of different attributes to clusters. In addition, for the characteristic of fuzzy C-means clustering algorithm that it is susceptible to initial cluster center value, the method for the selection of initial cluster center based on maximum distance is introduced on the basis of weighted coefficient of variation. The result of the experiment based on real data sets shows that this algorithm can select cluster center effectively, with the clustering result superior to general fuzzy C-means clustering algorithms.

scholarly journals A novel self-learning weighted fuzzy local information clustering algorithm integrating local and non-local spatial information for noise image segmentation

2021 ◽  
Author(s):  
Qiuyu Song ◽  
Chengmao Wu ◽  
Xiaoping Tian ◽  
Yue Song ◽  
Xiaokang Guo
Keyword(s):  
Image Segmentation ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Local Information ◽  
Cluster Center ◽  
Fuzzy Clustering Algorithm ◽  
Robust Segmentation ◽  
Non Local ◽  
Self Learning

AbstractFuzzy clustering algorithm (FCM) can be directly used to segment images, it takes no account of the neighborhood information of the current pixel and does not have a robust segmentation noise suppression. Fuzzy Local Information C-means Clustering (FLICM) is a widely used robust segmentation algorithm, which combines spatial information with the membership degree of adjacent pixels. In order to further improve the robustness of FLICM algorithm, non-local information is embedded into FLICM algorithm and a fuzzy C-means clustering algorithm has local and non-local information (FLICMLNLI) is obtained. When calculating distance from pixel to cluster center, FLICMLNLI algorithm considers two distances from current pixel and its neighborhood pixels to cluster center. However, the algorithm gives the same weight to two different distances, which incorrectly magnifies the importance of neighborhood information in calculating the distance, resulting in unsatisfactory image segmentation effects and loss of image details. In order to solve this problem, we raise an improved self-learning weighted fuzzy algorithm, which directly obtains different weights in distance calculation through continuous iterative self-learning, then the distance metric with the weights obtained from self-learning is embedded in the objective function of the fuzzy clustering algorithm in order to improve the segmentation performance and robustness of the algorithm. A large number of experiments on different types of images show that the algorithm can not only suppress the noise but also retain the details in the image, the effect of segmenting complex noise images is better, and it provides better image segmentation results than the existing latest fuzzy clustering algorithms.

Incremental kernel fuzzy c-means with optimizing cluster center initialization and delivery

Kybernetes ◽  
2016 ◽  
Vol 45 (8) ◽  
pp. 1273-1291 ◽  
Author(s):  
Runhai Jiao ◽  
Shaolong Liu ◽  
Wu Wen ◽  
Biying Lin
Keyword(s):  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cluster Center ◽  
Accurate Information ◽  
Incremental Clustering ◽  
Data Set ◽  
Content Type ◽  
Fuzzy C Means ◽  
Initial Cluster

Purpose The large volume of big data makes it impractical for traditional clustering algorithms which are usually designed for entire data set. The purpose of this paper is to focus on incremental clustering which divides data into series of data chunks and only a small amount of data need to be clustered at each time. Few researches on incremental clustering algorithm address the problem of optimizing cluster center initialization for each data chunk and selecting multiple passing points for each cluster. Design/methodology/approach Through optimizing initial cluster centers, quality of clustering results is improved for each data chunk and then quality of final clustering results is enhanced. Moreover, through selecting multiple passing points, more accurate information is passed down to improve the final clustering results. The method has been proposed to solve those two problems and is applied in the proposed algorithm based on streaming kernel fuzzy c-means (stKFCM) algorithm. Findings Experimental results show that the proposed algorithm demonstrates more accuracy and better performance than streaming kernel stKFCM algorithm. Originality/value This paper addresses the problem of improving the performance of increment clustering through optimizing cluster center initialization and selecting multiple passing points. The paper analyzed the performance of the proposed scheme and proved its effectiveness.

scholarly journals A Novel Density Peak Fuzzy Clustering Algorithm for Moving Vehicles Using Traffic Radar

Electronics ◽  
2019 ◽  
Vol 9 (1) ◽  
pp. 46
Author(s):  
Lin Cao ◽  
Yunxiao Liu ◽  
Dongfeng Wang ◽  
Tao Wang ◽  
Chong Fu
Keyword(s):  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Cluster Center ◽  
Echo Signal ◽  
Density Peak ◽  
Fuzzy Clustering Algorithm ◽  
Moving Vehicles ◽  
Strong Robustness ◽  
Radar Echo ◽  
Density Peak Clustering

The detection of adjacent vehicles in highway scenes has the problem of inaccurate clustering results. In order to solve this problem, this paper proposes a new clustering algorithm, namely Spindle-based Density Peak Fuzzy Clustering (SDPFC) algorithm. Its main feature is to use the density peak clustering algorithm to perform initial clustering to obtain the number of clusters and the cluster center of each cluster. The final clustering result is obtained by a fuzzy clustering algorithm based on the spindle update. The experimental data are the radar echo signal collected in the real highway scenes. Compared with the DBSCAN, FCM, and K-Means algorithms, the algorithm has higher clustering accuracy in certain scenes. The average clustering accuracy of SDPFC can reach more than 95%. It is also proved that the proposed algorithm has strong robustness in certain highway scenes.

A fuzzy clustering algorithm based on hybrid surrogate model

2021 ◽  
pp. 1-14
Author(s):  
Maolin Shi ◽  
Zihao Wang ◽  
Lizhang Xu
Keyword(s):  
Fuzzy Clustering ◽  
Surrogate Model ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Surrogate Models ◽  
Support Vector ◽  
Fuzzy Clustering Algorithm ◽  
Regression Relationship ◽  
Synthetic Datasets

Data clustering based on regression relationship is able to improve the validity and reliability of the engineering data mining results. Surrogate models are widely used to evaluate the regression relationship in the process of data clustering, but there is no single surrogate model that always performs the best for all the regression relationships. To solve this issue, a fuzzy clustering algorithm based on hybrid surrogate model is proposed in this work. The proposed algorithm is based on the framework of fuzzy c-means algorithm, in which the differences between the clusters are evaluated by the regression relationship instead of Euclidean distance. Several surrogate models are simultaneously utilized to evaluate the regression relationship through a weighting scheme. The clustering objective function is designed based on the prediction errors of multiple surrogate models, and an alternating optimization method is proposed to minimize it to obtain the memberships of data and the weights of surrogate models. The synthetic datasets are used to test single surrogate model-based fuzzy clustering algorithms to choose the surrogate models used in the proposed algorithm. It is found that support vector regression-based and response surface-based fuzzy clustering algorithms show competitive clustering performance, so support vector regression and response surface are used to construct the hybrid surrogate model in the proposed algorithm. The experimental results of synthetic datasets and engineering datasets show that the proposed algorithm can provide more competitive clustering performance compared with single surrogate model-based fuzzy clustering algorithms for the datasets with regression relationships.

Sign in / Sign up

Export Citation Format

Share Document