Traditional Fuzzy C-means Algorithm Research Articles

Application of Spatial Neighborhood Fuzzy c-Means Algorithm in 3D Image Segmentation of National Clothing

National costume contains rich patterns and patterns with national characteristics, which is an important part of the study of national costume culture. Neither the traditional protection of national costumes nor the early digital protection can clearly and effectively preserve the details of national costumes, which is not conducive to the development and research of national costume culture. The development of image processing technology provides new technical support for the protection and inheritance of national costumes. This paper proposes the application of spatial neighborhood fuzzy c-means algorithm in 3D image segmentation of national clothing. Based on the traditional fuzzy c-means algorithm, combined with spatial information and gray information, a 3D image segmentation model based on spatial neighborhood fuzzy c-means is constructed. The experimental results show that the 3D image segmentation model based on spatial neighborhood fuzzy c-means has faster convergence speed and better algorithm performance than the improved fuzzy c-means algorithm and has better image segmentation effect in different noise levels. In the 3D image segmentation of national costumes, more detailed information can be retained on the basis of maintaining high accuracy and effect.

Fuzzy C-Means Algorithm-Based ARM-Linux-Embedded System Combined with Magnetic Resonance Imaging for Progression Prediction of Brain Tumors.

The aim of this research was to analyze the application of fuzzy C-means (FCM) algorithm-based ARM-Linux-embedded system in magnetic resonance imaging (MRI) images for prediction of brain tumors. The optimized FCM (OFCM) algorithm was proposed based on kernel function, and the ARM-Linux-embedded imaging system was designed under ARM9 chip and Linux recorder, which were applied in MRI images of brain tumor patients. It was found that the sensitivity, specificity, and accuracy of the OFCM algorithm (90.46%, 88.97%, and 97.46%) were greater obviously than those of the deterministic C-means clustering algorithm (80.38%, 77.98%, and 85.24%) and the traditional FCM algorithm (83.26%, 79.56%, and 86.45%), and the difference was statistically substantial (P < 0.05). The ME and running time of the OFCM algorithm decreased sharply in contrast to those of the deterministic C-means clustering algorithm and the traditional FCM algorithm (P < 0.05). There were great differences in fraction anisotropy (FA) and mean diffusion (MD) of tumor parenchymal area, surrounding edema area, and normal white matter area (P < 0.05). FA of stage III+IV was smaller than those of stage I and II (P < 0.05), while the apparent diffusion coefficient (ADC) of stage III+IV was greater than that of stage I and II (P < 0.05). In conclusion, the poor update data processing and low data clustering efficiency of FCM were solved by OFCM. Moreover, computational efficiency of ARM-Linux-embedded imaging system was improved, so as to better realize the prediction of brain tumor patients through ARM-Linux-embedded system based on adaptive FCM incremental clustering algorithm.

CT Image under Improved Fuzzy C-Means Clustering Algorithm for Evaluation of the Relationship between Cerebrospinal Fluid Change and Communicating Hydrocephalus after Decompressive Craniectomy in Patients with Traumatic Brain Injury

This study was aimed to realize the automatic segmentation of communicating hydrocephalus lesions in brain CT after decompressive craniotomy (DC) in patients with traumatic brain injury (TBI) and discover correlation between cerebrospinal fluid changes and communicating hydrocephalus. Based on the traditional fuzzy C-means (FCM) algorithm, a new segmentation method filter-based FCM (FBFCM) algorithm was proposed. With 56 TBI patients as the research objects, the hydrocephalus lesions in CT images of patients after DC were segmented. The segmentation success rate (SSR), the segmentation coefficient Epc, the segmentation entropy Epe, and the number of iterations were indicators reflecting segmentation performance of FBFCM. The region of interest (ROI) on the segmented image was used to study the patient’s cerebral aqueduct, foramen magnum, and C2 level of the cerebrospinal fluid velocity and flow, to analyze the characteristics of the occurrence of communicative hydrocephalus. It was indicated that average Epc of FBFCM algorithm was 0.9321 ± 0.0144, Epe was 0.1126 ± 0.0081, the average number of iterations was 14.42 ± 3.79, and the segmentation success rate was 96%. Moreover, the above four indicators had statistically considerable differences compared with those of the FCM algorithm and the hard clustering algorithm (HCM) ( P &lt; 0.05). Analysis of the cerebrospinal fluid flow rate in patients with communicative hydrocephalus found that the cerebrospinal fluid flow rate at the midbrain aqueduct of the patient increased greatly. The net flow was 0.000 ± 0.004 mL/s in the aqueduct of the midbrain, 0.001 ± 0.006 mL/s in the foramen magnum, and 0.002 ± 0.004 mL/s in the C2 layer. In summary, the FBFCM algorithm is effective in the segmentation and processing of CT images, which can further improve the effect of this diagnosis. After examination, it is concluded that the cranial cerebrospinal fluid flow rate and flow of TBI patients are improved after DC treatment, so that the patient’s condition can be effectively relieved. It has promotion value with clinical application.

