• Journal of the Korean Data and Information Science Society
• /
• 제19권4호
• /
• pp.1219-1231
• /
• 2008

The main object of this paper is to develop a leave-one-out(LOO) bound of all pairwise comparison error correcting output codes (APC-ECOC). To avoid using classifiers whose corresponding target values are 0 in APC-ECOC and requiring pilot estimates we developed a bound based on mean misclassification probability(MMP). It can be used to tune kernel hyperparameters. Our empirical experiment using kernel mean squared estimate(KMSE) as the binary classifier indicates that the bound leads to good estimates of kernel hyperparameters.

• Journal of the Korean Data and Information Science Society
• /
• 제18권3호
• /
• pp.767-772
• /
• 2007

A kernel machine is proposed as an estimating procedure for the linear and nonlinear Poisson regression, which is based on the penalized negative log-likelihood. The proposed kernel machine provides the estimate of the mean function of the response variable, where the canonical parameter is related to the input vector in a nonlinear form. The generalized cross validation(GCV) function of MSE-type is introduced to determine hyperparameters which affect the performance of the machine. Experimental results are then presented which indicate the performance of the proposed machine.

• 한국자동차공학회논문집
• /
• 제1권1호
• /
• pp.59-65
• /
• 1993

In a spark ignition engine, in order to make research on flame propagation, attentive concentration should be paid on initial combustion stage about the formation and development of flame. In addition, the initial stage of combustion governs overall combustion period in a spark ignition engine. With the increase of the size of flame kernel, it could reach initial flame stage easily, and the mixture could proceed to the combustion of stabilized state. Therefore, we must study the theoretical calculation of minimum flame kernel radius which effects on the formation and development of kernel. To calculate the minimum flame kernel radius, we must know the thermal conductivity, flame temperature, laminar burning velocity and etc. The thermal conductivity is derived from the molecular kinetic theory, the flame temperature from the chemical reaction equations and the laminar burning velocity from the D.K.Kuehl's formula. In order to estimate the correctness of the theoretically calculated minimum flame kernel radius, the researcheres compared it with the RMaly's experimental values.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.137-140
• /
• 1999

A lot of researcher have proposed a method of kernel identifying nonlinear system by use of Wiener kernels[6-7] or Volterra kernel[5] and so on. In this research, the authors proposed a method of identifying Volterra kernels for nonlinear system by use of pseudorandom M-sequence in which a crosscorrelation function between input and output of a nonlinear system is taken[4]. we can be applied to an MISO nonlinear system or a system which depends on its input amplitude[2]. But, there exist many systems in which it is difficult to determine a Volterra kernel having the same time coordinate on the crosscorrelation function. In those cases, we have to estimate Volterra kernel by using its neighboring points[4]. In this paper, we propose a new method for not estimating but obtaining Volterra kernel having the same time coordinate using calculation between the neighboring points. Some numerical simulations show that this method is effective for obtaining higher order Volterra kernel of nonlinear control systems.

• Journal of the Korean Statistical Society
• /
• 제23권1호
• /
• pp.79-88
• /
• 1994

This paper concerns the problem of estimating the spectral density function in the analysis of stationary time series data. A kernel type estimate is considered, which entails choice of bandwidth. A data-driven bandwidth choice is proposed, and it is obtained by plugging some suitable estimates into the unknown parts of a theoretically optimal choice. A theoretical justification is give for this choice in terms of how far it is from the theoretical optimum. Furthermore, an empirical investigation is done. It shows that the data-driven choice yields a reliable spectrum estimate.

• ETRI Journal
• /
• 제15권2호
• /
• pp.35-51
• /
• 1993

