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.

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.

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.

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.

Modified possibilistic clustering model based on kernel methods

A novel model of fuzzy clustering using kernel methods is proposed. This model is called kernel modified possibilistic c-means （KMPCM） model. The proposed model is an extension of the modified possibilistic c-means （MPCM） algorithm by using kernel methods. Different from MPCM and fuzzy c-means （FCM） model which are based on Euclidean distance, the proposed model is based on kernel-induced distance. Furthermore, with kernel methods the input data can be mapped implicitly into a high-dimensional feature space where the nonlinear pattern now appears linear. It is unnecessary to do calculation in the high-dimensional feature space because the kernel function can do it. Numerical experiments show that KMPCM outperforms FCM and MPCM.

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.

基于VMD与KFCM的柴油机故障诊断算法

针对柴油机的故障诊断问题,提出了一种基于变分模态分解(variational mode decomposition,简称VMD)与核模糊C均值聚类算法(kernel fuzzy C-means clustering,简称KFCM)联合的故障诊断方法。首先,针对VMD算法中分解层数K的选择问题进行了自适应优化;然后,从优化VMD算法的分解结果中选取3个关键分量计算最大奇异值,并将其作为3维的特征向量输入KFCM算法中进行分类识别;最后,对仿真信号以及某型柴油机的模拟故障实验信号使用优化VMD、传统VMD和经验模态分解(empirical mode decomposition,简称EMD)方法分别进行分解与识别。结果表明,笔者提出的方法明显改善了模态混叠现象,提高了模式识别的诊断正确率,提出的联合算法具有更好的应用前景。

基于小波变换和KFCM的彩色图像分割

提出一种将小波变换和核模糊C均值聚类算法相结合的快速彩色图像分割算法。利用小波变换的多分辨率特性,在分辨率最大尺度上的LL子带进行均值漂移聚类,快速获得初始粗分割结果,在其基础上进行模糊核聚类分割,将上一层的结果用于下一层的初始化,重复至最低分辨率后用最小分类器对原始图像进行最终分割。实验结果证明,该算法分割速度快,对自然彩色图像的分割结果优于模糊C均值算法和均值漂移算法。

模糊隶属度加权的KFCM脑MRI的组织分割方法

医学图像受成像机制的影响不可避免地会引入噪声.为解决传统医学图像分割算法对噪声敏感的问题,提出一种模糊隶属度加权的KFCM分割方法.该方法在传统KFCM算法基础上引入局部空间信息,定义了局部隶属度函数,并结合传统KFCM算法得到的全局隶属度函数构造加权隶属度函数,为每个像素计算隶属度值;进一步地,结合邻域信息,使用迭代聚合方法为每个像素重新分配隶属度值.选取Simulated Brain Database数据集,对加入不同噪声的图像进行实验的结果表明,该方法在保证对噪声鲁棒的同时,能够提高分割精度.

基于KFCM-MNN并联式混合动力汽车能量管理策略

为了提高并联式混合动力汽车的燃油经济性,文章提出了一种基于核模糊c聚类(kernel fuzzy cmeans clustering,KFCM)的多神经网络(multi-neural network,MNN)能量管理设计方法。采用动态规划全局优化离线仿真得到全局最优解,使用KFCM算法对全局最优解数据集合按照车辆运行模式作聚类划分,针对每一个聚类建立局部神经网络。训练后的MNN模型结构根据实时工况,将多个局部神经网络的输出联结作为能量管理策略的输出,以实现发动机和电机转矩的实时优化分配。仿真结果表明,基于KFCM-MNN的能量管理策略,具有对动态规划能量管理策略很好的学习模拟能力,是一种准最优的控制策略。

基于改进MRF-KFCM有效区域分割的储能系统三维温度场重构方法

储能系统是微电网的核心组成部分,其热管理对于微电网的安全与稳定具有重要意义。相对于表面温度,电池堆内部温度场更有意义,针对红外热像仪无法监测电池堆内部温度场的问题,提出一种基于表面温度场与虚拟热源的三维温度场重构方法。通过分割算法将有效区域分离,利用定标将其映射为表面温度场,进而初步重构三维温度场,然后以虚拟热源对立体子单元温度进行修正。为了避免电池堆红外图像有效区域分割不准确对三维重构造成的影响,对马尔可夫随机场约束下的模糊核C均值聚类(MRF-KFCM)算法进行改进,通过Otsu算法在可见光图像中初步获得有效区域,赋予像元以不同的目标信息权重进行聚类,最后经配准得到电池堆在红外图像中的准确位置。实验结果表明,该方法能够反映电池堆内部温度变化趋势和局部差异,精度满足实际应用需求。

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.

Improved Kernel Possibilistic Fuzzy Clustering Algorithm Based on Invasive Weed Optimization

Fuzzy c-means(FCM) clustering algorithm is sensitive to noise points and outlier data, and the possibilistic fuzzy c-means(PFCM) clustering algorithm overcomes the problem well, but PFCM clustering algorithm has some problems: it is still sensitive to initial clustering centers and the clustering results are not good when the tested datasets with noise are very unequal. An improved kernel possibilistic fuzzy c-means algorithm based on invasive weed optimization(IWO-KPFCM) is proposed in this paper. This algorithm first uses invasive weed optimization(IWO) algorithm to seek the optimal solution as the initial clustering centers, and introduces kernel method to make the input data from the sample space map into the high-dimensional feature space. Then, the sample variance is introduced in the objection function to measure the compact degree of data. Finally, the improved algorithm is used to cluster data. The simulation results of the University of California-Irvine(UCI) data sets and artificial data sets show that the proposed algorithm has stronger ability to resist noise, higher cluster accuracy and faster convergence speed than the PFCM algorithm.

变分模态分解消噪与核模糊C均值聚类相结合的滚动轴承故障识别方法

