Intuitionistic Fuzzy C-means Clustering Research Articles

An Intuitionistic Fuzzy C-Means and Local Information-Based DCT Filtering for Fast Brain MRI Segmentation.

Structural and photometric anomalies in the brain magnetic resonance images (MRIs) affect the segmentation performance. Moreover, a sudden change in intensity between two boundaries of the brain tissues makes it prone to data uncertainty, resulting in the misclassification of the pixels lying near the cluster boundaries. The discrete cosine transform (DCT) domain-based filtering is an effective way to deal with structural and photometric anomalies, while the intuitionistic fuzzy C-means (IFCM) clustering can handle the uncertainty using the intuitionistic fuzzy set (IFS) theory. In this background, we propose two novel approaches, namely, the DCT-based intuitionistic fuzzy C-means (DCT-IFCM) and the DCT-based local information IFCM (DCT-LIFCM), which effectively deal with the Rician and Gaussian noises and also handle the data uncertainty problem to provide high segmentation accuracy. The DCT-IFCM approach performs the histogram-based segmentation, while the DCT-LIFCM uses the pixel-wise computation to include the spatial information. Although the DCT-LIFCM delivers slightly better performance than the DCT-IFCM, the latter is very fast in providing equally high segmentation accuracy. An exhaustive performance analysis is provided to demonstrate the superior performance of the proposed algorithms compared with the state-of-the-art algorithms, including those based on the DCT-based filtering approach and the IFS theory.

Generalized Ordered Intuitionistic Fuzzy C-Means Clustering Algorithm Based on PROMETHEE and Intuitionistic Fuzzy C-Means

The problem of ordered clustering in the context of decision-making with multiple criteria has garnered significant interest from researchers in the field of management science and operational research. In real-world scenarios, the datasets often exhibit imprecision or uncertainty, which can lead to suboptimal ordered-clustering outcomes. However, the intuitionistic fuzzy c-means (IFCM) clustering algorithm enhances the accuracy and effectiveness of decision-making processes by effectively handling uncertain dataset information for clustering. Therefore, we propose a new clustering algorithm, called the generalized ordered intuitionistic fuzzy c-means (G-OIFCM), based on PROMETHEE and the IFCM clustering algorithm. Different from the classical IFCM clustering algorithm, we use positive flow ( φ + s i ∈ 0 , 1 ) and negative flow ( φ − s i ∈ 0 , 1 ) of PROMETHEE to generate ordered clusters within the intuitionistic environment. We define a new objective function based on the positive and negative flow of the PROMETHEE and IFCM clustering algorithm, whose properties are mathematically justified in terms of convergence and optimization. The performance of the proposed algorithm is evaluated using two different real-world datasets to assess both the ordered clustering and the quality of partitioning. To demonstrate the effectiveness of G-OIFCM, a comparison is conducted with three other algorithms: fuzzy c-means (FCM), ordered fuzzy c-means (OFCM), and an adaptive generalized intuitionistic fuzzy c-means (G-IFCM). The results demonstrate the effectiveness of G-OIFCM in enhancing optimal ordered clustering and utility when dealing with uncertainty in datasets.

A Fiedler’s Approach to LINEX Intuitionistic Fuzzy C-means Clustering Induced Spectral Initialization for Data Analysis

A Fiedler’s Approach to LINEX Intuitionistic Fuzzy C-means Clustering Induced Spectral Initialization for Data Analysis

USING INTUITIONISTIC FUZZY C-MEANS CLUSTERING ALGORITHMS TO MODEL COVID-19 CASES FOR COUNTRIES IN THE WORLDWIDE