A modified fuzzy clustering approach in unsupervised classification for detecting the mixed pixels of satellite images

The major problem of remote sensing images is mixed pixels, available in the data which degrades the quality, accuracy of the image classification and object recognition. To overcome the problem of mixed pixel in a real satellite data a modified K -means clustering algorithm and a modified fuzzy C -means clustering algorithm, are discussed. The algorithms are developed by modifying the membership function of the standard K -means clustering algorithm (FKM) and the standard fuzzy C -means algorithm (FCM). The performance of the proposed algorithms is discussed and compared with the traditional fuzzy K -means algorithm and the traditional FCM algorithm. Results on classification and segmentation of satellite images reveal that the suggestive algorithms are robust and effective.

Research on automobile insurance fraud identification based on fuzzy association rules

With the development of automobile insurance industry, how to identify automobile insurance fraud from massive data becomes particularly important. The purpose of this paper is to improve automobile insurance fraud management and explore the application of data mining technology in automobile insurance fraud identification. To this aim, an Apriori algorithm based on simulated annealing genetic fuzzy C-means (SAGFCM-Apriori) have been proposed. The SAGFCM-Apriori algorithm combines fuzzy theory with association rule mining, expanding the application scope of the Apriori algorithm. Considering that the clustering center of the traditional fuzzy C-means (FCM) algorithm is easy to fall into local optimal, the simulated annealing genetic (SAG) algorithm is used to optimize it. The SAG algorithm optimized FCM (SAGFCM) is used to generate fuzzy membership degrees and introduces fuzzy data into the Apriori algorithm. The Apriori algorithm is improved by reducing the rule mining time when acquiring rules. The results of empirical studies on several data sets demonstrate that the optimization of FCM by SAG can effectively avoid the local optimal problem, improve the accuracy of clustering, and enable SAGFCM-Apriori to obtain better fuzzy data during data preprocessing. Moreover, the proposed algorithm can reduce the mining time of association rules and improve mining efficiency. Finally, the SAGFCM-Apriori algorithm is applied to the scene of automobile insurance fraud identification, and the automobile insurance fraud data is mined to obtain fuzzy association rules that can identify fraud claims.

Spatial information of fuzzy clustering based mean best artificial bee colony algorithm for phantom brain image segmentation

Fuzzy c-means algorithm (FCM) is among the most commonly used in the medical image segmentation process. Nevertheless, the traditional FCM clustering approach has been several weaknesses such as noise sensitivity and stuck in local optimum, due to FCM hasn’t able to consider the information of contextual. To solve FCM problems, this paper presented spatial information of fuzzy clustering-based mean best artificial bee colony algorithm, which is called SFCM-MeanABC. This proposed approach is used contextual information in the spatial fuzzy clustering algorithm to reduce sensitivity to noise and its used MeanABC capability of balancing between exploration and exploitation that is explore the positive and negative directions in search space to find the best solutions, which leads to avoiding stuck in a local optimum. The experiments are carried out on two kinds of brain images the Phantom MRI brain image with a different level of noise and simulated image. The performance of the SFCM-MeanABC approach shows promising results compared with SFCM-ABC and other stats of the arts.

Fuzzy Clustering Algorithm-Segmented MRI Images in Analysis of Effects of Mental Imagery on Neurorehabilitation of Stroke Patients

