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.

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.

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.

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.

基于KPCA-CNN-DBiGRU模型的短期负荷预测方法

本文针对已有神经网络模型在短期负荷预测中输入维度过高、预测误差较大等问题,提出了一种结合核主成分分析、卷积神经网络和深度双向门控循环单元的短期负荷预测方法。先运用核主成分分析法对原始高维输入变量进行降维,再通过卷积深度双向门控循环单元网络模型进行负荷预测。以第九届全国电工数学建模竞赛试题A题中的负荷数据作为实际算例,结果表明所提方法较降维之前预测误差大大降低,与已有预测方法相比也有大幅的误差降低。

基于SMOTE-IKPCA-SeNet深度迁移学习的小批量生产质量预测研究

随着智能制造技术的发展和客户个性化需求的增加,多品种小批量生产方式逐渐成为制造业的主流。面向大批量生产、以统计过程控制为核心的质量管理方式并不适用于小批量生产。针对复杂生产过程存在参数多、非线性和交互作用的问题,提出利用深度迁移学习的方式将历史生产数据作为源域迁移至小样本目标产品数据进行质量预测。首先,通过合成少数类过采样技术(synthetic minority over-sampling technique,SMOTE)和改进的核主成分分析(improved kernel principal component analysis,IKPCA)算法筛选源域和目标域的可迁移特征,这不仅兼顾了特征重要性和可迁移性,还减少了“负迁移”,提高了模型泛化能力;然后,采用结合通道注意力机制的卷积神经网络SeNet构建基于深度迁移学习的质量预测模型。仿真结果表明,随着目标域样本的增加,所提方法的预测准确性明显优于广泛采用的支持向量机建模方法。同时,所提可迁移特征筛选方法显著提高了深度迁移学习的质量预测效果,为复杂的小批量生产过程质量保证提供了新方法。

多策略改进黏菌算法阶段优化HSVM变压器故障辨识

为解决变压器故障诊断精度较低的问题,提出了一种多策略改进黏菌算法(ISMA)阶段优化混合核支持向量机(HSVM)的变压器故障诊断新方法。首先,利用主成分分析(PCA)来消除变量之间的信息冗余并降低数据集维度。其次,引入黏菌算法(SMA),并结合Logistic混沌映射、二次插值、自适应权重多策略改进SMA,以提高SMA算法收敛速度和局部搜索能力;然后,与原始SMA、WHO和GWO算法进行寻优测试,对比验证改进后SMA算法的优越性;最后,使用改进SMA算法分阶段对混合核支持向量机参数寻优,构建ISMA-HSVM变压器故障诊断模型。将降维后的特征数据输入HSVM模型与BPPN、ELM和SVM进行比较,HSVM模型的诊断准确性分别提高了5.55%、8.89%、5.55%。使用ISMA优化HSVM模型参数,与WHO、GWO、SMA算法优化效果比较,结果准确性提高了13.33%、12.22%、5.55%。其中,ISMA-HSVM模型的诊断精度为93.33%。实验结果表明,所提模型有效提升故障诊断分类性能,且具有较高的故障诊断精度。

流程生产安全数智化监测系统传感器故障诊断研究

为保障流程生产安全监测数据的准确性,提出1种结合核主元分析和累积残差贡献率法的故障诊断方法。首先提出“感知-汇聚-决策”的多层级数智化监控系统架构;针对感知层传感器,基于核主元分析构建故障检测模型并通过累积残差贡献率法定位故障传感器;以DYTG转炉厂连铸作业区进行实证分析。研究结果表明:该故障诊断方法在SPE指标上的平均检测率和平均误检率分别为95.28%和2.61%,在T^(2)指标上的平均检测率和平均误检率分别为84.36%和1.71%,且针对4种故障形式均能精准定位故障传感器。研究结果有助于降低监测系统的维护成本,提升流程生产安全管控水平。

基于机器学习的茶树DNA聚类算法

为了研究茶树基因序列的聚类问题,设计一种基于累计方差贡献率进行改进的核主成分分析(KPCA)与k均值(k-means)++聚类算法相结合的降维聚类算法(KPCA-k-means++)。将基因库数据集筛选分组后,利用k-mers算法提取基因数据的数据特征,根据累计方差贡献率的占比大于85%的标准确定降维主元个数对KPCA进行降维改进并采用k-means++算法对降维后数据聚类,通过CH(Calinski-Harabaze Index)指标和响应时间分析聚类结果。结果表明:在单独聚类、KPCA聚类、改进PCA聚类、改进KPCA聚类4种处理方式中,改进KPCA-k-means++算法在不同处理方式和不同样本数的对比下,CH指标均为最高,与未改进时相比平均高出33%。在响应时间方面,改进KPCA-k-means++算法与同样改进PCA-k-means++算法在不同聚类数和样本数的对比下响应时间均较短。改进KPCA-k-means++算法能够保证对于茶树的基因序列的聚类准确率和聚类速度,表现出极好的聚类稳定性。