Every day, the number of newly confirmed cases of coronavirus (COVID-19) rises in many countries. It is critical to adjust policies and plans in order to investigate the relationships between the distributions of the spread of this virus in other countries. During this study, the intuitionistic fuzzy c-means (IFCM) clustering method is used to compare and cluster the distributions of COVID-19 spread in 62 countries. Using the IFCM clustering algorithm, the study aims to cluster the countries that use environmental, economic, social, health, and related measurements that affect disease spread to implement policies that regulate disease spread. As a result, countries that have similar factors can take proactive measures to address the pandemic. The data are obtained for 62 countries, and six different feature variables (factors associated with the spread of COVID-19) are determined. The data are obtained for 62 countries, and six variables with different characteristics (linked to the spread of COVID-19) are identified. In this study, the IFCM clustering algorithm is used to determine the dynamic behavior of COVID-19 based on real-world data for multiple countries and Turkey around the world. Data analysis is performed through MATLAB 2018a and R programs. The clustering results revealed that the distribution of dissemination in Brazil, India, and the United States was nearly identical and distinct from that of the 59 other countries.

Chimp Optimization Algorithm Influenced Type-2 Intuitionistic Fuzzy C-Means Clustering-Based Breast Cancer Detection System.

In recent years, breast cancer detection is an important area of concentration towards curative image dispensation and exploration. Detection of a disease at an early stage is an important factor in taking it to the next level of treatment. Accuracy plays an important role in the detection of disease. COA-T2FCM (Chimp Optimization Algorithm Based Type-2 Intuitionistic Fuzzy C-Means Clustering) is constructed for detection of such malignancy with the highest accuracy in this paper. The proposed detection process is designed with the combination of type-2 intuitionistic fuzzy c-means clustering in addition to oppositional function. In the type-2 intuitionistic fuzzy c-means clustering, the efficient cluster center can be preferred using the chimp optimization algorithm. Initially, the objective function of the type-2 intuitionistic fuzzy c-means clustering is considered. The chimp optimization algorithm is utilized to optimize the cluster center and fuzzifier in the clustering method. The projected technique is implemented, and in addition, performance metrics such as specificity, sensitivity, accuracy, Jaccard Similarity Index (JSI), and Dice Similarity Coefficient (DSC) are assessed. The projected technique is compared with the conventional technique such as fuzzy c means clustering and k mean clustering methods. The resulting method was also compared with existing methods to ensure the accuracy in the proposed method. The proposed algorithm is tested for its effectiveness on the mammogram images of the three different datasets collected from the Mini-Mammographic Image Analysis Society (Mini-MIAS), the Digital Database for Screening Mammography (DDSM), and Inbreast. The accuracy and Jaccard index score are generally used to measure the similarity between the proposed output and the actual cancer affected regions from the image considered. On an average the proposed method achieved an accuracy of 97.29% and JSI of 95.

A Superpixel Spatial Intuitionistic Fuzzy C-Means Clustering Algorithm for Unsupervised Classification of High Spatial Resolution Remote Sensing Images

This paper proposes a superpixel spatial intuitionistic fuzzy C-means (SSIFCM) clustering algorithm to address the problems of misclassification, salt and pepper noise, and classification uncertainty arising in the pixel-level unsupervised classification of high spatial resolution remote sensing (HSRRS) images. To reduce information redundancy and ensure noise immunity and image detail preservation, we first use a superpixel segmentation to obtain the local spatial information of the HSRRS image. Secondly, based on the bias-corrected fuzzy C-means (BCFCM) clustering algorithm, the superpixel spatial intuitionistic fuzzy membership matrix is constructed by counting an intuitionistic fuzzy set and spatial function. Finally, to minimize the classification uncertainty, the local relation between adjacent superpixels is used to obtain the classification results according to the spectral features of superpixels. Four HSRRS images of different scenes in the aerial image dataset (AID) are selected to analyze the classification performance, and fifteen main existing unsupervised classification algorithms are used to make inter-comparisons with the proposed SSIFCM algorithm. The results show that the overall accuracy and Kappa coefficients obtained by the proposed SSIFCM algorithm are the best within the inter-comparison of fifteen algorithms, which indicates that the SSIFCM algorithm can effectively improve the classification accuracy of HSRRS image.

Deep neural learning based protein function prediction.

