Kernel Generalization of Multi-Rate Probabilistic Principal Component Analysis for Fault Detection in Nonlinear Process

In practical process industries,a variety of online and offline sensors and measuring instruments have been used for process control and monitoring purposes,which indicates that the measurements coming from different sources are collected at different sampling rates.To build a complete process monitoring strategy,all these multi-rate measurements should be considered for data-based modeling and monitoring.In this paper,a novel kernel multi-rate probabilistic principal component analysis(K-MPPCA)model is proposed to extract the nonlinear correlations among different sampling rates.In the proposed model,the model parameters are calibrated using the kernel trick and the expectation-maximum(EM)algorithm.Also,the corresponding fault detection methods based on the nonlinear features are developed.Finally,a simulated nonlinear case and an actual pre-decarburization unit in the ammonia synthesis process are tested to demonstrate the efficiency of the proposed method.

An aligned mixture probabilistic principal component analysis for fault detection of multimode chemical processes

A novel approach named aligned mixture probabilistic principal component analysis(AMPPCA) is proposed in this study for fault detection of multimode chemical processes. In order to exploit within-mode correlations,the AMPPCA algorithm first estimates a statistical description for each operating mode by applying mixture probabilistic principal component analysis(MPPCA). As a comparison, the combined MPPCA is employed where monitoring results are softly integrated according to posterior probabilities of the test sample in each local model. For exploiting the cross-mode correlations, which may be useful but are inadvertently neglected due to separately held monitoring approaches, a global monitoring model is constructed by aligning all local models together. In this way, both within-mode and cross-mode correlations are preserved in this integrated space. Finally, the utility and feasibility of AMPPCA are demonstrated through a non-isothermal continuous stirred tank reactor and the TE benchmark process.

Kernel principal component analysis network for image classification

In order to classify nonlinear features with a linear classifier and improve the classification accuracy, a deep learning network named kernel principal component analysis network（ KPCANet） is proposed. First, the data is mapped into a higher-dimensional space with kernel principal component analysis to make the data linearly separable. Then a two-layer KPCANet is built to obtain the principal components of the image. Finally, the principal components are classified with a linear classifier. Experimental results showthat the proposed KPCANet is effective in face recognition, object recognition and handwritten digit recognition. It also outperforms principal component analysis network（ PCANet） generally. Besides, KPCANet is invariant to illumination and stable to occlusion and slight deformation.

NONLINEAR DATA RECONCILIATION METHOD BASED ON KERNEL PRINCIPAL COMPONENT ANALYSIS

In the industrial process situation, principal component analysis (PCA) is ageneral method in data reconciliation. However, PCA sometime is unfeasible to nonlinear featureanalysis and limited in application to nonlinear industrial process. Kernel PCA (KPCA) is extensionof PCA and can be used for nonlinear feature analysis. A nonlinear data reconciliation method basedon KPCA is proposed. The basic idea of this method is that firstly original data are mapped to highdimensional feature space by nonlinear function, and PCA is implemented in the feature space. Thennonlinear feature analysis is implemented and data are reconstructed by using the kernel. The datareconciliation method based on KPCA is applied to ternary distillation column. Simulation resultsshow that this method can filter the noise in measurements of nonlinear process and reconciliateddata can represent the true information of nonlinear process.

FUZZY PRINCIPAL COMPONENT ANALYSIS AND ITS KERNEL-BASED MODEL

Principal Component Analysis(PCA)is one of the most important feature extraction methods,and Kernel Principal Component Analysis(KPCA)is a nonlinear extension of PCA based on kernel methods.In real world,each input data may not be fully assigned to one class and it may partially belong to other classes.Based on the theory of fuzzy sets,this paper presents Fuzzy Principal Component Analysis(FPCA)and its nonlinear extension model,i.e.,Kernel-based Fuzzy Principal Component Analysis(KFPCA).The experimental results indicate that the proposed algorithms have good performances.

Application of Particle Swarm Optimization to Fault Condition Recognition Based on Kernel Principal Component Analysis

Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal kernel function parameter. We first comprehensively considered within-class scatter and between-class scatter of the sample features. Then, the fitness function of an optimized kernel function parameter is constructed, and the particle swarm optimization algorithm with adaptive acceleration （CPSO） is applied to optimizing it. It is used for gearbox condi- tion recognition, and the result is compared with the recognized results based on principal component analysis （PCA）. The results show that KPCA optimized by CPSO can effectively recognize fault conditions of the gearbox by reducing bind set-up of the kernel function parameter, and its results of fault recognition outperform those of PCA. We draw the conclusion that KPCA based on CPSO has an advantage in nonlinear feature extraction of mechanical failure, and is helpful for fault condition recognition of complicated machines.

