Robust Dataset Classification Approach Based on Neighbor Searching and Kernel Fuzzy C-Means

Dataset classification is an essential fundament of computational intelligence in cyber-physical systems(CPS).Due to the complexity of CPS dataset classification and the uncertainty of clustering number,this paper focuses on clarifying the dynamic behavior of acceleration dataset which is achieved from micro electro mechanical systems(MEMS)and complex image segmentation.To reduce the impact of parameters uncertainties with dataset classification,a novel robust dataset classification approach is proposed based on neighbor searching and kernel fuzzy c-means(NSKFCM)methods.Some optimized strategies,including neighbor searching,controlling clustering shape and adaptive distance kernel function,are employed to solve the issues of number of clusters,the stability and consistency of classification,respectively.Numerical experiments finally demonstrate the feasibility and robustness of the proposed method.

Fault Pattern Recognition based on Kernel Method and Fuzzy C-means

A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the clustering of data sets and fault pattern recognitions. The present method firstly maps the data from their original space to a high dimensional Kernel space which makes the highly nonlinear data in low-dimensional space become linearly separable in Kernel space. It highlights the differences among the features of the data set. Then fuzzy C-means （FCM） is conducted in the Kernel space. Each data is assigned to the nearest class by computing the distance to the clustering center. Finally, test set is used to judge the results. The convergence rate and clustering accuracy are better than traditional FCM. The study shows that the method is effective for the accuracy of pattern recognition on rotating machinery.

Fuzzy collaborative filtering with multiple agents

Automated collaborative filtering has become a popular technique for reducing information overload. We have developed a new method for recommending items using multiple agents. The agents were established by employing the fuzzy C-means clustering technique. We employ these agents collaborating each other to get recommendation for users. The results were evaluated by using MovieLens movie＇s rating data. It is shown that the algorithm is an effective metrics in collaborative filtering.

Gene Coding Sequence Identification Using Kernel Fuzzy C-Mean Clustering and Takagi-Sugeno Fuzzy Model

Sequence analysis technology under big data provides unprecedented opportunities for modern life science. A novel gene coding sequence identification method is proposed in this paper. Firstly, an improved short-time Fourier transform algorithm based on Morlet wavelet is applied to extract the power spectrum of DNA sequence. Then, threshold value determination method based on kernel fuzzy C-mean clustering is used to combine Signal to Noise Ratio (SNR) data of exon and intron into a sequence, classify the sequence into two types, calculate the weighted sum of two SNR clustering centers obtained and the discrimination threshold value. Finally, exon interval endpoint identification algorithm based on Takagi-Sugeno fuzzy identification model is presented to train Takagi-Sugeno model, optimize model parameters with Levenberg-Marquardt least square method, complete model and determine fuzzy rule. To verify the effectiveness of the proposed method, example tests are conducted on typical gene sequence sample data.

Kernel method-based fuzzy clustering algorithm

The fuzzy C-means clustering algorithm(FCM) to the fuzzy kernel C-means clustering algorithm(FKCM) to effectively perform cluster analysis on the diversiform structures are extended, such as non-hyperspherical data, data with noise, data with mixture of heterogeneous cluster prototypes, asymmetric data, etc. Based on the Mercer kernel, FKCM clustering algorithm is derived from FCM algorithm united with kernel method. The results of experiments with the synthetic and real data show that the FKCM clustering algorithm is universality and can effectively unsupervised analyze datasets with variform structures in contrast to FCM algorithm. It is can be imagined that kernel-based clustering algorithm is one of important research direction of fuzzy clustering analysis.

A User-Transformer Relation Identification Method Based on QPSO and Kernel Fuzzy Clustering

User-transformer relations are significant to electric power marketing,power supply safety,and line loss calculations.To get accurate user-transformer relations,this paper proposes an identification method for user-transformer relations based on improved quantum particle swarm optimization(QPSO)and Fuzzy C-Means Clustering.The main idea is:as energymeters at different transformer areas exhibit different zero-crossing shift features,we classify the zero-crossing shift data from energy meters through Fuzzy C-Means Clustering and compare it with that at the transformer end to identify user-transformer relations.The proposed method contributes in three main ways.First,based on the fuzzy C-means clustering algorithm(FCM),the quantum particle swarm optimization(PSO)is introduced to optimize the FCM clustering center and kernel parameters.The optimized FCM algorithm can improve clustering accuracy and efficiency.Since easily falls into a local optimum,an improved PSO optimization algorithm(IQPSO)is proposed.Secondly,considering that traditional FCM cannot solve the linear inseparability problem,this article uses a FCM(KFCM)that introduces kernel functions.Combinedwith the IQPSOoptimization algorithm used in the previous step,the IQPSO-KFCM algorithm is proposed.Simulation experiments verify the superiority of the proposed method.Finally,the proposed method is applied to transformer detection.The proposed method determines the class members of transformers and meters in the actual transformer area,and obtains results consistent with actual user-transformer relations.This fully shows that the proposed method has practical application value.