The study focused on the automatic segmentation of Magnetic Resonance Imaging (MRI) images of stroke patients and the therapeutic effects of Mental Imagery on motor and neurological functions after stroke. First, the traditional fuzzy c-means (FCM) algorithm was optimized, and the optimized one was defined as filter-based FCM (FBFCM). 62 stroke patients were selected as the research subjects and randomly divided into the experimental group and the control group. The control group accepted the conventional rehabilitation training, and the experimental group accepted Mental Imagery on the basis of the control group. They all had the MRI examination, and their brain MRI images were segmented by the FBFCM algorithm. The MRI images before and after treatment were analyzed to evaluate the therapeutic effects of Mental Imagery on patients with motor and nerve dysfunction after stroke. The results showed that the segmentation coefficient of the FBFCM algorithm was 0.9315 and the segmentation entropy was 0.1098, which were significantly different from those of the traditional fuzzy c-means (FCM) algorithm. ( P &lt; 0.05 ), suggesting that the FBFCM algorithm had good segmentation effects on brain MRI images of stroke patients. After Mental Imagery, it was found that the patient’s Function Independent Measure (FIM) score was 99.04 ± 8.19, the Modified Barthel Index (MBI) score was 51.29 ± 4.35, the Fugl-Meyer (FMA) score was 61.01 ± 4.16, the neurological deficit degree in stroke (NFDS) score was 11.48 ± 2.01, the NIH Stroke Scale (NIHSS) score was 10.36 ± 1.69, and the clinical effective rate was 87.1%, all significantly different from those of the conventional rehabilitation training group ( P &lt; 0.05 ). Additionally, the brain area activated by Mental Imagery was more extensive. In conclusion, the FBFCM algorithm demonstrates superb capabilities in segmenting MRI images of stroke patients and is worth promotion in clinic. Mental Imagery can promote the neurological rehabilitation of patients by activating relevant brain areas of patients.

Optimized Fuzzy C-Means Algorithm-Based Coronal Magnetic Resonance Imaging Scanning in Tracheal Foreign Bodies of Children.

In order to provide theoretical support for clinical diagnosis, the diagnostic value of the optimized fuzzy C-means (FCM) algorithm combined with coronal magnetic resonance imaging (MRI) scan was investigated in the diagnosis of tracheal foreign bodies in children. The anisotropic filtering was applied to optimize the traditional FCM algorithm, so as to construct a new MRI image segmentation algorithm, namely, AFFCM algorithm. Then, the traditional FCM algorithm, the FCM algorithm based on the kernel function (KFCM), and the FCM algorithm based on the spatial neighborhood information (RFCM) were introduced for comparison with the AFFCM. 28 children diagnosed with foreign bodies in the trachea were selected for MRI diagnosis, and AFFCM was used for segmentation. The partition coefficient, segmentation entropy, and the correlation degree between classes after fuzzy division of the four algorithms were recorded, and the location and distribution of foreign bodies in the trachea and the types of foreign bodies were also collected. Besides, the MRI scanning and chest X-rays of the children with foreign bodies in the trachea should also be recorded in terms of the positive rate, diagnosis rate, and indirect signs. The class division coefficient and interclass correlation degree after fuzzy division of AFFCM were markedly greater than those of FCM, KFCM, and RFCM (P < 0.05), while the segmentation entropy of AFFCM was less sharp than the entropies of FCM, KFCM, and RFCM (P < 0.05). Among the 28 children, there were 5 cases with foreign bodies in the trachea (17.86%), 10 cases in the left bronchus (35.71%), and 13 cases in the right bronchus (46.43%). Among the foreign body types, there were 10 cases of melon seeds (35.71%), 6 cases of peanuts (21.43%), and 5 cases of beans (17.86%). The positive rate (89.29%) and diagnosis rate (96.43%) of MRI for bronchial foreign bodies increased obviously in contrast to the rates of X-ray chest radiographs (57.14% and 67.86%) (P < 0.05). Therefore, it was indicated that AFFCM showed higher partition coefficient value, lower segmentation entropy, larger similarity among classes, and better image segmentation effect. Furthermore, AFFCM-based coronal MRI scan had a higher positive rate and diagnosis rate for children's tracheal foreign bodies, and the main signs were emphysema and atelectasis.

Research on the data analysis system of student stress in English MOOC based on fuzzy C-means algorithm

In order to improve the recognition accuracy of students’ psychological stress data in the English MOOC classroom teaching process, this paper improves the traditional fuzzy C-means algorithm, and uses the deviation value to represent the difference between the average algebraic distance of the neighborhood point and the center pixel. By calculating the deviation value, the influence of the neighborhood point on the center point can be measured, and the noise resistance of the algorithm can be improved. Moreover, this paper constructs a quantitative identification model of student stress data based on the needs of English MOOC teaching stress analysis, and uses image database to verify the basic performance of the algorithm, and constructs a data analysis system of student stress in English MOOC classroom, which is used in practice. In addition, this paper uses student facial expression recognition as a basis for quantitative identification of student stress, and designs experiments to analyze the reliability of the system. From the statistical results, it can be seen that the data analysis system of the students’ psychological stress in the English MOOC classroom teaching process constructed in this paper is effective.