Statistical Monitoring of Chemical Processes Based on Sensitive Kernel Principal Components

The kernel principal component analysis （KPCA） method employs the first several kernel principal components （KPCs）, which indicate the most variance information of normal observations for process monitoring, but may not reflect the fault information. In this study, sensitive kernel principal component analysis （SKPCA） is proposed to improve process monitoring performance, i.e., to deal with the discordance of T2 statistic and squared prediction error SVE statistic and reduce missed detection rates. T2 statistic can be used to measure the variation di rectly along each KPC and analyze the detection performance as well as capture the most useful information in a process. With the calculation of the change rate of T2 statistic along each KPC, SKPCA selects the sensitive kernel principal components for process monitoring. A simulated simple system and Tennessee Eastman process are employed to demonstrate the efficiency of SKPCA on online monitoring. The results indicate that the monitoring performance is improved significantly.

Comparison of Kernel Entropy Component Analysis with Several Dimensionality Reduction Methods

Dimensionality reduction techniques play an important role in data mining. Kernel entropy component analysis( KECA) is a newly developed method for data transformation and dimensionality reduction. This paper conducted a comparative study of KECA with other five dimensionality reduction methods,principal component analysis( PCA),kernel PCA( KPCA),locally linear embedding( LLE),laplacian eigenmaps( LAE) and diffusion maps( DM). Three quality assessment criteria, local continuity meta-criterion( LCMC),trustworthiness and continuity measure(T&C),and mean relative rank error( MRRE) are applied as direct performance indexes to assess those dimensionality reduction methods. Moreover,the clustering accuracy is used as an indirect performance index to evaluate the quality of the representative data gotten by those methods. The comparisons are performed on six datasets and the results are analyzed by Friedman test with the corresponding post-hoc tests. The results indicate that KECA shows an excellent performance in both quality assessment criteria and clustering accuracy assessing.

Multivariate Cluster and Principle Component Analyses of Selected Yield Traits in Uzbek Bread Wheat Cultivars

Investigation of genetic diversity of geographically distant wheat genotypes is a useful approach in wheat breeding providing efficient crop varieties. This article presents multivariate cluster and principal component analyses (PCA) of some yield traits of wheat, such as thousand-kernel weight (TKW), grain number, grain yield and plant height. Based on the results, an evaluation of economically valuable attributes by eigenvalues made it possible to determine the components that significantly contribute to the yield of common wheat genotypes. Twenty-five genotypes were grouped into four clusters on the basis of average linkage. The PCA showed four principal components (PC) with eigenvalues > 1, explaining approximately 90.8% of the total variability. According to PC analysis, the variance in the eigenvalues was the greatest (4.33) for PC-1, PC-2 (1.86) and PC-3 (1.01). The cluster analysis revealed the classification of 25 accessions into four diverse groups. Averages, standard deviations and variances for clusters based on morpho-physiological traits showed that the maximum average values for grain yield (742.2), biomass (1756.7), grains square meter (18,373.7), and grains per spike (45.3) were higher in cluster C compared to other clusters. Cluster D exhibited the maximum thousand-kernel weight (TKW) (46.6).

Kernel Factor Analysis Algorithm with Varimax

Kernal factor analysis （KFA） with vafimax was proposed by using Mercer kernel function which can map the data in the original space to a high-dimensional feature space, and was compared with the kernel principle component analysis （KPCA）. The results show that the best error rate in handwritten digit recognition by kernel factor analysis with vadmax （4.2%） was superior to KPCA （4.4%）. The KFA with varimax could more accurately image handwritten digit recognition.

Robust Recommendation Algorithm Based on Kernel Principal Component Analysis and Fuzzy C-means Clustering

