Fuzzy adaptive level set algorithm for brain tissue segmentation

In order to improve the capability of enterprise economic risk assessment and prediction, this paper combines panel data analysis method to construct enterprise economic risk prediction model, proposes enterprise economic risk prediction model based on big data fusion, establishes fusion clustering model of enterprise economic risk assessment panel data, and uses fuzzy correlation fusion clustering method to make statistical analysis of enterprise economic risk assessment panel data. Quantitative regression analysis and fuzzy clustering methods are used for panel data mining of enterprise economic risk assessment, adaptive block feature matching in the risk prediction process is carried out according to the mining results of panel data bureau, interference suppression in the enterprise economic risk prediction process is carried out by using correlation feature matching method, large data fusion in the enterprise economic risk prediction process is carried out by combining fuzzy information clustering and statistical analysis methods, and optimization of enterprise economic risk prediction is realized according to the rule distribution relation of recursive entropy. The simulation results show that the method has high accuracy in predicting the economic risks of enterprises, improves the data mining and information fusion capabilities of enterprises' economic risks, and improves the anti-risk capability of enterprises.

Group technology’s basic logic is grouping and producing products of the same type together. An important reason behind Group Technology becoming such an important topic is that nowadays companies have quite an extensive range and workshop type production has increased. Both fuzzy clustering and rank order clustering methods use for grouping parts and machines based on a part-machine matrix created from the production flow technique in order to increase productivity and reduce cost and workmanship required. In this study, Group Technology techniques such as the rank order clustering and fuzzy clustering methods were applied in order to increase the efficiency of the production line, reduce transportation between machines, and form a machine-parts groups in the wood cutting department of a furniture company producing modular furniture in Istanbul. The TOPSIS method was used to determine which products to take into account. According to results of the study, it is shown that fuzzy clustering method has overperformed rank order clustering method based on the evaluation criteria which are group productivity with 21,36%, group efficiency with 43,21% and grouping measure with 82,33%.

This paper presents a further investigation into computational properties of a novel fuzzy additive spectral clustering method, Fuzzy Additive Spectral clustering (FADDIS), recently introduced by authors. Specifically, we extend our analysis to ‘difficult’ data structures from the recent literature and develop two synthetic data generators simulating affinity data of Gaussian clusters and genuine additive similarity data, with a controlled level of noise. The FADDIS is experimentally verified on these data in comparison with two state‐of‐the‐art fuzzy clustering methods. The claimed ability of FADDIS to help in determining the right number of clusters is experimentally tested, and the role of the pseudo‐inverse Laplacian data transformation in this is highlighted. A potentially useful extension of the method to biclustering is introduced.

Context. The problem of clustering (classification without a teacher) is often occures when processing data arrays of various natures, which is quite an interesting and integral part of artificial intelligence. To solve this problem, there are many known methods and algorithms based on the principles of the distribution density of observations in the analyzed data. However, these methods are rather complicated in software implementation and are not without drawbacks, namely: the problem of determining significant clusters in datasets of different densities, multiepoch self-learning, getting stuck in local extrema of goal functions, etc. It should be noted that the methods based on the analysis of the peaks of the data distribution density are clear in nature, therefore, to expand the capabilities of these methods, it is advisable to introduce their fuzzy modification. Objective. The aim of the work is to introduce fast fuzzy data clustering using density peaks distribution of the datasets, that can find the prototypes (centroids) of clusters that overlapping regardless of the amount of incoming data. Method. The problem of fuzzy clustering data arrays based on a hybrid method that based on the simultaneous use of a credibilistic approach to fuzzy clustering and an algorithm for finding the types of distribution density of the initial data is proposed. A feature of the proposed method is computational simplicity and high speed, due to the fact that the entire array is processed only once, that is, eliminates the need for multi-era self-learning, implemented in traditional fuzzy clustering algorithms. Results. A feature of the proposed method of fast fuzzy credibilistic clustering using of density peaks distribution is characterized by computational simplicity and high speed due to the fact that the entire array is processed only once, that is, the need for multiepoch self-learning is eliminated, which is implemented in traditional fuzzy clustering algorithms. The results of the computational experiment confirm the effectiveness of the proposed approach in clustering problems under conditions in the case when the clusters are ovelap. Conclusions. The experimental results allow us to recommend the developed method for solving the problems of automatic clustering and data classification, as quickly as possible to find the centroids of clusters. The proposed method of fast fuzzy credibilistic clustering using of density peaks distribution of dataset is intended for use in computational intelligence systems, neuro-fuzzy systems, in training artificial neural networks and in clustering problems.

