• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.15-22
• /
• 2011

Principal component analysis (PCA) is a well-known method for dimensionality reduction and feature extraction while maintaining most of the variation in data. Although PCA has been applied in many areas successfully, it is sensitive to outliers and only valid for Gaussian distributions. Several variants of PCA have been proposed to resolve noise sensitivity and, among the variants, improved robust fuzzy PCA (RF-PCA2) demonstrated promising results. RF-PCA, however, is still a linear algorithm that cannot accommodate non-Gaussian distributions. In this paper, a non-linear algorithm that combines RF-PCA2 and kernel PCA (K-PCA), called improved robust kernel fuzzy PCA (RKF-PCA2), is introduced. The kernel methods make it to accommodate non-Gaussian distributions. RKF-PCA2 inherits noise robustness from RF-PCA2 and non-linearity from K-PCA. RKF-PCA2 outperforms previous methods in handling non-Gaussian distributions in a noise robust way. Experimental results also support this.

• Structural Engineering and Mechanics
• /
• v.44 no.2
• /
• pp.179-196
• /
• 2012

An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3076-3092
• /
• 2020

An IKPCA-ELM-based intrusion detection method is developed to address the problem of the low accuracy and slow speed of intrusion detection caused by redundancies and high dimensions of data in the network. First, in order to reduce the effects of uneven sample distribution and sample attribute differences on the extraction of KPCA features, the sample attribute mean and mean square error are introduced into the Gaussian radial basis function and polynomial kernel function respectively, and the two improved kernel functions are combined to construct a hybrid kernel function. Second, an improved particle swarm optimization (IPSO) algorithm is proposed to determine the optimal hybrid kernel function for improved kernel principal component analysis (IKPCA). Finally, IKPCA is conducted to complete feature extraction, and an extreme learning machine (ELM) is applied to classify common attack type detection. The experimental results demonstrate the effectiveness of the constructed hybrid kernel function. Compared with other intrusion detection methods, IKPCA-ELM not only ensures high accuracy rates, but also reduces the detection time and false alarm rate, especially reducing the false alarm rate of small sample attacks.

• IE interfaces
• /
• v.24 no.1
• /
• pp.8-14
• /
• 2011

Principal Component Analysis (PCA) reduces the dimensionality of the process by creating a new set of variables, Principal components (PCs), which attempt to reflect the true underlying process dimension. However, for highly nonlinear processes, this form of monitoring may not be efficient since the process dimensionality can't be represented by a small number of PCs. Examples include the process of semiconductors, pharmaceuticals and chemicals. Nonlinear correlated process variables can be reduced to a set of nonlinear principal components, through the application of Kernel Principal Component Analysis (KPCA). Support Vector Data Description (SVDD) which has roots in a supervised learning theory is a training algorithm based on structural risk minimization. Its control limit does not depend on the distribution, but adapts to the real data. So, in this paper proposes a non-linear process monitoring technique based on supervised learning methods and KPCA. Through simulated examples, it has been shown that the proposed monitoring chart is more effective than $T^2$ chart for nonlinear processes.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.178-190
• /
• 2021

Alzheimer's disease (AD) is an insidious and degenerative neurological disease. It is a new topic for AD patients to use magnetic resonance imaging (MRI) and computer technology and is gradually explored at present. Preprocessing and correlation analysis on MRI data are firstly made in this paper. Then kernel principal component analysis (KPCA) is used to extract features of brain gray matter images. Finally supervised classification schemes such as AdaBoost algorithm and support vector machine algorithm are used to classify the above features. Experimental results by means of AD program Alzheimer's Disease Neuroimaging Initiative (ADNI) database which contains brain structural MRI (sMRI) of 116 AD patients, 116 patients with mild cognitive impairment, and 117 normal controls show that the proposed method can effectively assist the diagnosis and analysis of AD. Compared with principal component analysis (PCA) method, all classification results on KPCA are improved by 2%-6% among which the best result can reach 84%. It indicates that KPCA algorithm for feature extraction is more abundant and complete than PCA.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.50 no.spc1
• /
• pp.161-166
• /
• 2005