The existing recommendation algorithms have lower robustness in facing of shilling attacks. Considering this problem, we present a robust recommendation algorithm based on kernel principal component analysis and fuzzy c-means clustering. Firstly, we use kernel principal component analysis method to reduce the dimensionality of the original rating matrix, which can extract the effective features of users and items. Then, according to the dimension-reduced rating matrix and the high correlation characteristic between attack profiles, we use fuzzy c-means clustering method to cluster user profiles, which can realize the effective separation of genuine profiles and attack profiles. Finally, we construct an indicator function based on the attack detection results to decrease the influence of attack profiles on the recommendation, and incorporate it into the matrix factorization technology to design the corresponding robust recommendation algorithm. Experiment results indicate that the proposed algorithm is superior to the existing methods in both recommendation accuracy and robustness.

Adaptive multiblock kernel principal component analysis for monitoring complex industrial processes

Multiblock kernel principal component analysis (MBKPCA) has been proposed to isolate the faults and avoid the high computation cost. However, MBKPCA is not available for dynamic processes. To solve this problem, recursive MBKPCA is proposed for monitoring large scale processes. In this paper, we present a new recursive MBKPCA (RMBKPCA) algorithm, where the adaptive technique is adopted for dynamic characteristics. The proposed algorithm reduces the high computation cost, and is suitable for online model updating in the feature space. The proposed algorithm was applied to an industrial process for adaptive monitoring and found to efficiently capture the time-varying and nonlinear relationship in the process variables.

Multi-response optimization of Ti-6A1-4V turning operations using Taguchi-based grey relational analysis coupled with kernel principal component analysis

Ti-6A1-4V has a wide range of applications, especially in the aerospace field;however, it is a difficultto- cut material. In order to achieve sustainable machining of Ti?6A1-4V, multiple objectives considering not only economic and technical requirements but also the environmental requirement need to be optimized simultaneously. In this work, the optimization design of process parameters such as type of inserts, feed rate, and depth of cut for Ti-6A1-4V turning under dry condition was investigated experimentally. The major performance indexes chosen to evaluate this sustainable process were radial thrust, cutting power, and coefficient of friction at the toolchip interface. Considering the nonlinearity between the various objectives, grey relational analysis (GRA) was first performed to transform these indexes into the corresponding grey relational coefficients, and then kernel principal component analysis (KPCA) was applied to extract the kernel principal components and determine the corresponding weights which showed their relative importance. Eventually, kernel grey relational grade (KGRG) was proposed as the optimization criterion to identify the optimal combination of process parameters. The results of the range analysis show that the depth of cut has the most significant effect, followed by the feed rate and type of inserts. Confirmation tests clearly show that the modified method combining GRA with KPCA outperforms the traditional GRA method with equal weights and the hybrid method based on GRA and PCA.

Multivariate time delay analysis based local KPCA fault prognosis approach for nonlinear processes

Currently, some fault prognosis technology occasionally has relatively unsatisfied performance especially for in- cipient faults in nonlinear processes duo to their large time delay and complex internal connection. To overcome this deficiency, multivariate time delay analysis is incorporated into the high sensitive local kernel principal component analysis. In this approach, mutual information estimation and Bayesian information criterion （BIC） are separately used to acquire the correlation degree and time delay of the process variables. Moreover, in order to achieve prediction, time series prediction by back propagation （BP） network is applied whose input is multivar- iate correlated time series other than the original time series. Then the multivariate time delayed series and future values obtained by time series prediction are combined to construct the input of local kernel principal component analysis （LKPCA） model for incipient fault prognosis. The new method has been exemplified in a sim- ple nonlinear process and the complicated Tennessee Eastman （TE） benchmark process. The results indicate that the new method has suoerioritv in the fault prognosis sensitivity over other traditional fault prognosis methods.

基于Kernel K-means的负荷曲线聚类

电力负荷曲线聚类是配用电系统的基础,对负荷管理具有重大意义。采用基于核方法的聚类算法提高负荷曲线聚类的准确性,通过点积的方式构造核矩阵,再将数据映射到高维空间中进行聚类,进而加大数据的可分性。同时,针对核矩阵的规模大、计算复杂的问题,提出使用核主成分与缩减矩阵规模对该方法进行优化。实验过程中采用美国能源部开发能源信息网站提供的负荷数据进行聚类,并以Davies-Bouldin聚类有效性指标评估效果。结果表明该方法具有较好的划分能力,可以提高负荷曲线聚类的准确性。

基于String Kernel和KPCA的负实例语法特征提取算法