Mercer Kernel Based Fuzzy Clustering Self-Adaptive Algorithm

A novel mercer kernel based fuzzy clustering self-adaptive algorithm is presented. The mercer kernel method is introduced to the fuzzy c-means clustering. It may map implicitly the input data into the high-dimensional feature space through the nonlinear transformation. Among other fuzzy c-means and its variants, the number of clusters is first determined. A self-adaptive algorithm is proposed. The number of clusters, which is not given in advance, can be gotten automatically by a validity measure function. Finally, experiments are given to show better performance with the method of kernel based fuzzy c-means self-adaptive algorithm.

A New Integrated Fuzzifier Evaluation and Selection (NIFEs) Algorithm for Fuzzy Clustering

Fuzzy C-means (FCM) is simple and widely used for complex data pattern recognition and image analyses. However, selecting an appropriate fuzzifier (m) is crucial in identifying an optimal number of patterns and achieving higher clustering accuracy, which few studies have investigated. Built upon two existing methods on selecting fuzzifier, we developed an integrated fuzzifier evaluation and selection algorithm and tested it using real datasets. Our findings indicate that the consistent optimal number of clusters can be learnt from testing different fuzzifiers for each dataset and the fuzzifier with the lowest value for this consistency should be selected for clustering. Our evaluation also shows that the fuzzifier impacts the clustering accuracy. For longitudinal data with missing values, m = 2 could be an empirical rule to start fuzzy clustering, and the best clustering accuracy was achieved for tested data, especially using our multiple-imputation based fuzzy clustering.

Enhancing Multicriteria-Based Recommendations by Alleviating Scalability and Sparsity Issues Using Collaborative Denoising Autoencoder

A Recommender System(RS)is a crucial part of several firms,particularly those involved in e-commerce.In conventional RS,a user may only offer a single rating for an item-that is insufficient to perceive consumer preferences.Nowadays,businesses in industries like e-learning and tourism enable customers to rate a product using a variety of factors to comprehend customers’preferences.On the other hand,the collaborative filtering(CF)algorithm utilizing AutoEncoder(AE)is seen to be effective in identifying user-interested items.However,the cost of these computations increases nonlinearly as the number of items and users increases.To triumph over the issues,a novel expanded stacked autoencoder(ESAE)with Kernel Fuzzy C-Means Clustering(KFCM)technique is proposed with two phases.In the first phase of offline,the sparse multicriteria rating matrix is smoothened to a complete matrix by predicting the users’intact rating by the ESAE approach and users are clustered using the KFCM approach.In the next phase of online,the top-N recommendation prediction is made by the ESAE approach involving only the most similar user from multiple clusters.Hence the ESAE_KFCM model upgrades the prediction accuracy of 98.2%in Top-N recommendation with a minimized recommendation generation time.An experimental check on the Yahoo!Movies(YM)movie dataset and TripAdvisor(TA)travel dataset confirmed that the ESAE_KFCM model constantly outperforms conventional RS algorithms on a variety of assessment measures.

Fast global kernel fuzzy c-means clustering algorithm for consonant/vowel segmentation of speech signal

We propose a novel clustering algorithm using fast global kernel fuzzy c-means-F(FGKFCM-F), where F refers to kernelized feature space. This algorithm proceeds in an incremental way to derive the near-optimal solution by solving all intermediate problems using kernel-based fuzzy c-means-F(KFCM-F) as a local search procedure. Due to the incremental nature and the nonlinear properties inherited from KFCM-F, this algorithm overcomes the two shortcomings of fuzzy c-means(FCM): sen- sitivity to initialization and inability to use nonlinear separable data. An accelerating scheme is developed to reduce the compu-tational complexity without significantly affecting the solution quality. Experiments are carried out to test the proposed algorithm on a nonlinear artificial dataset and a real-world dataset of speech signals for consonant/vowel segmentation. Simulation results demonstrate the effectiveness of the proposed algorithm in improving clustering performance on both types of datasets.

IFCEM based recognition method for target with interval-overlapped hybrid attributes

When the attributes of unknown targets are not just numerical attributes,but hybrid attributes containing linguistic attributes,the existing recognition methods are not effective.In addition,it is more difficult to identify the unknown targets densely distributed in the feature space,especially when there is interval overlap between attribute measurements of different target classes.To address these problems,a novel method based on intuitionistic fuzzy comprehensive evaluation model(IFCEM)is proposed.For numerical attributes,targets in the database are divided into individual classes and overlapping classes,and for linguistic attributes,continuous interval-valued linguistic term set(CIVLTS)is used to describe target characteristic.A cloud modelbased method and an area-based method are proposed to obtain intuitionistic fuzzy decision information of query target on numerical attributes and linguistic attributes respectively.An improved inverse weighted kernel fuzzy c-means(IWK-FCM)algorithm is proposed for solution of attribute weight vector.The possibility matrix is applied to determine the identity and category of query target.Finally,a case study composed of parameter sensitivity analysis,recognition accuracy analysis.and comparison with other methods,is taken to verify the superiority of the proposed method.