Supervised Fuzzy C-Means Techniques to Solve the Capacitated Vehicle Routing Problem

Fuzzy C-Means (FCM) clustering technique is among the most effective partitional clustering algorithms available in the literature. The Capacitated Vehicle Routing Problem (CVRP) is an important industrial logistics and managerial NP-hard problem. Cluster-First Route-Second Method (CFRS) is one of the efficient techniques used to solve CVRP. In CFRS technique, customers are first divided into clusters in the first phase, then each cluster is solved independently as a Traveling Salesman Problem (TSP) in the second phase. This research is concerned with the clustering phase of CFRS, and TSP is then solved using a traditional optimization method. Three supervised FCM based techniques are proposed to solve the clustering phase at reduced cost via centroids (pre-FCM) initialization phase. The proposed pre-FCM initialization techniques are developed to be problem dependent. Hence, three initialization techniques are first developed using K-means technique, spatially equally distributed, and demand weighted center of mass. Then, a modified demand weighted fuzzy c-means objective function is employed to assign customers to clusters. To compare the performance of the proposed supervised FCM techniques, forty-two CVRP benchmark problems are solved using the traditional fuzzy C-means algorithm and the developed algorithms. Extensive comparisons are conducted between the traditional fuzzy C-means algorithm, the three proposed initialization techniques, and other fuzzy C-means techniques available in the literature. Results show that the proposed three initialization techniques are efficient in terms of solution quality and computational cost.

A Fuzzy C-Means Clustering Algorithm Based on Spatial Context Model for Image Segmentation

An improved Fuzzy C-Means (FCM) algorithm, which is called Reliability-based Spatial context Fuzzy C-Means (RSFCM), is proposed for image segmentation in this paper. Aiming to improve the robustness and accuracy of the clustering algorithm, RSFCM integrates neighborhood correlation model with the reliability measurement to describe the spatial relationship of the target. It can make up for the shortcomings of the known FCM algorithm which is sensitive to noise. Furthermore, RSFCM algorithm preserves details of the image by balancing the insensitivity of noise and the reduction of edge blur using a new fuzzy measure indicator. Experimental data consisting of a synthetic image, a brain Magnetic Resonance (MR) image, a remote sensing image, and a traffic sign image are used to test the algorithm’s performance. Compared with the traditional fuzzy C-means algorithm, RSFCM algorithm can effectively reduce noise interference, and has better robustness. In comparison with state-of-the-art fuzzy C-means algorithm, RSFCM algorithm could improve pixel separability, suppress heterogeneity of intra-class objects effectively, and it is more suitable for image segmentation.

Genetic Algorithm-Based Anisotropic Diffusion Filter and Clustering Algorithms for Thyroid Tumor Detection

Medical imaging is a technique that has been used for diagnosis and treatment of a large number of diseases. Therefore it has become necessary to conduct a good image processing to extract the finest desired result and information. In this study, genetic algorithm (GA)-based clustering technique (K-means and Fuzzy C Means (FCM)) were used to segment thyroid Computed Tomography (CT) images to an extraction thyroid tumor. Traditional GA, K-means and FCM algorithms were applied separately on the original images and on the enhanced image with Anisotropic Diffusion Filter (ADF). The resulting cluster centers from K-means and FCM were used as the initial population in GA for the implementation of GAK-Mean and GAFCM. Jaccard index was used to study resemblance, dissimilarity, distance between two sets of images, and effect of ADF on enhancing the CT images. The results showed that ADF increases the segmentation accuracy, where the value of Jaccard index of similarity between the ground truth image and segmented image was increased for all segmentation algorithms, in particular for FCM and GAFCM where similarity percent was up to 88%.

Local segmentation of images using an improved fuzzy C-means clustering algorithm based on self-adaptive dictionary learning