It is vital for the annotation of uncharacterized proteins by protein function prediction. At present, Deep Neural Network based protein function prediction is mainly carried out for dataset of small scale proteins or Gene Ontology, and usually explore the relationships between single protein feature and function tags. The practical methods for large-scale multi-features protein prediction still need to be studied in depth. This paper proposes a DNN based protein function prediction approach IGP-DNN. This method uses Grasshopper Optimization Algorithm (GOA) and Intuitionistic Fuzzy c-Means clustering (IFCM) based protein function modules extracting algorithm to extract the features of protein modules, utilizing Kernel Principal Component Analysis (KPCA) method to reduce the dimensionality of the protein attribute information, and integrating module features and attribute features. Inputting integrated data into DNN through multiple hidden layers to classify proteins and predict protein functions. In the experiments, the F-measure value of IGP-DNN on the DIP dataset reaches 0.4436, which shows better performance.

Natural gas consumption behavior of companies by clustering analysis

We have still consumed natural gas as a restricted source of energy in our daily life. Moreover, the consumption of natural gas energy will continue to increase by the year. Although many studies have focused on electrical energy consumption, natural gas is another significant energy source that can be examined. Since companies consume much more gas, their gas consumption data are examined in this study. The study contributes to the literature by applying intuitionistic fuzzy c-means (IFCM) methodology to the natural gas industry. The main motivation and advantage of the methodology is two-fold. Because of its fuzziness, one data point can be assigned into more than one cluster, similar to real-world cases. Because of its intuitionistic side, it considers membership, non-membership and hesitant degrees. These two strengths of IFCM improves the clustering accuracy. IFCM clustering was used to arrange the companies with respect to the consumption amount to increase the understandability because 1049 companies’ consumption data were collected. A calendar view was developed to visualize the consumption amounts in the clusters. The changes in consumption amounts were presented in different weather temperatures. Whereas some clustered companies were directly affected by temperature changes, others were not affected. The companies in the clusters were analyzed with respect to two main criteria: regularity and complexity. The findings showed while high levels in routine are related to manufacturing companies, high complexity level is an indicator of being active in the service industry.

Generalized intuitionistic fuzzy c-means clustering algorithm using an adaptive intuitionistic fuzzification technique

In real-world scenario, mostly, the datasets are either imprecise or uncertain in their original form. Due to this reason, the clustering of such datasets is unsatisfactory and we often get compromised results. The information present in the dataset can be made precise and useful with the popular generalization of fuzzy sets known as Atanassov intuitionistic fuzzy sets (AIFSs). Therefore, the AIFS-based c-means clustering algorithm becomes a convenient way for clustering uncertain and vague datasets. In the paper, we propose an intuitionistic fuzzy-based algorithm, namely Generalized Intuitionistic Fuzzy c-Means (G-IFCM) clustering algorithm which uses an adaptive AIFS Euclidean distance measure in its criterion function to cluster the dataset under intuitionistic fuzzy environment. The proposed intuitionistic fuzzification method incorporates a technique to transform the dataset into AIFS and maintains its original structure that tends to change during any fuzzification process. Further, simulation experiments are also conducted on few UCI machine learning repository datasets using G-IFCM and its performance is compared with some known clustering algorithms. The efficacy of the algorithm is tested with some popular benchmark indexes that check the cluster validity and clustering performance of G-IFCM. Finally, the computation suggests efficient performance of G-IFCM where the best choice of fuzzy factor, m probably lies in the interval [1, 2] that indicates reduction in the expense of computation.

An image segmentation method based on a modified local-information weighted intuitionistic Fuzzy C-means clustering and Gold-panning Algorithm