Substation clustering based on improved KFCM algorithm with adaptive optimal clustering number selection

The premise and basis of load modeling are substation load composition inquiries and cluster analyses.However,the traditional kernel fuzzy C-means(KFCM)algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions.To overcome these limitations,an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper.This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm.The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio.Compared with the traditional KFCM algorithm,the enhanced KFCM algorithm has robust clustering and comprehensive abilities,enabling the efficient convergence to the global optimal solution.

多核模糊聚类算法的研究

针对多类样本数据,提出1种多核模糊聚类算法。通过选取子核函数及其参数构造多核函数,使得输入空间的样本经多核函数映射后,增大不同类别样本间的差别,提高核函数的学习能力和泛化能力。聚类实验表明,多核函数模糊聚类对于多类样本数据具有比单核更好的聚类效果。

基于模糊核聚类的乙烯裂解深度DE-LSSVM多模型建模

乙烯裂解深度的建模与控制对于裂解炉的实时优化具有重要意义。针对石脑油原料组分复杂、油品特性波动大等状况,采用模糊核聚类对石脑油数据库进行最优划分,建立最小二乘支持向量机的多模型,对于最小二乘支持向量机中模型的参数选取,利用差分进化算法进行参数寻优,提高了模型的精度和泛化能力。通过对现场数据的建模实验,结果表明:基于模糊核聚类的乙烯裂解深度最小二乘支持向量机多模型跟踪性能良好,预测精度较高。

多发性硬化症MR图像分割新算法研究

提出了一种针对多发性硬化症病灶T2加权脑部磁共振(MR)图像的分割算法。根据多发性硬化症病灶和脑脊液在T2加权像上同表现为高亮度信号的特点,把模糊C均值分割算法与形态学方法相结合,提出了基于核模糊C均值的多发性硬化症病灶分割算法。该算法首先用改进的核模糊C均值算法做基础分割,再用形态学方法提取出多发性硬化症病灶得到最终分割结果。通过对多发性硬化症模拟脑部MR图像的分割结果表明,算法能够比较准确地分割多发性硬化症病灶。

分割多发性硬化症白质病灶的新方法

多发性硬化症(MS)是一种慢性的中枢神经系统疾病,其病灶可由常规脑部核磁共振成像(cMRI)进行检测。为提高图像处理的效率,提出了一种自动分割cMRI图像中的MS白质病灶(WML)的新方法。首先将模糊核聚类(KFCM)用于预处理后的T1加权像,得到白质图像;然后利用一个种子点的区域生长处理白质图像,提取出一个二值模板。该模板与对应的T2加权像进行乘积,得到一幅仅包含白质、病灶及背景的图像;最后再次利用KFCM分割图像,得到病灶的核心部分。实验结果表明,所提出的方法能快速、有效地分割出低噪声仿真图像中的WML,且Dice相似性系数平均值在80%以上。

基于模糊多核学习的改进支持向量机算法研究

针对传统SVM对噪声点和孤立点敏感的问题,以及不能解决样本特征规模大、含有异构信息、在特征空间中分布不平坦的问题,将模糊隶属度融入多核学习中,提出了一种模糊多核学习的方法;通过实验验证了模糊多核学习比传统SVM、模糊支持向量机以及多核学习具有更好的分类效果,从而验证了所提方法能够有效的克服传统SVM对噪声点敏感以及数据分布不平坦的问题。

基于MPA优化MKL-FSVDD模型的聚合釜设备故障诊断

针对化工流程工业数据具有强非线性、易受噪声影响和故障为多分类的问题,提出一种基于海洋捕食者算法(MPA)优化多核学习-模糊支持向量机数据描述(MKL-FSVDD)的故障诊断方法。利用MKL构建的多核函数,弥补单核函数的局限性,对非线性故障数据分类具有较强的适应性;引入MPA对MKL-FSVDD模型的核参数进行高效寻优,解决核参数选择难题。通过在TE数据平台上的对照实验,验证MPA-MKL-FSVDD模型故障诊断的有效性能;最后将故障诊断模型应用于聚氯乙烯(PVC)聚合反应中,利用70m^(3)的聚合釜设备历史数据集进行仿真验证。结果表明该方法充分利用复杂样本集的数据信息,并在参数寻优阶段快速、稳定获得最优解,保证了故障分类的效率和准确度。

联机核模糊C均值聚类方法

基于核模糊C均值(kernel fuzzy C-means,KFCM)提出了一种针对较大规模数据的联机核模糊C均值(online kernel fuzzy C-means,OKFCM)算法,同时考虑到核参数的选择困境,借鉴多核学习思想,进一步衍生出了联机多核模糊C均值(online multiple kernel fuzzy C-means,OMKFCM)算法。由此,在有效缓和核参数选择难题的同时,新算法不仅继承了KFCM优越的聚类特性且适合聚类数据流。最后,在人工和真实数据集上验证了新提出的核联机算法比现有基于划分的大规模数据处理算法具有更好的性能。