Heuristic methods of fuzzy clustering hold a special place in data mining. They are important in preliminary data analysis when the number of clusters, their structure and mutual arrangement are unknown. The object clustering methods, based on fuzzy binary relations are generalized by developing clear and fuzzy single-level clustering methods, clear and fuzzy sequential multi-level clustering methods. Possible examples of fuzzy binary relations, which characterize similarity of objects by length, angle and distance of their vector features are presented. For this purpose, the Harrington type desirability function and scale, enabling effective analysis of clustering results are suggested. Based on the proposed methods, the software systems that were effectively used for solving applied clustering problems are developed. Also, the study illustrated the clear single-level clustering method on a specific example. It is shown that application of the apparatus of fuzzy binary relations in clustering provides an additional opportunity to study the dynamics of the number of clusters, their structure and determine the degree of similarity of objects in a cluster. The results can be used for preliminary data analysis and for holding the object clustering procedure.

The purpose of medical image segmentation is to divides the lesions image with a special meaning and background regional. The characteristics of medical images are generally more complex. There is often overlap between different regions, the edge of the area is vague. Research based on fuzzy clustering method for medical image segmentation, fuzzy C-means clustering and fuzzy kernel clustering methods were studied and discussed fully considered the spatial information, the single objective problem conversion into multi-objective problem. The experimental results show that the method use in medical image segmentation achieved good results.

Kernelized weighted local information based picture fuzzy clustering with multivariate coefficient of variation and modified total Bregman divergence measure for brain MRI image segmentation.

Voltage stability constrained reactive power planning (RPP) or VAr planning is a very challenging issue in power systems. This paper proposes a new approach for modeling and solving VAr planning problem taking into account the static voltage stability constraint. First, the fuzzy clustering method is employed to select new candidate VAr source locations. Then, modified Gray code is proposed and used to represent a series of non-uniform VAr capacity intervals at different candidate buses. Under the new ordering of the VAr capacity intervals, a simplified piecewise linear function between the total transfer capability (TTC) and new VAr capacity is derived and applied as static voltage stability constraint in RPP. Finally, the RPP optimization model is solved by an enhanced simulated annealing (SA) algorithm taking advantage of the modified Gray code. In the SA algorithm, a modified definition of the neighborhood selection and a novel approach to generate new random solutions are proposed. In the case study, fuzzy clustering method, the modified Gray code, and the improved SA are applied to the IEEE 30-bus system. Test results conclude that the proposed method is a simplified and effective approach for voltage stability constrained VAr planning with contingency considered.

Exploring urban travel patterns can analyze the mobility regularity of residents to provide guidance for urban traffic planning and emergency decision. Clustering methods have been widely applied to explore the hidden information from large-scale trajectory data on travel patterns exploring. How to implement soft constraints in the clustering method and evaluate the effectiveness quantitatively is still a challenge. In this study, we propose an improved trajectory clustering method based on fuzzy density-based spatial clustering of applications with noise (TC-FDBSCAN) to conduct classification on trajectory data. Firstly, we define the trajectory distance which considers the influence of different attributes and determines the corresponding weight coefficients to measure the similarity among trajectories. Secondly, membership degrees and membership functions are designed in the fuzzy clustering method as the extension of the classical DBSCAN method. Finally, trajectory data collected in Shenzhen city, China, are divided into two types (workdays and weekends) and then implemented in the experiment to explore different travel patterns. Moreover, three indices including Silhouette Coefficient, Davies–Bouldin index, and Calinski–Harabasz index are used to evaluate the effectiveness among the proposed method and other traditional clustering methods. The results also demonstrate the advantage of the proposed method.

Fuzzy Clustering is applied to the problem of detecting landmines in Ground Penetrating Radar (GPR). The DARPA Backgrounds Data provides a rich source of signatures derived from a cluttered environment with a variety of sensors. One sensor used in the Backgrounds collection was the GPR developed and fielded by Geo-Centers, Inc. This GPR provides a three-dimensional array of intensity returns corresponding to a volume underneath the ground. In this paper, a novel approach to processing that GPR is described. The approach relies on computing edge direction and magnitude features in the volume and comparing them to prototypes generated using fuzzy c-means clustering. A confidence map is generated corresponding to the surface traversed by the system. The confidence map is thresholded to produce detections. Experimental results show a reduction in false alarm rates from about 40% using the standard processing method to about 4% using the three-dimensional, fuzzy clustering method.