Image segmentation is an active research topic in image processing. The Fuzzy C-means (FCM) clustering analysis has been widely used in image segmentation. As there is a large amount of delicate tissues such as blood vessels and nerves in medical images, noise generated during imaging process can easily affect successful segmentation of these tissues. The traditional FCM algorithm is not ideal for segmentation of images containing strong noise. In this study, we proposed an improved FCM algorithm with anti-noise capability. We first discussed the algorithm of dictionary learning for noise reduction. Then we developed a new image segmentation algorithm as a combination of the dictionary learning for noise reduction and the improved fuzzy C-means clustering. Lastly we used the algorithm of the improved FCM to segment images, during which we removed the non-target areas making use of the grayscale features of images and extracted accurately the areas of interests. The algorithm was tested using synthetic Shepp-Logan images and real medical magnetic resonance imaging (MRI) and computed tomography (CT) images. Compared to the synthetic data and real medical images segmented by the fuzzy C-means (FCM) clustering algorithm, the Kernel Fuzzy C-mean (KFCM) clustering algorithm, spectral clustering algorithm, the sparse learning based fuzzy C-means (SL_FCM) clustering algorithm, and the modified spatial KFCM (MSFCM) algorithm, the images segmented by the dictionary learning Fuzzy C-mean clustering (DLFCM) algorithm have higher partition coefficient, lower partition entropy, better visual perception, better clustering accuracy, and clustering purity.

Data Mining Algorithm for Cloud Network Information Based on Artificial Intelligence Decision Mechanism

Due to the rapid development of information technology and network technology, there is a lot of data, but the phenomenon of lack of knowledge is becoming more and more serious. Data mining technology has developed vigorously in this environment, and it has shown more and more vitality. Based on Spark programming model, this paper designs the parallel extension of fuzzy c-means. In order to enhance the performance of fuzzy c-means parallel expansion, the improvement strategy of k-means during the initialization phase is borrowed, and k-means// is extended to fuzzy c-means to obtain better clustering performance. Combined with Spark's programming model, this paper can obtain extended parallel fuzzy c-means algorithm. Several experiments on the data set of the algorithm proposed in this paper have shown good scalability and parallelism, effectively expanding fuzzy c-means clustering to distributed applications, greatly increasing the scale of the data processed by the algorithm. This improves the robustness of the algorithm and the adaptability of the algorithm to the shape and structure of the data, so that the parallel and scalable clustering algorithm can more effectively perform cluster analysis on big data. Three algorithms were simulated on MATLAB platform. We use simple data sets and complex two-dimensional data sets, and compare with the traditional fuzzy c-means algorithm and fuzzy c-means algorithm based on fuzzy entropy. Experiments show that the scalable parallel fuzzy c-means algorithm not only greatly improves the anti-noise performance, but also improves the convergence speed, and it can automatically determine the optimal number of clusters.

AutoCryoPicker: an unsupervised learning approach for fully automated single particle picking in Cryo-EM images

BackgroundAn important task of macromolecular structure determination by cryo-electron microscopy (cryo-EM) is the identification of single particles in micrographs (particle picking). Due to the necessity of human involvement in the process, current particle picking techniques are time consuming and often result in many false positives and negatives. Adjusting the parameters to eliminate false positives often excludes true particles in certain orientations. The supervised machine learning (e.g. deep learning) methods for particle picking often need a large training dataset, which requires extensive manual annotation. Other reference-dependent methods rely on low-resolution templates for particle detection, matching and picking, and therefore, are not fully automated. These issues motivate us to develop a fully automated, unbiased framework for particle picking.ResultsWe design a fully automated, unsupervised approach for single particle picking in cryo-EM micrographs. Our approach consists of three stages: image preprocessing, particle clustering, and particle picking. The image preprocessing is based on multiple techniques including: image averaging, normalization, cryo-EM image contrast enhancement correction (CEC), histogram equalization, restoration, adaptive histogram equalization, guided image filtering, and morphological operations. Image preprocessing significantly improves the quality of original cryo-EM images. Our particle clustering method is based on an intensity distribution model which is much faster and more accurate than traditional K-means and Fuzzy C-Means (FCM) algorithms for single particle clustering. Our particle picking method, based on image cleaning and shape detection with a modified Circular Hough Transform algorithm, effectively detects the shape and the center of each particle and creates a bounding box encapsulating the particles.ConclusionsAutoCryoPicker can automatically and effectively recognize particle-like objects from noisy cryo-EM micrographs without the need of labeled training data or human intervention making it a useful tool for cryo-EM protein structure determination.

Remote sensing image segmentation based on a robust fuzzy C-means algorithm improved by a parallel Lévy grey wolf algorithm.