The image segmentation method based on clustering analysis has the advantages of small sample space constraints and strong universality. As an unsupervised clustering algorithm, the fuzzy C-means clustering algorithm is widely used in practical engineering. However, it is still some shortcomings: the fuzzy C-means clustering algorithm is difficult to interpret the noise effectively, which makes it more sensitive to the noise, and the selection of key parameters has to be made by trial and error experiments, reducing the adaptability of the algorithm. Besides, its iteration process is heavily influenced by the initial clustering centers and easy to fall into local optimum. Therefore, an intuitionistic Fuzzy C-means clustering method, based on local-information weight, is proposed in this paper. By introducing the local-information weight, the proposed algorithm adjusts the local-information influence weight adaptively in fuzzy partition, which enhances its robustness to noisy images. Furthermore, a novel swarm intelligence algorithm, called the Gold-Panning Algorithm, is proposed to optimize the initial clustering centers and key parameters in the clustering algorithm. By utilizing the Gold-Panning Algorithm, the adaptability of the proposed clustering algorithm is further improved. In this paper, the proposed methods are explained in detail and compared with the existing methods to demonstrate its superior performance.

Kernel-Based Intuitionistic Fuzzy Clustering Image Segmentation Based on Grey Wolf Optimizer With Differential Mutation

Conventional fuzzy clustering algorithms present several disadvantages with respect to image segmentation, including a tendency to arrive at local optima and a relatively high sensitivity to noise and initial cluster centers. To address these issues, we herein propose a kernel-based intuitionistic fuzzy clustering approach combining an improved grey wolf optimizer with a kernel-based intuitionistic fuzzy C-means clustering (IGWO-KIFCM) algorithm capable of carrying out differential mutations for image segmentation. The proposed method extracts spatial information from images and then applies a kernel-based intuitionistic fuzzy clustering objective function to improve the robustness of the algorithm against noise. To cope with the initial sensitivity and local optima issues, we develop an improved grey wolf optimizer based on differential mutation for the global optimization of the cluster centers. A comparative optimization assessment using six classic functions reveals that the improved grey wolf optimizer algorithm outperforms both the grey wolf optimizer and mean grey wolf optimizer algorithms in terms of searching ability and does not easily run into local optima. Moreover, the IGWO-KIFCM algorithm surpasses several other algorithms with respect to clustering performance across multiple datasets, and achieves good results in segmenting images with various types of noises.

Intuitionistic fuzzy c-means clustering algorithm based on a novel weighted proximity measure and genetic algorithm

In the era of big data, the research on clustering technologies is a popular topic because they can discover the structure of complex data sets with minimal prior knowledge. Among the existing soft clustering technologies, as an extension of fuzzy c-means (FCM) algorithm, the intuitionistic FCM (IFCM) algorithm has been widely used due to its superiority in reducing the effects of outliers/noise and improving the clustering accuracy. In the existing IFCM algorithm, the measurement of proximity degree between a pair of objects and the determination of parameters are two critical problems, which have considerable effects on the clustering results. Therefore, we propose an improved IFCM clustering technique in this paper. Firstly, a novel weighted proximity measure, which aggregates weighted similarity and correlation measures, is proposed to evaluate not only the closeness degree but also the linear relationship between two objects. Subsequently, genetic algorithms are utilized for identifying the optimal parameters. Lastly, experiments on the proposed IFCM technique are conducted on synthetic and UCI data sets. Comparisons with other approaches in cluster evaluation indexes indicate the effectiveness and superiority of our method.

Change Detection in Multitemporal High Spatial Resolution Remote-Sensing Images Based on Saliency Detection and Spatial Intuitionistic Fuzzy C-Means Clustering

In order to improve the change detection accuracy of multitemporal high spatial resolution remote-sensing (HSRRS) images, a change detection method of multitemporal remote-sensing images based on saliency detection and spatial intuitionistic fuzzy C-means (SIFCM) clustering is proposed. Firstly, the cluster-based saliency cue method is used to obtain the saliency maps of two temporal remote-sensing images; then, the saliency difference is obtained by subtracting the saliency maps of two temporal remote-sensing images; finally, the SIFCM clustering algorithm is used to classify the saliency difference image to obtain the change regions and unchange regions. Two data sets of multitemporal high spatial resolution remote-sensing images are selected as the experimental data. The detection accuracy of the proposed method is 96.17% and 97.89%. The results show that the proposed method is a feasible and better performance multitemporal remote-sensing image change detection method.

