• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.76-78
• /
• 2014

Naive Bayes (NB, for shortly) learning is more popular, faster and effective supervised learning method to handle the labeled datasets especially in which have some noises, NB learning also has well performance. However, the conditional independent assumption of NB learning imposes some restriction on the property of handling data of real world. Some researchers proposed lots of methods to relax NB assumption, those methods also include attribute weighting, kernel density estimating. In this paper, we propose a novel approach called NB Based on Attribute Weighting in Kernel Density Estimation (NBAWKDE) to improve the NB learning classification ability via combining kernel density estimation and attribute weighting.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.629-636
• /
• 2007

A kernel type semi-supervised estimate is proposed. The proposed estimate is based on the penalized least squares loss and the principle of Gaussian Random Fields Model. As a result, we can estimate the label of new unlabeled data without re-computation of the algorithm that is different from the existing transductive semi-supervised learning. Also our estimate is viewed as a general form of Gaussian Random Fields Model. We give experimental evidence suggesting that our estimate is able to use unlabeled data effectively and yields good classification.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.267-274
• /
• 2011

Recently, actor-critic methods have drawn significant interests in the area of reinforcement learning, and several algorithms have been studied along the line of the actor-critic strategy. In this paper, we consider a new type of actor-critic algorithms employing the kernel methods, which have recently shown to be very effective tools in the various fields of machine learning, and have performed investigations on combining the actor-critic strategy together with kernel methods. More specifically, this paper studies actor-critic algorithms utilizing the kernel-based least-squares estimation and policy gradient, and in its critic's part, the study uses a sliding-window-based kernel least-squares method, which leads to a fast and efficient value-function-estimation in a nonparametric setting. The applicability of the considered algorithms is illustrated via a robot locomotion problem and a tunnel ventilation control problem.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.382-386
• /
• 2009

Online or sequential learning is one of the most basic and powerful method to train neuron network, and it has been widely used in disease detection, weather prediction and other realistic classification problem. At present, there are many algorithms in this area, such as MRAN, GAP-RBFN, OS-ELM, SVM and SMC-RBF. Among them, SMC-RBF has the best performance; it has less number of hidden neurons, and best efficiency. However, all the existing algorithms use signal normal distribution as kernel function, which means the output of the kernel function is same at the different direction. In this paper, we use multi-variable normal distribution as kernel function, and derive EKF learning formulas for multi-variable normal distribution kernel function. From the result of the experience, we can deduct that the proposed method has better efficiency performance, and not sensitive to the data sequence.

• East Asian mathematical journal
• /
• v.37 no.3
• /
• pp.333-354
• /
• 2021

A support vector machine (SVM) is a state-of-the-art machine learning model rooted in structural risk minimization. SVM is underestimated with regards to its application to real world problems because of the difficulties associated with its use. We aim at showing that the performance of SVM highly depends on which kernel function to use. To achieve these, after providing a summary of support vector machines and kernel function, we constructed experiments with various benchmark datasets to compare the performance of various kernel functions. For evaluating the performance of SVM, the F1-score and its Standard Deviation with 10-cross validation was used. Furthermore, we used taylor diagrams to reveal the difference between kernels. Finally, we provided Python codes for all our experiments to enable re-implementation of the experiments.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.477-484
• /
• 2001

This paper proposes a hybrid learning algorithm combined momentum and kernel-adatron for improving the performance of regression support vector machine. The momentum is utilized for high-speed convergence by restraining the oscillation in the process of converging to the optimal solution, and the kernel-adatron algorithm is also utilized for the capability by working in nonlinear feature spaces and the simple implementation. The proposed algorithm has been applied to the 1-dimension and 2-dimension nonlinear function regression problems. The simulation results show that the proposed algorithm has better the learning speed and performance of the regression, in comparison with those quadratic programming and kernel-adatron algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.2
• /
• pp.714-720
• /
• 2021