Objectives of this study were to select inbred lines which have a good eating quality and desirable segregates during inbreeding of waxy corn. The 64 inbred lines showed a large variance in their kernel shape and weight. 100-kernel weight, pericarp thickness, kernel length, kernel width, and kernel thickness ranged $11.7\~37.3g,\;11\~77{\mu}m,\;5.8\~9.6mm,\;6.5\~10.0mm$, and $4.1\~6.8mm$, respectively. The physicochemical analysis of 64 waxy corn inbred lines showed crude protein, crude fat, free sugar, and amylopectin content ranging $8.7\~15.8\%,\;2.3\~5.8\%,\;1.1\~11.0\%,\;and\;78.5\~93.8\%$, respectively. The texture property analysis of 64 inbred lines by texture analyzer showed a big difference. Gumminess, hardness, and chewiness of 64 inbred lines ranged $91\~383,\;181\~394,\;and\;73\~370$, respectively. The principal component analysis for 14 characteristics related to kernel quality showed that $73.1\%$ of the total variation could be attributed to the first five principal components. Biological meaning of the principal component was explained clearly by the correlation coefficient between principal components and characters. The first principal component appeared to correspond to small kernel and bad eating quality, The second principal component appeared to correspond to large kernel and good eating quality. The 64 inbred lines were classified into 8 groups by the cluster analysis using the first and second principal component. Among the groups, group VII and VIII included inbred lines with good eating quality that had thin pericarp thickness, low protein content, large kernel, and soft tenderness.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.401-406
• /
• 2006

This paper presents the fault diagnosis of induction motor based on support vector machine(SVMs). SVMs are well known as intelligent classifier with strong generalization ability. Application SVMs using kernel function is widely used for multi-class classification procedure. In this paper, the algorithm of SVMs will be combined with feature extraction and reduction using component analysis such as independent component analysis, principal component analysis and their kernel(KICA and KPCA). According to the result, component analysis is very useful to extract the useful features and to reduce the dimensionality of features so that the classification procedure in SVM can perform well. Moreover, this method is used to induction motor for faults detection based on vibration and current signals. The results show that this method can well classify and separate each condition of faults in induction motor based on experimental work.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.46-53
• /
• 2006

This paper presents the fault diagnosis of induction motor based on support vector machine (SVMs). SVMs are well known as intelligent classifier with strong generalization ability. Application SVMs using kernel function is widely used for multi-class classification procedure. In this paper, the algorithm of SVMs will be combined with feature extraction and reduction using component analysis such as independent component analysis, principal component analysis and their kernel (KICA and KPCA). According to the result, component analysis is very useful to extract the useful features and to reduce the dimensionality of features so that the classification procedure in SVM can perform well. Moreover, this method is used to induction motor for faults detection based on vibration and current signals. The results show that this method can well classify and separate each condition of faults in induction motor based on experimental work.

• MALSORI
• /
• no.66
• /
• pp.105-116
• /
• 2008

In this research, we propose a speaker identification system using a kernel method which is expected to model the non-linearity of speech features well. We have been using principal component analysis (PCA) successfully, and extended to kernel PCA, which is used for many pattern recognition tasks such as face recognition. However, we cannot use kernel PCA for speaker identification directly because the storage required for the kernel matrix grows quadratically, and the computational cost grows linearly (computing eigenvector of $l{\times}l$ matrix) with the number of training vectors I. Therefore, we use greedy kernel PCA which can approximate kernel PCA with small representation error. In the experiments, we compare the accuracy of the greedy kernel PCA with the baseline Gaussian mixture models using MFCCs and PCA. As the results with limited enrollment data show, the greedy kernel PCA outperforms conventional methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.297-305
• /
• 2008

Recently, kernel methods have attracted great interests in the areas of pattern classification, function approximation, and anomaly detection. The role of the kernel is particularly important in the methods such as SVM(support vector machine) and KPCA(kernel principal component analysis), for it can generalize the conventional linear machines to be capable of efficiently handling nonlinearities. This paper considers the problem of combining radar and rain gauge observations utilizing the regression approach based on the kernel-based gaussian process and support vector learning. The data-assimilation results of the considered methods are reported for the radar and rain gauge observations collected over the region covering parts of Gangwon, Kyungbuk, and Chungbuk provinces of Korea, along with performance comparison.