提出了一种变分模态分解消噪与核模糊C均值聚类相结合的滚动轴承故障识别方法。首先,对实测振动信号进行处理,得到VMD的参数;然后,对信号进行VMD分解,得到一系列限带内禀模态函数(BIMF)分量,筛选并叠加组成重构信号;第三步,计算重构信号的样本熵和均方根值作为特征向量,从而得到训练样本和测试样本的特征向量集;第四步,通过KFCM聚类方法对训练样本特征向量集进行聚类分析,得到四种类型信号的聚类中心;最后根据测试样本特征向量与训练样本聚类中心欧式距离最小的原则识别故障类型。此外,将振动信号用经验模态分解(EMD)方法进行消噪,再用KFCM聚类进行分类识别,将两种方法的识别效果进行对比,结果表明所提方法的故障识别效果要优于EMD消噪和KFCM聚类相结合方法的识别效果。

基于改进核模糊聚类算法的软测量建模研究

针对发酵过程软测量建模采用单模型建模方法存在计算量大和精度较差的问题,提出一种基于改进核模糊聚类算法的多模型神经网络软测量建模方法。该方法首先使用主元分析方法对样本数据进行数据处理,所得主元变量作为模型的输入变量,然后使用基于粒子群优化算法的核模糊C均值聚类算法(PSKFCM)对数据集作聚类划分,最后针对每个聚类建立局部神经网络模型,多个局部神经网络模型估计结果的融合即为软测量模型的输出。将所提建模方法应用于红霉素发酵过程生物量浓度软测量建模,结果表明所建软测量模型具有较高的精度和良好的泛化能力。

基于核模糊C均值指纹库管理的WIFI室内定位方法

针对目前已有的基于指纹的WIFI室内定位指纹库的管理方法对野值和噪声的敏感性,提出一种基于核模糊C均值聚类的指纹库管理的室内定位方法.利用核函数将指纹库从低维空间映射到高维空间并结合模糊聚类方法在高维空间进行指纹库管理,并在管理后的指纹库上进行定位匹配.将指纹库映射到高维空间可以使指纹库中的数据线性可分,从而实现更好的聚类.核模糊C均值(KFCM-Ⅱ)的聚类鲁棒性能够降低聚类对噪声和野值的敏感性,从而保证系统的鲁棒性.在实测数据的实验中,将所提出的方法与基于K均值聚类和基于模糊C均值聚类的室内定位方法进行对比,实验结果表明,所提出的方法相较于K均值方法和模糊C均值方法聚类准确度分别提高了14.20%和10.58%,定位精度分别提高了26.98%和20.43%.

基于核模糊聚类的变分水平集医学图像分割方法

针对现有无须重新初始化的变分水平集分割模型,存在对边缘模糊、对比度差等图像不是很敏感、分割效果不理想的问题,提出了一种基于核模糊聚类的变分水平集医学图像分割方法。将原始图像进行核模糊C-均值聚类,把得到的聚类结果带入初始化水平集函数得到初始轮廓,最后利用李模型的分割方法实现最终的图像分割。实验结果表明,该方法具有良好的分割质量,适应性强,同时可减少迭代次数。

核聚类集成失衡数据SVM算法

针对传统SVM算法在失衡数据集下的分类性能不理想的问题,提出一种基于核聚类集成SVM算法.该算法首先在核空间中对多数类样本集进行聚类,然后随机选择出具有代表意义的聚类信息点,实现在减少多数类样本数的同时将分类界面向多数类样本方向偏移.并利用AdaBoost集成手段对基于核聚类的欠取样SVM算法进行集成,最终提高SVM算法在失衡数据下的泛化性能.将提出的算法同其他失衡数据预处理集成方法进行比较,实验结果表明该算法能够有效提高SVM算法在失衡数据中少数类的分类性能,且总体分类性能及运行效率都有明显提高.

基于模糊核聚类图像分割的气体泄漏定位研究

针对传统泄漏检测和定位方法中低效性和低抗干扰性等方面的问题,提出了一种基于红外热像图的气体泄漏检测和定位的方法.该方法利用红外热像仪拍摄充气前后被测容器的红外热像图,并对获得的热像图进行图像增强和加权差分处理,提出基于带有温差因子的模糊核聚类分割算法来处理容器的红外热像图,对泄漏位置及边界的提取.通过引入与目标区域温度范围相关的参数-温差因子,对于不同温度范围热像图的噪声具有良好的自适应抑制能力,增强了图像分割的鲁棒性.实验结果表明,该方法准确并且高效,能够获得准确的泄漏检测及定位结果,泄漏检测能力可达到10mL/min(@0.1MPa).

基于改进人工蜂群的核模糊聚类算法

针对核模糊C均值(KFCM)算法对初始聚类中心敏感、易陷入局部最优的问题,利用人工蜂群(ABC)算法的构架简单、全局收敛速度快的优势,提出了一种改进的人工蜂群算法(IABC)与KFCM迭代相结合的聚类算法。首先,以IABC求得最优解作为KFCM算法的初始聚类中心,IABC在迭代过程中将与当前维度最优解的差值的变化率作为权值,对雇佣蜂的搜索行为进行改进,平衡人工蜂群算法的全局搜索与局部开采能力;其次,以类内距离和类间距离为基础,构造出适应KFCM算法的适应度函数,利用KFCM算法优化聚类中心;最后,IABC和KFCM算法交替执行,实现最佳聚类效果。采用3组Benchmark测试函数6组UCI标准数据集进行仿真实验,实验结果表明,与基于改进人工蜂群的广义模糊聚类(IABC-KGFCM)相比,IABC-KFCM对数据集的聚类有效性指标提高1到4个百分点,具有鲁棒性强和聚类精度高的优势。