Ant Colony Optimization (ACO) Based Fuzzy C-Means (FCM) Clustering Approach for MRI Images Segmentation

Thousands of real-life ants have been used to improve the Ant Colony Optimization (ACO) technique. Significant improvement can be noticed in segmented images using ACO-based rather than random initialization. The segmentation quality has improved as a result of the noise reduction. Clustering based on FCM is used to segment medical images. To avoid local optimal results, cluster centres are initially determined using ACO. This paper shows that our approach (ACO-FCM) provides significant improvements. In ACO-FCM, brain tissues are classified more accurately because there are more correctly classified pixels. As a result of our approach, such tissues can be classified more accurately based on spatial informatio

Review on Fuzzy Clustering Algorithms

Image segmentation especially fuzzy-based segmentation techniques are widely used due to effective segmentation performance. For this reason, a number of algorithms are proposed in the literature. This paper presents a survey report of different types of classical fuzzy clustering techniques which are available in the literature

Optimized Fuzzy Cmeans – Fuzzy Covariance – Fuzzy Maximum Likelihood Estimation Clustering Method Based on Deferential Evolutionary Optimization Algorithm for Identification of Rock Mass Discontinuities Sets

Detecting of joint sets (clusters) is one of the most important processes in determining properties of fractures. Joints clustering and consequently, determination of the mean value representing each cluster is applicable to most rock mass studies. It is clear that the accuracy of the clustering process plays a key role in analyzing stability of infrastructures such as dams and tunnels and so on. Hence, in this paper, by reviewing several methods proposed for clustering fractures and considering their advantages and disadvantages, a three-stage hybrid method is developed which contains Fuzzy c-means, Fuzzy covariance and Fuzzy maximum likelihood estimation that by utilizing the modified orientation matrix had been optimized. This method is optimized by the Differential Evolutionary algorithm using a new and strong cost function which is defined as the computation core. In addition, using three clustering quality comparing criteria, the new developed method of differential evolutionary optimized of fuzzy cmeans - fuzzy covariance - fuzzy maximum likelihood estimation clustering method (DEF3) is compared with other base and common methods using field data. After doing the calculations, the developed method by giving the best values for all the criteria provided the best results and good stability in meeting different criteria. The DEF3 method was validated using actual field data which mapped in Rudbar Lorestan dam site. The results revealed that DEF3 acquired the best rank among the other method by getting the value of 0.5721 of Davis-Bouldin criterion, 1403.1 of Calinski-Harabasz criterion, and 0.83482 of Silihotte as comparing criteria of clustering methods

Evaluation of Clustering Algorithms on HPC Platforms

[EN] Clustering algorithms are one of the most widely used kernels to generate knowledge from large datasets. These algorithms group a set of data elements (i.e., images, points, patterns, etc.) into clusters to identify patterns or common features of a sample. However, these algorithms are very computationally expensive as they often involve the computation of expensive fitness functions that must be evaluated for all points in the dataset. This computational cost is even higher for fuzzy methods, where each data point may belong to more than one cluster. In this paper, we evaluate different parallelisation strategies on different heterogeneous platforms for fuzzy clustering algorithms typically used in the state-of-the-art such as the Fuzzy C-means (FCM), the Gustafson-Kessel FCM (GK-FCM) and the Fuzzy Minimals (FM). The experimental evaluation includes performance and energy trade-offs. Our results show that depending on the computational pattern of each algorithm, their mathematical foundation and the amount of data to be processed, each algorithm performs better on a different platform.This work has been partially supported by the Spanish Ministry of Science and Innovation, under the Ramon y Cajal Program (Grant No. RYC2018-025580-I) and by the Spanish "Agencia Estatal de Investigacion" under grant PID2020-112827GB-I00 /AEI/ 10.13039/501100011033, and under grants RTI2018-096384-B-I00, RTC-2017-6389-5 and RTC2019-007159-5, by the Fundacion Seneca del Centro de Coordinacion de la Investigacion de la Region de Murcia under Project 20813/PI/18, and by the "Conselleria de Educacion, Investigacion, Cultura y Deporte, Direccio General de Ciencia i Investigacio, Proyectos AICO/2020", Spain, under Grant AICO/2020/302.Cebrian, JM.; Imbernón, B.; Soto, J.; Cecilia-Canales, JM. (2021). Evaluation of Clustering Algorithms on HPC Platforms. Mathematics. 9(17):1-20. https://doi.org/10.3390/math917215612091

