• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.146-158
• /
• 2022

With the success of the digital economy and the rapid development of its technology, network security has received increasing attention. Intrusion detection technology has always been a focus and hotspot of research. A hybrid model that combines particle swarm optimization (PSO) and kernel extreme learning machine (KELM) is presented in this work. Continuous-valued PSO and binary PSO (BPSO) are adopted together to determine the parameter combination and the feature subset. A fitness function based on the detection rate and the number of selected features is proposed. The results show that the method can simultaneously determine the parameter values and select features. Furthermore, competitive or better accuracy can be obtained using approximately one quarter of the raw input features. Experiments proved that our method is slightly better than the genetic algorithm-based KELM model.

• Interdisciplinary Bio Central
• /
• v.4 no.4
• /
• pp.14.1-14.6
• /
• 2012

Splice site prediction in DNA sequence is a basic search problem for finding exon/intron and intron/exon boundaries. Removing introns and then joining the exons together forms the mRNA sequence. These sequences are the input of the translation process. It is a necessary step in the central dogma of molecular biology. The main task of splice site prediction is to find out the exact GT and AG ended sequences. Then it identifies the true and false GT and AG ended sequences among those candidate sequences. In this paper, we survey research works on splice site prediction based on support vector machine (SVM). The basic difference between these research works is nucleotide encoding technique and SVM kernel selection. Some methods encode the DNA sequence in a sparse way whereas others encode in a probabilistic manner. The encoded sequences serve as input of SVM. The task of SVM is to classify them using its learning model. The accuracy of classification largely depends on the proper kernel selection for sequence data as well as a selection of kernel parameter. We observe each encoding technique and classify them according to their similarity. Then we discuss about kernel and their parameter selection. Our survey paper provides a basic understanding of encoding approaches and proper kernel selection of SVM for splice site prediction.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1327-1334
• /
• 2008

Mixed effect binomial regression models are widely used for analysis of correlated count data in which the response is the result of a series of one of two possible disjoint outcomes. In this paper, we consider kernel extensions with nonparametric fixed effects and parametric random effects. The estimation is through the penalized likelihood method based on kernel trick, and our focus is on the efficient computation and the effective hyperparameter selection. For the selection of hyperparameters, cross-validation techniques are employed. Examples illustrating usage and features of the proposed method are provided.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.8
• /
• pp.119-125
• /
• 2010

This paper proposes a new solution about physical problem of autonomous mobile robots system using ultrasonic sensors. An mobile robot uses several sensors for recognition of its circumstance. However, such sensor data are not accurate all the time. A means of removing the noise that sensor data contains constantly, It is possible for simulation to estimate its circumstance based on ultrasonic sensor data by learning algorithm SVR(Support Vector Regression). To use SVR, it is being selected parameter and kernel which are the component of SVR. Selecting the component of SVR, the most accurate parameter data was selected through the tests because it is not existed determined data. In addition, choosing the kernel uses RBF(Radial Basis Function) kernel which is the most generalized. This paper proposes SVR based algorithm to compensate for the above demerits of ultrasonic sensor through the experimentation under three different environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1083-1088
• /
• 2013

Detection and classification of undersea mines in shallow waters using active sonar returns is a difficult task due to complexity of underwater environment. Support vector machine(SVM) is a binary classifier that is well known to provide a global optimum solution. In this paper, classification experiments of sonar returns from mine-like objects and non-mine-like objects are carried out using the SVM, and classification performance is analyzed and presented with discussions depending on parameter values of SVM kernel functions.

• Kyungpook Mathematical Journal
• /
• v.50 no.2
• /
• pp.307-314
• /
• 2010

By introducing a homogeneous kernel of 0-degree with an independent parameter and estimating the weight coefficient, a bilateral form of the Hilbert-type series inequality with a best constant factor is established.

• Kyungpook Mathematical Journal
• /
• v.49 no.3
• /
• pp.521-532
• /
• 2009

In this paper, by introducing a homogenous kernel of -4-degree, we establish a new Hilbert-type integral inequality with multi-parameter and a best constant factor. As applications, the equivalent form, the reverse forms and some particular results are given correspondingly.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.995-1004
• /
• 2007

In this paper, we analyse online word-of-mouth and Korean box-office sales data based on kernel regression method. To do this, we consider the regression model with mixed-data and apply the least square cross-validation method proposed by Li and Racine (2004) to the model. We found the box-office sales can be explained by volume of online word-of-mouth and the characteristics of the movies.

• Communications for Statistical Applications and Methods
• /
• v.26 no.6
• /
• pp.611-622
• /
• 2019

This paper considers the estimation of the long memory parameter in nonparametric regression with strongly correlated errors. The key idea is to minimize a unified mean squared error of long memory parameter to select both kernel bandwidth and the number of frequencies used in exact local Whittle estimation. A unified mean squared error framework is more natural because it provides both goodness of fit and measure of strong dependence. The block bootstrap is applied to evaluate the mean squared error. Finite sample performance using Monte Carlo simulations shows the closest performance to the oracle. The proposed method outperforms existing methods especially when dependency and sample size increase. The proposed method is also illustreated to the volatility of exchange rate between Korean Won for US dollar.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.141-148
• /
• 2011

Support vector machines have been extensively studied and utilized in pattern recognition area for years. One of interesting applications of this technique is music/speech classification for a standardized codec such as 3GPP2 selectable mode vocoder. In this paper, we propose a novel approach that improves the speech/music classification of support vector machines. While conventional support vector machine optimization techniques apply during training phase, the proposed technique can be adopted in classification phase. In this regard, the proposed approach can be developed and employed in parallel with conventional optimizations, resulting in synergistic boost in classification performance. We first analyze the impact of kernel width parameter on the classifications made by support vector machines. From this analysis, we observe that we can fine-tune outputs of support vector machines with the kernel width parameter. To make the most of this capability, we identify strong correlation among neighboring input frames, and use this correlation information as a guide to adjusting kernel width parameter. According to the experimental results, the proposed algorithm is found to have potential for improving the performance of support vector machines.