The ITL (information theoretic learning) based on the kernel density estimation method that has successfully been applied to machine learning and signal processing applications has a drawback of severe sensitiveness in choosing proper kernel sizes. For the maximization of correntropy criterion (MCC) as one of the ITL-type criteria, several methods of adapting the remaining kernel size ( ) after removing the term have been studied. In this paper, it is shown that the main cause of sensitivity in choosing the kernel size derives from the term and that the adaptive adjustment of in the remaining terms leads to approach the absolute value of error, which prevents the weight adjustment from continuing. Thus, it is proposed that choosing an appropriate constant as the kernel size for the remaining terms is more effective. In addition, the experiment results when compared to the conventional algorithm show that the proposed method enhances learning performance by about 2dB of steady state MSE with the same convergence rate. In an experiment for channel models, the proposed method enhances performance by 4 dB so that the proposed method is more suitable for more complex or inferior conditions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.3
• /
• pp.627-632
• /
• 2021

ITL (information-theoretic learning) has been applied successfully to adaptive signal processing and machine learning applications, but there are difficulties in deciding the kernel size, which has a great impact on the system performance. The correntropy algorithm, one of the ITL methods, has superior properties of impulsive-noise robustness and channel-distortion compensation. On the other hand, it is also sensitive to the kernel sizes that can lead to system instability. In this paper, considering the sensitivity of the kernel size cubed in the denominator of the cost function slope, a new adaptive kernel estimation method using the rate of change in error power in respect to the kernel size variation is proposed for the correntropy algorithm. In a distortion-compensation experiment for impulsive-noise and multipath-distorted channel, the performance of the proposed kernel-adjusted correntropy algorithm was examined. The proposed method shows a two times faster convergence speed than the conventional algorithm with a fixed kernel size. In addition, the proposed algorithm converged appropriately for kernel sizes ranging from 2.0 to 6.0. Hence, the proposed method has a wide acceptable margin of initial kernel sizes.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.6
• /
• pp.773-785
• /
• 2014

For decades, modeling of pilots has been intensively studied due to its advantages in reducing costs for training and enhancing safety of pilots. In particular, research for modeling of pilots' non-kinetic behaviors which refer to the decisions made by pilots is beneficial as the expertise of pilots can be inherent in the models. With the recent growth in the amount of combat logs accumulated, employing statistical learning methods for the modeling becomes possible. However, the combat logs consist of heterogeneous data that are not only continuous or discrete but also sequence independent or dependent, making it difficult to directly applying the learning methods without modifications. Therefore, in this paper, we present a kernel function named hybrid sequence kernel which addresses the problem by using multiple kernel learning methods. Based on the empirical experiments by using combat logs obtained from a simulator, the proposed kernel showed satisfactory results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.182-187
• /
• 2007

본 논문에서는 이미지 상에 나타난 색상 정보를 추출하기 위한 새로운 커널 메소드(Kernel method)인 Grid kernel을 제안한다. 제안한 Grid kernel은 Convolution kernel의 하나로 이미지 상에 나타나는 자질을 주변 픽셀에서 나타나는 자질로 정의 하고 이를 재귀적으로 적용함으로써 두 이미지를 비교한다. 본 논문에서는 제안한 커널을 차량 색상 인식 문제에 적용하여 차량 색상 인식 모델을 제안한다. 이미지 생성시 나타나는 주변 요인으로 인해 차량의 색상을 추출하는 것은 어려운 문제이다. 이미지가 야외에서 촬영되기 때문에 시간, 날씨 등의 주변 요인은 같은 차량이라 하더라도 다른 색상을 보이게 할 수 있다. 이를 해결하기 위해 Grid kernel이 적용된 차량 색상 인식 모델은 이미지를 HSV (Hue-Saturation-Value) 색상 공간으로 사상하여 명도를 배제하였다. 제안한 커널과 색상 인식 모델을 검증하기 위해 5가지 색상을 가진 차량 이미지를 이용하여 실험을 하였으며, 실험 결과 92.4%의 정확율과 92.0%의 재현율을 보였다.