• Title/Summary/Keyword: kernel

Search Result 2,894, Processing Time 0.032 seconds

Training of Support Vector Machines Using the Modified Kernel-adatron Algorithm (수정된 kernel-adatron 알고리즘에 의한 Support Vector Machines의 학습)

  • 조용현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.469-471
    • /
    • 2000
  • 본 논문에서는 모멘트 항을 추가한 수정된 kernel-adatron 알고리즘을 제안하고 이른 support vector machines의 학습기법으로 이용하였다. 이는 기울기상승법에서 일어나는 최적해로의 수렴에 따른 발진을 억제하여 그 수렴 속도를 좀더 개선시키는 모멘트의 장점과 kernel-adatron 알고리즘의 구현용이성을 그대로 살리기 위함이다. 제안된 학습기법의 SVM을 실제 200명의 암환자를 2부류(초기와 악성)로 분류하여 문제에 적용하여 시뮬레이션한 결과, Cambell등의 kernel-adatron 알고리즘을 이용한 SVM의 결과와 비교할 때 학습시간과 시험 데이터의 분류률에서 더욱 우수한 성능이 있음을 확인할 수 있었다.

  • PDF

A Kernel Approach to Discriminant Analysis for Binary Classification

  • Shin, Yang-Kyu
    • Journal of the Korean Data and Information Science Society
    • /
    • v.12 no.2
    • /
    • pp.83-93
    • /
    • 2001
  • We investigate a kernel approach to discriminant analysis for binary classification as a machine learning point of view. Our view of the kernel approach follows support vector method which is one of the most promising techniques in the area of machine learning. As usual discriminant analysis, the kernel method can discriminate an object most likely belongs to. Moreover, it has some advantage over discriminant analysis such as data compression and computing time.

  • PDF

Arrow Diagrams for Kernel Principal Component Analysis

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.3
    • /
    • pp.175-184
    • /
    • 2013
  • Kernel principal component analysis(PCA) maps observations in nonlinear feature space to a reduced dimensional plane of principal components. We do not need to specify the feature space explicitly because the procedure uses the kernel trick. In this paper, we propose a graphical scheme to represent variables in the kernel principal component analysis. In addition, we propose an index for individual variables to measure the importance in the principal component plane.

Variable selection in the kernel Cox regression

  • Shim, Joo-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.4
    • /
    • pp.795-801
    • /
    • 2011
  • In machine learning and statistics it is often the case that some variables are not important, while some variables are more important than others. We propose a novel algorithm for selecting such relevant variables in the kernel Cox regression. We employ the weighted version of ANOVA decomposition kernels to choose optimal subset of relevant variables in the kernel Cox regression. Experimental results are then presented which indicate the performance of the proposed method.

Jackknife Kernel Density Estimation Using Uniform Kernel Function in the Presence of k's Unidentified Outliers

  • Woo, Jung-Soo;Lee, Jang-Choon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.6 no.1
    • /
    • pp.85-96
    • /
    • 1995
  • The purpose of this paper is to propose the kernel density estimator and the jackknife kernel density estimator in the presence of k's unidentified outliers, and to compare the small sample performances of the proposed estimators in a sense of mean integrated square error(MISE).

  • PDF

Design of the Kernel Hardening in the Linux O.S. (Linux 운영체제에서 Kernel Hardening 설계)

  • Moon, Ji-Hoon;Kim, Ki-Hwan;Jang, Seung-Ju;Jung, Seung-In
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.431-434
    • /
    • 2003
  • 본 논문에서는 Linux 운영체제에서의 kernel hardening을 설계한다. 커널 내에서 panic 이 발생할 경우 복구가 가능한 경우에는 정상적인 동작이 될 수 있도록 한다. 이렇게 함으로써 Linux Kernel Hardening 기능은 안정적인 커널의 동작을 보장한다. 본 논문에서 Linux Kernel Hardening을 보장하기 위하여 커널 내 ASSERT(), BUG() 함수를 중심으로 설계를 한다.

  • PDF

A Support Vector Method for the Deconvolution Problem

  • Lee, Sung-Ho
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.3
    • /
    • pp.451-457
    • /
    • 2010
  • This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

REMARKS ON KERNEL FOR WAVELET EXPANSIONS IN MULTIDIMENSIONS

  • Shim, Hong-Tae;Kwon, Joong-Sung
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.419-426
    • /
    • 2009
  • In expansion of function by special basis functions, properties of expansion kernel are very important. In the Fourier series, the series are expressed by the convolution with Dirichlet kernel. We investigate some of properties of kernel in wavelet expansions both in one and higher dimensions.

  • PDF

Implementation of A Handheld Embedded Kernel (휴대 임베디드 시스템 커널 구현)

  • 유진호
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.479-482
    • /
    • 1999
  • In this paper, we implement and construct a kernel on handhold systems. The goal of this project is to develop issues related to the development of small devices: embedded kernel, power management, user interface issues, networking, and the development of applications for small devices. We explain basic system configuration, kernel activity, device drivers and developing environment in this paper. We also explain detail scheduler activity.

  • PDF

THE EXACT BERGMAN KERNEL AND THE EXTREMAL PROBLEM

  • Jeong, Moonja
    • Korean Journal of Mathematics
    • /
    • v.13 no.2
    • /
    • pp.183-191
    • /
    • 2005
  • In this paper we find the Laurent series expansions representing the reproducing kernels. Also we find the number of zeroes of the exact Bergman kernel via parallel slit domain in order to relate the exact Bergman kernel to an extremal problem.

  • PDF