• Journal of Electrical Engineering and Technology
• /
• 제11권4호
• /
• pp.993-1002
• /
• 2016

Hepatitis is a major public health problem all around the world. This paper proposes an automatic disease diagnosis system for hepatitis based on Genetic Algorithm (GA) Wavelet Kernel (WK) Extreme Learning Machines (ELM). The classifier used in this paper is single layer neural network (SLNN) and it is trained by ELM learning method. The hepatitis disease datasets are obtained from UCI machine learning database. In Wavelet Kernel Extreme Learning Machine (WK-ELM) structure, there are three adjustable parameters of wavelet kernel. These parameters and the numbers of hidden neurons play a major role in the performance of ELM. Therefore, values of these parameters and numbers of hidden neurons should be tuned carefully based on the solved problem. In this study, the optimum values of these parameters and the numbers of hidden neurons of ELM were obtained by using Genetic Algorithm (GA). The performance of proposed GA-WK-ELM method is evaluated using statical methods such as classification accuracy, sensitivity and specivity analysis and ROC curves. The results of the proposed GA-WK-ELM method are compared with the results of the previous hepatitis disease studies using same database as well as different database. When previous studies are investigated, it is clearly seen that the high classification accuracies have been obtained in case of reducing the feature vector to low dimension. However, proposed GA-WK-ELM method gives satisfactory results without reducing the feature vector. The calculated highest classification accuracy of proposed GA-WK-ELM method is found as 96.642 %.

• Journal of the Korean Data and Information Science Society
• /
• 제14권2호
• /
• pp.345-354
• /
• 2003

An incremental kernel principal component analysis(IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis(KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenvectors should be recomputed. IKPCA overcomes this problem by incrementally updating the eigenspace model. IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the classification problem on nonlinear data set.

• 전자공학회논문지B
• /
• 제30B권2호
• /
• pp.78-86
• /
• 1993

A nonlinear method for directional information processing is introduced, along with an application of directional feature enhancement. In this method, an input is convolved with a 2-D ong, norrow kernel, which is rotated through 360 degree, continuously or discretely in a large number of steps. An output is given by some function of the convolution results. Linear features that are aligned with the kernel are enhanced, otherwise, removed or suppressed. The method presented is insensitive to variation in the dimension of linear features to be processed and preserves a good enhancement capability even for an image characterized by low contrast and spatially varying brightness in noisy backgroung. Effects of the kernel legnth and width on the performance are discussed. A possible hybrid optical-electronic implementation is also discussed.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.415-421
• /
• 2007

This paper proposes a convolution tree kernel-based approach for relation extraction where the parse tree is expanded with entity features such as entity type, subtype, and mention level etc. Our study indicates that not only can our method effectively capture both syntactic structure and entity information of relation instances, but also can avoid the difficulty with tuning the parameters in composite kernels. We also demonstrate that predicate verb information can be used to further improve the performance, though its enhancement is limited. Evaluation on the ACE2004 benchmark corpus shows that our system slightly outperforms both the previous best-reported feature-based and kernel-based systems.

• 한국기계가공학회지
• /
• 제8권3호
• /
• pp.21-26
• /
• 2009

The finite element analysis of metal forming processes often fails because of severe mesh distortion at large deformation. As the concept of meshless methods, only nodal point data are used for modeling and solving. As the main feature of these methods, the domain of the problem is represented by a set of nodes, and a finite element mesh is unnecessary. This computational methods reduces time-consuming model generation and refinement effort. It provides a higher rate of convergence than the conventional finite element methods. The displacement shape functions are constructed by the reproducing kernel approximation that satisfies consistency conditions. In this research, A meshless method approach based on the reproducing kernel particle method (RKPM) is applied with metal forming analysis. Numerical examples are analyzed to verify the performance of meshless method for metal forming analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2709-2729
• /
• 2016

Representation based classification, kernel method and sparse representation have received much attention in the field of face recognition. In this paper, we proposed an improved kernel principal component analysis method based on sparse representation to improve the accuracy and robustness for face recognition. First, the distances between the test sample and all training samples in kernel space are estimated based on collaborative representation. Second, S training samples with the smallest distances are selected, and Kernel Principal Component Analysis (KPCA) is used to extract the features that are exploited for classification. The proposed method implements the sparse representation under ℓ₂ regularization and performs feature extraction twice to improve the robustness. Also, we investigate the relationship between the accuracy and the sparseness coefficient, the relationship between the accuracy and the dimensionality respectively. The comparative experiments are conducted on the ORL, the GT and the UMIST face database. The experimental results show that the proposed method is more effective and robust than several state-of-the-art methods including Sparse Representation based Classification (SRC), Collaborative Representation based Classification (CRC), KCRC and Two Phase Test samples Sparse Representation (TPTSR).

• 한국지능시스템학회논문지
• /
• 제21권5호
• /
• pp.618-623
• /
• 2011

본 논문에서는 구조 정보를 활용하기 위한 결합 커널 기반의 의미 있는 웹 테이블과 장식 웹 테이블을 구분하는 새로운 방법을 제안한다. 본 논문에서 테이블의 구조 정보는 두 가지 형태의 구문 분석 트리로부터 추출된다. 컨텍스트 트리는 테이블 주변에 나타난 구조를 반영하고 있으며, 테이블 트리는 테이블 내의 구조를 담고 있다. 두 트리로 표현되는 테이블의 구조 정보를 효과적으로 다루기 위해 파스 트리 커널 기반의 결합 커널을 제안한다. 제안한 결합 커널을 적용한 support vector machines은 풍부한 구조 정보를 활용하여 의미 있는 테이블과 장식 테이블을 분류한다.

• Journal of Power Electronics
• /
• 제16권1호
• /
• pp.182-189
• /
• 2016

Fault detection is the research focus and priority in this study to ensure the high reliability of a proposed three-level inverter. Kernel principal component analysis (KPCA) has been widely used for feature extraction because of its simplicity. However, highlighting useful information that may be hidden under retained KPCs remains a problem. A weighted KPCA is proposed to overcome this shortcoming. Variable contribution plots are constructed to evaluate the importance of each KPC on the basis of sensitivity analysis theory. Then, different weighting values of KPCs are set to highlight the useful information. The weighted statistics are evaluated comprehensively by using the improved feature eigenvectors. The effectiveness of the proposed method is validated. The diagnosis results of the inverter indicate that the proposed method is superior to conventional KPCA.

• 전기전자학회논문지
• /
• 제19권4호
• /
• pp.526-534
• /
• 2015

In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by local shrinking and expanding operations, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where the concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our scheme is tested by recognition experiments on the handwritten numeral database CENPARMI, where SVM classifier with RBF kernel is used. The experimental results show the usefulness of our scheme and recognition rate of 99.10% is achieved.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2006년도 추계학술대회논문집
• /
• 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.