Due to the insufficient use of local information, the traditional fuzzy C-means (FCM) algorithm and its extension algorithm combined with spatial information show poor robustness and low segmentation accuracy. In addition, in the process of image segmentation based on the FCM algorithm, the initial center estimation is regarded as the process of searching the appropriate value in the gray range. To solve these problems, a new robust algorithm is proposed in this paper. The algorithm searches the optimal initial center by introducing an improved parallel Lévy grey wolf optimization algorithm, which is an improved fuzzy C-means segmentation algorithm that combines local information and adaptive gray weighting. Experimental results infer that both the precision and efficiency of the proposed method are superior to those of the state-of-arts.

Adaptive Segmentation of Remote Sensing Images Based on Global Spatial Information.

The problem of image segmentation can be reduced to the clustering of pixels in the intensity space. The traditional fuzzy c-means algorithm only uses pixel membership information and does not make full use of spatial information around the pixel, so it is not ideal for noise reduction. Therefore, this paper proposes a clustering algorithm based on spatial information to improve the anti-noise and accuracy of image segmentation. Firstly, the image is roughly clustered using the improved Lévy grey wolf optimization algorithm (LGWO) to obtain the initial clustering center. Secondly, the neighborhood and non-neighborhood information around the pixel is added into the target function as spatial information, the weight between the pixel information and non-neighborhood spatial information is adjusted by information entropy, and the traditional Euclidean distance is replaced by the improved distance measure. Finally, the objective function is optimized by the gradient descent method to segment the image correctly.

Improving fuzzy c-means clustering via quantum-enhanced weighted superposition attraction algorithm

Fuzzy clustering has become an important research field in pattern recognition and data analysis. As supporting unsupervised mode of learning, fuzzy clustering brings about unique opportunities to reveal structural relationships in data. Fuzzy c-means clustering is one of the widely preferred clustering algorithms in the literature. However, fuzzy c-means clustering algorithm has a major drawback that it can get trapped at some local optima. In order to overcome this shortcoming, this study employs a new generation metaheuristic algorithm. Weighted Superposition Attraction Algorithm (WSA) is a novel swarm intelligence-based method that draws inspiration from the superposition principle of physics in combination with the attracted movement of agents. Due to its high converging capability and practicality, WSA algorithm has been employed in order to enhance performance of fuzzy-c means clustering. Comprehensive experimental study has been conducted on publicly available datasets obtained from UCI machine learning repository. The results point out significant improvements over the traditional fuzzy c-means algorithm.

Diversity-induced fuzzy clustering

Granular computing plays an important role in human reasoning and problem solving, a reasonable granulation method is important in practical tasks. Clustering is one of the most common methods of granulation, learning clear and correct grouping structure of a data set is a key pursuit for clustering algorithm. An excellent clustering algorithm needs to not only explore similar characteristics of individual group but also to pay attention to ensure higher discrimination among different centers. Ignoring the between-cluster variation will lead to a phenomenon that multiple learned centers concentrate to one point, it happens especially when confronted with datasets exist overlapping regions among clusters. To overcome this issue, we model the diversity information in-between different clusters and measure it with a statistical dependence metric Hilbert Schmidt Independence Criterion (HSIC), and then develop a Diversity-induced Fuzzy C-Means clustering algorithm framework based on traditional Fuzzy C-Means algorithm, which can minimize the within-cluster dispersion and maximize between-clusters separation simultaneously. The formula of updating center attracts the points have the same group with it as well as excludes the impact from other clusters. We analyze the convergence of proposed method under the alternating minimizing optimization fashion, and discuss the sensitivity of parameters in algorithm for clustering performance. The reasonability and advantages of proposed method also have been explained by simulation study. Further, three types of DiFCM methods by using different HSIC form carry out on UCI and image data sets, all experimental results confirm the outstanding of the proposed method.

Advanced Fuzzy C-Means Algorithm Based on Local Density and Distance

This paper presents an advanced fuzzy C-means (FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of the data separation or the size of clusters. The advanced FCM algorithm combines the distance with density and improves the objective function so that the performance of the algorithm can be improved. The experimental results show that the proposed FCM algorithm requires fewer iterations yet provides higher accuracy than the traditional FCM algorithm. The advanced algorithm is applied to the influence of stars’ box-office data, and the classification accuracy of the first class stars achieves 92.625%.