This paper presents function approximation based on nonparametric estimation. As an estimation model of function approximation, a three layered network composed of input, hidden and output layers is considered. The input and output layers have linear activation units while the hidden layer has nonlinear activation units or kernel functions which have the characteristics of bounds and locality. Using this type of network, a many-to-one function is synthesized over the domain of the input space by a number of kernel functions. In this network, we have to estimate the necessary number of kernel functions as well as the parameters associated with kernel functions. For this purpose, a new method of parameter estimation in which linear learning rule is applied between hidden and output layers while nonlinear (piecewise-linear) learning rule is applied between input and hidden layers, is considered. The linear learning rule updates the output weights between hidden and output layers based on the Linear Minimization of Mean Square Error (LMMSE) sense in the space of kernel functions while the nonlinear learning rule updates the parameters of kernel functions based on the gradient of the actual output of network with respect to the parameters (especially, the shape) of kernel functions. This approach of parameter adaptation provides near optimal values of the parameters associated with kernel functions in the sense of minimizing mean square error. As a result, the suggested nonparametric estimation provides an efficient way of function approximation from the view point of the number of kernel functions as well as learning speed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권2호
• /
• pp.702-723
• /
• 2020

The application of machine learning (ML) in intrusion detection has attracted much attention with the rapid growth of information security threat. As an efficient multi-label classifier, kernel extreme learning machine (KELM) has been gradually used in intrusion detection system. However, the performance of KELM heavily relies on the kernel selection. In this paper, a novel multiple kernel extreme learning machine (MKELM) model combining the ReliefF with nature-inspired methods is proposed for intrusion detection. The MKELM is designed to estimate whether the attack is carried out and the ReliefF is used as a preprocessor of MKELM to select appropriate features. In addition, the nature-inspired methods whose fitness functions are defined based on the kernel alignment are employed to build the optimal composite kernel in the MKELM. The KDD99, NSL and Kyoto datasets are used to evaluate the performance of the model. The experimental results indicate that the optimal composite kernel function can be determined by using any heuristic optimization method, including PSO, GA, GWO, BA and DE. Since the filter-based feature selection method is combined with the multiple kernel learning approach independent of the classifier, the proposed model can have a good performance while saving a lot of training time.

• International journal of advanced smart convergence
• /
• 제9권3호
• /
• pp.97-104
• /
• 2020

In this paper, we propose a method to derive the kernel function directly from the measured apparent earth resistivity. At this time, the kernel function is obtained through the process of solving a nonlinear system. Nonlinear systems with many variables are difficult to solve. This paper also introduces a method for converting nonlinear derived systems to linear systems. The kernel function is a function of the depth and resistance of the Earth's layer. Being able to derive an accurate kernel function means that we can estimate the earth parameters i.e. layer depth and resistivity. We also use various Earth models as simulation examples to validate the proposed method.

• 음성과학
• /
• 제12권4호
• /
• pp.17-29
• /
• 2005

Time-frequency representation reveals some useful information about instantaneous frequency, instantaneous bandwidth and boundary of each AM-FM component of a speech signal. In many cases, the instantaneous frequency of each component is not constant. The variability of instantaneous frequency causes degradation of resolution in time-frequency representation. This paper presents a method of adaptively adjusting the transform kernel for preventing degradation of resolution due to time-varying instantaneous frequency. The transform kernel is the form of frequency modulated function. The modulation function in the transform kernel is determined by the estimate of instantaneous frequency which is approximated by first order polynomial at each time instance. Also, the window function is modulated by the estimated instantaneous. frequency for mitigation of fringing. effect. In the proposed method, not only the transform kernel but also the shape and the length of. the window function are adaptively adjusted by the instantaneous frequency of a speech signal.

• 전기전자학회논문지
• /
• 제21권1호
• /
• pp.46-65
• /
• 2017

This paper proposes a fast patch-based de-blurring algorithm including kernel estimation based on the angle between the edge and the blur direction. For de-blurring, image patches from the most informative edges in the blurry image are used to estimate a kernel with low computational cost. Moreover, the kernels of each patch are estimated based on the correlation between the edge direction and the blur direction. This makes the final kernel more reliable and creates an accurate latent image from the blurry image. The combination of directionally oriented kernel estimation and patch-based de-blurring is faster and more accurate than existing state-of-the art methods. Experimental results using various test images show that the proposed method achieves its objectives: speed and accuracy.