Clustering method, which groups thousands of genes by their similarities of expression levels, has been used for identifying unknown functions of genes. Fuzzy clustering method that is one category of clustering assigns one sample to multiple groups according to their membership degrees. It is more appropriate than hard clustering algorithms for analyzing gene expression profiles since single gene might involve multiple genetic functions. However, general clustering methods have problems that they are sensitive to initialization and can be trapped into local optima. To solve the problems, we propose an evolutionary fuzzy clustering algorithm with knowledge-based evaluation. It uses a genetic algorithm for clustering and prior knowledge of data for evaluation. Yeast cell-cycle dataset has been used for experiments to show the usefulness of the proposed method.KeywordsFuzzy ClusterMembership DegreeCluster PartitionAnalyze Gene Expression ProfileFuzzy Cluster MethodThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Osteoarthritis is a chronic joint disease that occurs when the protective cartilage that cushions the ends of bones wears down over time and fails to be repaired. The common form of the disease is knee osteoarthritis while it can affect all body parts with joints, such as hands, ankles, hips, and spine. The major cause of knee osteoarthritis is the continuous depletion of its cartilage. During the diagnosis, machine learning is used because early prevention is necessary for proper treatment. This study, therefore, considers classification methods of Support Vector Machine (SVM) and clustering methods using fuzzy clusterings such as Fuzzy C-Means (FCM), Fuzzy Possibilistic C-Means (FPCM), and Fuzzy Possibilistic C-Means based on kernel (FPCMK) to analyze of knee osteoarthritis. SVM is a machine learning technique that works based on the principle of structural risk minimization (SRM) to obtain the best hyperplane to separate two or more classes in input space. Otherwise, the fuzzy clustering is to determine the value of a distance and to know and measure the similarity of each object to be observed. FPCMK uses the kernel Radial Base Function (RBF) in the fuzzy clustering method. The kernel function is applicable for handling non-separable data problems. This method will be compared to the level of the measured parameter; their accuracy, recall, precision, and f1 score. The greatest level of accuracy is generated from SVM with an accuracy value of 86.7%, then followed by FPCMK with an accuracy value of 85.5%.

The global analysis of metabolites can be used to define the phenotypes of cells, tissues or organisms. Classifying groups of samples based on their metabolic profile is one of the main topics of metabolomics research. Crisp clustering methods assign each feature to one cluster, thereby omitting information about the multiplicity of sample subtypes. Here, we present the application of fuzzy K-means clustering method for the classification of samples based on metabolomics 1D (1)H NMR fingerprints. The sample classification was performed on NMR spectra of cancer cell line extracts and of urine samples of type 2 diabetes patients and animal models. The cell line dataset included NMR spectra of lipophilic cell extracts for two normal and three cancer cell lines with cancer cell lines including two invasive and one non-invasive cancers. The second dataset included previously published NMR spectra of urine samples of human type 2 diabetics and healthy controls, mouse wild type and diabetes model and rat obese and lean phenotypes. The fuzzy K-means clustering method allowed more accurate sample classification in both datasets relative to the other tested methods including principal component analysis (PCA), hierarchical clustering (HCL) and K-means clustering. In the cell line samples, fuzzy clustering provided a clear separation of individual cell lines, groups of cancer and normal cell lines as well as non-invasive and invasive tumour cell lines. In the diabetes dataset, clear separation of healthy controls and diabetics in all three models was possible only by using the fuzzy clustering method.

With the deepening of China's urbanization construction, public safety is also facing great challenges. Therefore, China has strengthened security measures for important public places, and established monitoring network and security inspection system. However, the current machine security inspection algorithm is not accurate enough for the identification of sensitive objects such as controlled knives, and it also depends on manual detection and confirmation, which leads to low work efficiency and often leads to low efficiency It is also not conducive to the prevention and control of the epidemic. This paper proposes an image segmentation method based on Improved level set to enhance fuzzy clustering. In this paper, the fuzzy clustering method and the improvement of the level set method, first of all, using morphological method image preprocessing algorithms, so as to realize the foreground and background of the area range, is advantageous for the next level set segmentation of the target outline, so as to determine the fuzzy clustering of heart, makes strengthening fuzzy clustering on its own the advantage of rapid more accurate. Through experiments, the effectiveness of the algorithm is verified, and the segmentation accuracy is higher than the traditional segmentation algorithm.

Four methods of c-regression are compared. Two of them are methods of fuzzy clustering: (a) the fuzzy c-regression methods, and (b) an entropy method proposed by the authors. Two others are probabilistic methods of (c) the deterministic annealing, and (d) the mixture distribution method using the EM algorithm. It is shown that the entropy method yields the same formula as that of the deterministic annealing. Clustering results as well as classification functions are compared. The classification functions for fuzzy clustering are fuzzy rules interpolating cluster memberships, while those for the latter two are probabilistic rules. Theoretical properties of the classification functions are studied. A numerical example is shown.KeywordsMixture ModelFuzzy ClusterTheoretical PropertyEntropy MethodCluster MembershipThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.