An Unsupervised Consensus Control Chart Pattern Recognition Framework

Early identification and detection of abnormal time series patterns is vital for a number of manufacturing. Slide shifts and alterations of time series patterns might be indicative of some anomaly in the production process, such as machinery malfunction. Usually due to the continuous flow of data monitoring of manufacturing processes requires automated Control Chart Pattern Recognition(CCPR) algorithms. The majority of CCPR literature consists of supervised classification algorithms. Less studies consider unsupervised versions of the problem. Despite the profound advantage of unsupervised methodology for less manual data labeling their use is limited due to the fact that their performance is not robust enough for practical purposes. In this study we propose the use of a consensus clustering framework. Computational results show robust behavior compared to individual clustering algorithms

GARCH-based robust clustering of time series

3nopartially_openIn this paper we propose different robust fuzzy clustering models for classifying heteroskedastic (volatility) time series, following the so-called model-based approach to time series clustering and using a partitioning around medoids procedure. The proposed models are based on a GARCH parametric modelingof the time series, i.e. the unconditional volatility and the time-varying volatility GARCH representation of the time series. We first suggest a timid robustification of the fuzzy clustering. Then, we propose three robust fuzzy clustering models belonging to the so-called metric, noise and trimmed approaches, respectively. Each model neutralizes the negative effects of the outliers in the clustering process in a different manner. In particular, the first robust model, based on the metric approach, achieves its robustness with respect to outliers by taking into account a “robust” distance measure; the second, based on the noise approach, achieves its robustness by introducing a noise cluster represented by a noise prototype; the third, based on the trimmed approach, achieves its robustness by trimming away a certain fraction of outlying time series. The usefulness and effectiveness of the proposed clustering models is illustrated by means of a simulation study and two applications in finance and economics.embargoed_20180131De Giovanni, Livia; D'Urso, Pierpaolo; Massari, RiccardoDE GIOVANNI, Livia; D'Urso, Pierpaolo; Massari, Riccard

Clustering Algorithms for Time Series Gene Expression in Microarray Data

Clustering techniques are important for gene expression data analysis. However, efficient computational algorithms for clustering time-series data are still lacking. This work documents two improvements on an existing profile-based greedy algorithm for short time-series data; the first one is implementation of a scaling method on the pre-processing of the raw data to handle some extreme cases; the second improvement is modifying the strategy to generate better clusters. Simulation data and real microarray data were used to evaluate these improvements; this approach could efficiently generate more accurate clusters. A new feature-based algorithm was also developed in which steady state value; overshoot, rise time, settling time and peak time are generated by the 2nd order control system for the clustering purpose. This feature-based approach is much faster and more accurate than the existing profile-based algorithm for long time-series data

The synthesis of multisensor non-destructive testing of civil engineering structural elements with the use of clustering methods

In the thesis, clustering-based image fusion of multi-sensor non-destructive (NDT) data is studied. Several hard and fuzzy clustering algorithms are analysed and implemented both at the pixel and feature level fusion. Image fusion of ground penetrating radar (GPR) and infrared\ud thermography (IRT) data is applied on concrete specimens with inbuilt artificial defects, as well as on masonry specimens where defects such as plaster delamination and structural cracking were generated through a shear test. We show that on concrete, the GK clustering algorithm exhibits the best performance since it is not limited to the detection of spherical clusters as are the FCM and PFCM algorithms. We also prove that clustering-based fusion outperforms supervised fusion, especially in situations with very limited knowledge about the material properties\ud and depths of the defects. Complementary use of GPR and IRT on multi-leaf masonry walls enabled the detection of the walls’ morphology, texture, as well as plaster delamination\ud and structural cracking. For improved detection of the latter two, we propose using data fusion at the pixel level for data segmentation. In addition to defect detection, the effect of moisture is analysed on masonry using GPR, ultrasonic and complex resistivity tomographies. Within the\ud thesis, clustering is also successfully applied in a case study where a multi-sensor NDT data set was automatically collected by a self-navigating mobile robot system. Besides, the classification of spectroscopic spatial data from concrete is taken under consideration. In both applications, clustering is used for unsupervised segmentation of data