提出通过String Kernel方法把负实例语法数据库中的负实例转化成核矩阵,再用Kernel Principal Component Analysis(KPCA)对转换的核矩阵进行特征提取,进而可将原始负实例数据库按照这些特征分成多个容量较小的特征表。通过构造负实例特征索引表设计了一个分类器,待检查的句子通过此分类器被分配到某个负实例特征表里进行匹配搜索,而此特征表的特征属性数和记录数要远远小于原始负实例数据库中的相应数目,从而大大提高了检查的速度,同时不影响语法检查的精度。通过比较测试,可看出提出的方法在保证语法检查精确度的同时有更快的速度。

PKPCA-LRM在滚动轴承性能退化评估中的应用

滚动轴承作为旋转机械最重要的零部件之一,其可靠性和寿命直接影响着机器的可靠性和寿命,为解决滚动轴承可靠性难以估计的问题,提出一种基于概率核主成分分析(Probabilistic Kernel Principal Component Analysis,PKPCA)和Logistic回归模型(Logistic Regression Model,LRM)的滚动轴承可靠性评估方法.首先提取轴承的时域、频域和时频域特征值组成高维混合域特征集,并引入相对特征值降低轴承个体差异;然后用PKPCA挑选能够表征轴承退化状态的特征值作为Logistic回归模型的协变量;最后用Logistic回归模型对滚动轴承可靠性进行评估.通过IMS滚动轴承全寿命试验,验证了该方法的有效性.

Numerical study of resting-state fMRI based on kernel ICA

In order to facilitate the extraction of the default mode network（DMN）, reduce the data complexity of the functional magnetic resonance imaging （fMRI）and overcome the restriction of the linearity of the mixing process encountered with the independent component analysis（ICA）, a framework of dimensionality reduction and nonlinear transformation is proposed. First, the principal component analysis（PCA）is applied to reduce the time dimension 153 594×128 of the fMRI data to 153 594×5 for simplifying complexity computation and obtaining 95% of the information. Secondly, a new kernel-based nonlinear ICA method referred as the kernel ICA（KICA）based on the Gaussian kernel is introduced to analyze the resting-state fMRI data and extract the DMN. Experimental results show that the KICA provides a better performance for the resting-state fMRI data analysis compared with the classical ICA. Furthermore, the DMN is accurately extracted and the noise is reduced.

A deep kernel method for lithofacies identification using conventional well logs

How to fit a properly nonlinear classification model from conventional well logs to lithofacies is a key problem for machine learning methods.Kernel methods(e.g.,KFD,SVM,MSVM)are effective attempts to solve this issue due to abilities of handling nonlinear features by kernel functions.Deep mining of log features indicating lithofacies still needs to be improved for kernel methods.Hence,this work employs deep neural networks to enhance the kernel principal component analysis(KPCA)method and proposes a deep kernel method(DKM)for lithofacies identification using well logs.DKM includes a feature extractor and a classifier.The feature extractor consists of a series of KPCA models arranged according to residual network structure.A gradient-free optimization method is introduced to automatically optimize parameters and structure in DKM,which can avoid complex tuning of parameters in models.To test the validation of the proposed DKM for lithofacies identification,an open-sourced dataset with seven con-ventional logs(GR,CAL,AC,DEN,CNL,LLD,and LLS)and lithofacies labels from the Daniudi Gas Field in China is used.There are eight lithofacies,namely clastic rocks(pebbly,coarse,medium,and fine sand-stone,siltstone,mudstone),coal,and carbonate rocks.The comparisons between DKM and three commonly used kernel methods(KFD,SVM,MSVM)show that(1)DKM(85.7%)outperforms SVM(77%),KFD(79.5%),and MSVM(82.8%)in accuracy of lithofacies identification;(2)DKM is about twice faster than the multi-kernel method(MSVM)with good accuracy.The blind well test in Well D13 indicates that compared with the other three methods DKM improves about 24%in accuracy,35%in precision,41%in recall,and 40%in F1 score,respectively.In general,DKM is an effective method for complex lithofacies identification.This work also discussed the optimal structure and classifier for DKM.Experimental re-sults show that(m_(1),m_(2),O)is the optimal model structure and linear svM is the optimal classifier.(m_(1),m_(2),O)means there are m KPCAs,and then m2 residual units.A workflow to determine an optimal classifier in DKM for lithofacies identification is proposed,too.