Combining Fuzzy C-Means Clustering with Fuzzy Rough Feature Selection

Feature selection method based on stochastic fractal search henry gas solubility optimization algorithm

In most data mining tasks, feature selection is an essential preprocessing stage. Henry’s Gas Solubility Optimization (HGSO) algorithm is a physical heuristic algorithm based on Henry’s law, which simulates the process of gas solubility in liquid with temperature. In this paper, an improved Henry’s Gas Solubility Optimization based on stochastic fractal search (SFS-HGSO) is proposed for feature selection and engineering optimization. Three stochastic fractal strategies based on Gaussian walk, Lévy flight and Brownian motion are adopted respectively, and the diffusion is based on the high-quality solutions obtained by the original algorithm. Individuals with different fitness are assigned different energies, and the number of diffusing individuals is determined according to individual energy. This strategy increases the diversity of search strategies and enhances the ability of local search. It greatly improves the shortcomings of the original HGSO position updating method is single and the convergence speed is slow. This algorithm is used to solve the problem of feature selection, and KNN classifier is used to evaluate the effectiveness of selected features. In order to verify the performance of the proposed feature selection method, 20 standard UCI benchmark datasets are used, and the performance is compared with other swarm intelligence optimization algorithms, such as WOA, HHO and HBA. The algorithm is also applied to the solution of benchmark function. Experimental results show that these three improved strategies can effectively improve the performance of HGSO algorithm, and achieve excellent results in feature selection and engineering optimization problems.

Rough IPFCM Clustering Algorithm and Its Application on Smart Phones with Euclidean Distance

New interval clustering technology for symbolic data analysis (SDA) on smart phones is shown to be beneficial for mobile computing devices for smart data analysis in this paper. A new interval clustering method that combined the rough set with interval possibilistic fuzzy C-means (IPFCM) algorithm under Euclidean distance is proposed and implemented on smart phones. Symbolic clustering algorithms (SCAs) have been widely used for pattern recognition, data mining, artificial intelligence, etc. In general, the SCA is unsupervised classification that is divided into groups according to symbolic data sets. However, the traditional interval fuzzy C-means (IFCM) clustering method still has noisy and data overlapping problems associated with these symbolic interval data. Hence, a new rough set with the interval possibilistic fuzzy C-means (RIPFCM) clustering algorithm with Euclidean distance was proposed to address the symbolic interval data (SID). That is, the proposed method can perform better than the traditional IFCM clustering algorithm for SID clustering in noisy environments and with data overlapping problems. The new RIPFCM algorithm under the Euclidean distance method was proposed to deal with SID on new applications in smart phones. Consequently, this method shows the expansion of the smart phone’s computing power and its future application in new SDA.

Anomaly Detection in Automotive Industry Using Clustering Methods—A Case Study

In automotive industries, pricing anomalies may occur for components of different products, despite their similar physical characteristics, which raises the total production cost of the company. However, detecting such discrepancies is often neglected since it is necessary to find the problems considering the observation of thousands of pieces, which often present inconsistencies when specified by the product engineering team. In this investigation, we propose a solution for a real case study. We use as strategy a set of clustering algorithms to group components by similarity: K-Means, K-Medoids, Fuzzy C-Means (FCM), Hierarchical, Density-Based Spatial Clustering of Applications with Noise (DBSCAN), Self-Organizing Maps (SOM), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Differential Evolution (DE). We observed that the methods could automatically perform the grouping of parts considering physical characteristics present in the material master data, allowing anomaly detection and identification, which can consequently lead to cost reduction. The computational results indicate that the Hierarchical approach presented the best performance on 1 of 6 evaluation metrics and was the second place on four others indexes, considering the Borda count method. The K-Medoids win for most metrics, but it was the second best positioned due to its bad performance regarding SI-index. By the end, this proposal allowed identify mistakes in the specification and pricing of some items in the company.

Classification of the mechanism of toxicity as applied to human cell line ECV304

The objective of this study was to identify the pattern of cytotoxicity testing of the human cell line ECV304 using three techniques of an ensemble learning algorithm (bagging, boosting and stacking). The study of cell morphology of ECV304 cell line was conducted using impedimetric measurement. Three types of toxins were applied to the ECV304 cell line namely 1 mM hydrogen peroxide (H₂O₂), 5% dimethyl sulfoxide and 10 μg Saponin. The measurement was conducted using electrodes and lock-in amplifier to detect impedance changes during cytotoxicity testing within a frequency range 200 and 830 kHz. The results were analysed, processed and extracted using detrended fluctuation analysis to obtain characteristics and features of the cells when exposed to the each of the toxins. Three ensemble algorithms applied showed slightly different results on the performance for classifying the data set from the feature extraction that was performed. However, the results show that the cell reaction to the toxins could be classified.