• Title/Summary/Keyword: kernel machine

Search Result 301, Processing Time 0.031 seconds

A New Self-Organizing Map based on Kernel Concepts (자가 조직화 지도의 커널 공간 해석에 관한 연구)

  • Cheong Sung-Moon;Kim Ki-Bom;Hong Soon-Jwa
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.439-448
    • /
    • 2006
  • Previous recognition/clustering algorithms such as Kohonen SOM(Self-Organizing Map), MLP(Multi-Layer Percecptron) and SVM(Support Vector Machine) might not adapt to unexpected input pattern. And it's recognition rate depends highly on the complexity of own training patterns. We could make up for and improve the weak points with lowering complexity of original problem without losing original characteristics. There are so many ways to lower complexity of the problem, and we chose a kernel concepts as an approach to do it. In this paper, using a kernel concepts, original data are mapped to hyper-dimension space which is near infinite dimension. Therefore, transferred data into the hyper-dimension are distributed spasely rather than originally distributed so as to guarantee the rate to be risen. Estimating ratio of recognition is based on a new similarity-probing and learning method that are proposed in this paper. Using CEDAR DB which data is written in cursive letters, 0 to 9, we compare a recognition/clustering performance of kSOM that is proposed in this paper with previous SOM.

WAP Abstract Kernel Layer Supporting Multi-platform (다중 플랫폼 지원을 위한 WAP 추상 커널 계층)

  • Gang, Yeong-Man;Han, Sun-Hui;Jo, Guk-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.3
    • /
    • pp.265-272
    • /
    • 2001
  • In case of implementing a complicated application like WAP (Wireless Application Protocol) in a mobile terminal with the characteristics of bare machine and versatile kernel aspects of which are control, interrupt and IPC(Inter Process Communication), a special methodology should be needed. If not, it will cause more cost and human resources, even delayed product into launching for the time-to-market. This paper suggests AKL, (Abstract Kernel Layer) for the design and implementation of WAP on basis of multi-platform. AKL is running on the various kernel including REX, MS-DOS, MS-Window, UNIX and LINUX. For the purpose of it, AKL makes machine-dependant features be minimized and supports a consistent interface on API (Application Program Interface) point of view. Therefore, it makes poring times of a device be shorten and makes easy of maintenance. We validated our suggestion as a consequent of porting WAP into PlamV PDA and mobile phone with AKL.

  • PDF

Incremental Eigenspace Model Applied To Kernel Principal Component Analysis

  • Kim, Byung-Joo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.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.

  • PDF

Estimating Variance Function with Kernel Machine

  • Kim, Jong-Tae;Hwang, Chang-Ha;Park, Hye-Jung;Shim, Joo-Yong
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.2
    • /
    • pp.383-388
    • /
    • 2009
  • In this paper we propose a variance function estimation method based on kernel trick for replicated data or data consisted of sample variances. Newton-Raphson method is used to obtain associated parameter vector. Furthermore, the generalized approximate cross validation function is introduced to select the hyper-parameters which affect the performance of the proposed variance function estimation method. Experimental results are then presented which illustrate the performance of the proposed procedure.

Kirchhoff Plate Analysis by Using Hermite Reproducing Kernel Particle Method (HRKPM을 이용한 키르히호프 판의 해석)

  • 석병호;송태한
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.5
    • /
    • pp.67-72
    • /
    • 2003
  • For the analysis of Kirchhoff plate bending problems, a new meshless method is implemented. For the satisfaction of the $C^1$ continuity condition in which the first derivative is treated an another primary variable, Hermite interpolation is enforced on standard reproducing kernel particle method. In order to impose essential boundary conditions on solving $C^1$ continuity problems, shape function modifications are adopted. Through numerical tests, the characteristics and accuracy of the HRKPM are investigated and compared with the finite element analysis. By this implementatioa it is shown that high accuracy is achieved by using HRKPM for solving Kirchhoff plate bending problems.

Applied linear and nonlinear statistical models for evaluating strength of Geopolymer concrete

  • Prem, Prabhat Ranjan;Thirumalaiselvi, A.;Verma, Mohit
    • Computers and Concrete
    • /
    • v.24 no.1
    • /
    • pp.7-17
    • /
    • 2019
  • The complex phenomenon of the bond formation in geopolymer is not well understood and therefore, difficult to model. This paper present applied statistical models for evaluating the compressive strength of geopolymer. The applied statistical models studied are divided into three different categories - linear regression [least absolute shrinkage and selection operator (LASSO) and elastic net], tree regression [decision and bagging tree] and kernel methods (support vector regression (SVR), kernel ridge regression (KRR), Gaussian process regression (GPR), relevance vector machine (RVM)]. The performance of the methods is compared in terms of error indices, computational effort, convergence and residuals. Based on the present study, kernel based methods (GPR and KRR) are recommended for evaluating compressive strength of Geopolymer concrete.

Kernelized Structure Feature for Discriminating Meaningful Table from Decorative Table (장식 테이블과 의미 있는 테이블 식별을 위한 커널 기반의 구조 자질)

  • Son, Jeong-Woo;Go, Jun-Ho;Park, Seong-Bae;Kim, Kweon-Yang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.5
    • /
    • pp.618-623
    • /
    • 2011
  • This paper proposes a novel method to discriminate meaningful tables from decorative one using a composite kernel for handling structural information of tables. In this paper, structural information of a table is extracted with two types of parse trees: context tree and table tree. A context tree contains structural information around a table, while a table tree presents structural information within a table. A composite kernel is proposed to efficiently handle these two types of trees based on a parse tree kernel. The support vector machines with the proposed kernel dised kuish meaningful tables from the decorative ones with rich structural information.

Quantile regression using asymmetric Laplace distribution (비대칭 라플라스 분포를 이용한 분위수 회귀)

  • Park, Hye-Jung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.6
    • /
    • pp.1093-1101
    • /
    • 2009
  • Quantile regression has become a more widely used technique to describe the distribution of a response variable given a set of explanatory variables. This paper proposes a novel modelfor quantile regression using doubly penalized kernel machine with support vector machine iteratively reweighted least squares (SVM-IRWLS). To make inference about the shape of a population distribution, the widely popularregression, would be inadequate, if the distribution is not approximately Gaussian. We present a likelihood-based approach to the estimation of the regression quantiles that uses the asymmetric Laplace density.

  • PDF

Two Machine Learning Models for Mobile Phone Battery Discharge Rate Prediction Based on Usage Patterns

  • Chantrapornchai, Chantana;Nusawat, Paingruthai
    • Journal of Information Processing Systems
    • /
    • v.12 no.3
    • /
    • pp.436-454
    • /
    • 2016
  • This research presents the battery discharge rate models for the energy consumption of mobile phone batteries based on machine learning by taking into account three usage patterns of the phone: the standby state, video playing, and web browsing. We present the experimental design methodology for collecting data, preprocessing, model construction, and parameter selections. The data is collected based on the HTC One X hardware platform. We considered various setting factors, such as Bluetooth, brightness, 3G, GPS, Wi-Fi, and Sync. The battery levels for each possible state vector were measured, and then we constructed the battery prediction model using different regression functions based on the collected data. The accuracy of the constructed models using the multi-layer perceptron (MLP) and the support vector machine (SVM) were compared using varying kernel functions. Various parameters for MLP and SVM were considered. The measurement of prediction efficiency was done by the mean absolute error (MAE) and the root mean squared error (RMSE). The experiments showed that the MLP with linear regression performs well overall, while the SVM with the polynomial kernel function based on the linear regression gives a low MAE and RMSE. As a result, we were able to demonstrate how to apply the derived model to predict the remaining battery charge.