An Intuitionistic Kernel-Based Fuzzy C-Means Clustering Algorithm With Local Information for Power Equipment Image Segmentation

With the transformation of the national energy and power sector, the steady advancement of intelligent power grid construction and the continuous improvement of the Ubiquitous Power Internet of Things technology framework, it has further requirements for realizing state comprehensive awareness and efficient processing of information data, and has been widely used in power equipment. The infrared image recognition technology, which has been widely used in thermal fault diagnosis of power equipment, also requires deeper research. For traditional Intuitionistic Fuzzy C-means (IFCM) algorithm for image segmentation is sensitive to the clustering center lead to low final clustering precision and detail, the time complexity and the high shortage. The paper puts forward a kind of applicable to power equipment of the infrared image segmentation based on space distribution information of Intuitionistic Fuzzy clustering algorithm. Non-target objects with high intensity and uneven image intensity in infrared image have strong interference to image segmentation. The proposed algorithm can effectively suppress the interference. Firstly, the gaussian model is introduced into the global spatial distribution information of power equipment to improve the IFCM. Secondly, the spatial operator optimization membership function of local spatial information is used to solve the problem of edge blurring and uneven image intensity. Through experiments on the data set containing 300 infrared images of power equipment, the relative regional error rate is about 10%, which is less affected by the change of fuzzy factor m. The effectiveness and applicability of this algorithm are verified, which is obviously better than other comparison algorithms.

An Enhanced Spatial Intuitionistic Fuzzy C-means Clustering for Image Segmentation

Intuitionistic based Fuzzy clustering is a popular method in the field of image segmentation. The widely used Intuitionistic Fuzzy C-means (IFCM) based image segmentation is sensitive to noise since it uses only distance criterion in the feature space to segment the images. To overcome this, an enhanced spatial intuitionistic fuzzy c-means clustering algorithm is proposed that uses:- (i) an intuitionistic fuzzification of image to simplify the representation of the image (ii) an improved method to calculate the hesitation degree in the images. (iii) the spatial property of an image in order to make segmentation more robust and effective. The performance of the proposed method is evaluated for synthetic and real images. The result indicates the effectiveness of the proposed methodology over existing methodologies.

Robust credibilistic intuitionistic fuzzy clustering for image segmentation

To improve the anti-noise ability of credibilistic intuitionistic fuzzy c-means clustering method (CIFCM) for image segmentation, this paper proposes a robust credibilistic intuitionistic fuzzy c-means clustering method based on credibility of pixels and intuitionistic fuzzy entropy. Firstly, a new similarity measure is constructed by utilizing the grayscale and spatial relationship between the current pixel and its neighborhood pixels. Secondly, it is embedded into the objective function of credibilistic intuitionistic fuzzy c-means clustering, and a new robust clustering method with spatial constraints is presented to effectively solve the segmentation problem of image corrupted by high noise. In the end, the convergence of this proposed robust clustering method is strictly proved by iterated convergence theorem. Experimental results show that proposed algorithm has better noise-suppression ability and more satisfactory segmentation results than CIFCM algorithm.

Spatial Condition in Intuitionistic Fuzzy C-Means Clustering for Segmentation of Teeth in Dental Panoramic Radiographs

Dental panoramic radiographs heavily depend on the performance of the segmentation method due to the presence of unevenly illumination and low contrast of the images. Conditional Spatial Fuzzy C-mean (csFCM) Clustering have been proposed to achieve through the incorporation of the component and added in the FCM to cluster grouping. This algorithm directs with consideration conditioning variables that consider membership value. However, csFCM does not consider Intuitionistic Fuzzy Set to take final membership and final non-membership value into account, the effect does not wipe off the deviation by illumination and low contrast of the images completely for improvement to skip some scope. In this current paper, we introduced a new image segmentation method namely Conditional Spatial in Intuitionistic Fuzzy C-Means Clustering for Segmentation of Teeth in Dental Panoramic Radiographs. Our proposed method adds hesitation function aiming to settle the indication of the knowledge lack that belongs to the final membership function to get a better segmentation result. The experiment result shows this method achieves better segmentation performance with misclassification error (ME) and relative foreground area error (RAE) values are 4.77 and 4.27 respectively.

Kernel-Distance-Based Intuitionistic Fuzzy c-Means Clustering Algorithm and Its Application

Image segmentation plays an important role in machine vision, image recognition, and imaging applications. Based on the fuzzy c-means clustering algorithm, a kernel-distance-based intuitionistic fuzzy c-means clustering (KIFCM) algorithm is proposed. First, a fuzzy complement operator is used to generate the membership degree whereby the hesitation degree of intuitionistic fuzzy set is generated; second, a kernel-induced function is used to calculate the distance from each point to the cluster center instead of the Euclidean distance; third, a new objective function that includes the hesitation degree is established, and the optimization of the objective function results in new iterative expressions for the membership degree and the cluster center. The proposed KIFCM algorithm is compared with the fuzzy c-means clustering (FCM) algorithm, the kernel fuzzy c-means clustering (KFCM) algorithm, and the intuitionistic fuzzy c-means clustering (IFCM) algorithm in segmenting five images. The experimental results verify the effectiveness and superiority of our proposed KIFCM algorithm.

Type-1 recurrent intuitionistic fuzzy functions for forecasting

In this study, a novel forecasting method that employs intuitionistic fuzzy c-means clustering and a grey wolf optimizer in recurrent type-1 fuzzy functions (R-T1FFs) is introduced. R-T1FFs, which adapt to the moving average (MA) along with an autoregressive model (AR), were introduced recently to improve the forecasting performances of type-1 fuzzy functions, which adapted solely to the AR model. Because the objective function of R-T1FFs was non-derivative, particle swarm optimization was used to estimate the coefficients of the model. Because R-T1FFs calculate the disturbance terms for the MA model recursively, the model is computationally intensive. Therefore, the proposed method employs a grey wolf optimizer for training processes. Examples in the literature demonstrate that the grey wolf optimizer performs well when obtaining model coefficients because convergence is faster owing to a continuous reduction in the search space and reduced storage requirements. Another contribution of the proposed method is an improved forecasting accuracy, which is obtained by quantifying the hesitancy with which an observation belongs to a cluster given a certain degree of membership. A comparison of the proposed method with numerous existing methods is conducted for 12 practical time series datasets as applications. The accuracy of the proposed method is investigated using root-mean-squared error, mean absolute percentage error, and correlation coefficients; further, whether it produces significantly better outcomes than the existing methods is verified using paired t-tests. For example, it is clear by looking at the average RMSEs of the methods that the best forecasting performance is produced by the proposed method for Taiwan stock exchange datasets.

Network traffic forecasting model based on long-term intuitionistic fuzzy time series

In this paper, a network traffic forecasting model based on long-term intuitionistic fuzzy time series (LT-IFTS) is proposed. It describes the fuzziness and uncertainty of network flow and improves the traffic forecasting performance. The multi-input multi-output (MIMO) intuitionistic fuzzy time series forecasting model, namely, (p−q) IFTS is defined. An intuitionistic fuzzy time series vectors clustering algorithm based on vector variation pattern is given. The cluster centroid in the proposed model is quite different from the traditional method. As a kind of typical time series data, the network flow forecasting system is constructed particularly. Characteristic intuitionistic fuzzy is a practical method to manage the fuzziness and uncertainty of network traffic data. The network traffic data is intuitionistic fuzzified and vector quantized. The time series vectors are gathered based on the improved intuitionistic fuzzy c-means clustering and matched with centroids by coordinate translation. Compared with other traditional forecasting models, the improved FCM clustering algorithm increases discrimination of time series segments. In addition, the long-term scheme improves forecasting efficiency and reduces computational complexity than other single-output models. In experiments, the proposed model and relevant models are implemented on four different scales network traffic dataset from MAWI. The experiment result indicates that the proposed model is with better generalization performance.