• Title/Summary/Keyword: Support function

Search Result 2,686, Processing Time 0.038 seconds

Design of controller using Support Vector Regression (서포트 벡터 회귀를 이용한 제어기 설계)

  • Hwang, Ji-Hwan;Kwak, Hwan-Joo;Park, Gwi-Tae
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.320-322
    • /
    • 2009
  • Support vector learning attracts great interests in the areas of pattern classification, function approximation, and abnormality detection. In this pater, we design the controller using support vector regression which has good properties in comparison with multi-layer perceptron or radial basis function. The applicability of the presented method is illustrated via an example simulation.

  • PDF

Incremental Support Vector Learning Method for Function Approximation (함수 근사를 위한 점증적 서포트 벡터 학습 방법)

  • 임채환;박주영
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.135-138
    • /
    • 2002
  • This paper addresses incremental learning method for regression. SVM(support vector machine) is a recently proposed learning method. In general training a support vector machine requires solving a QP (quadratic programing) problem. For very large dataset or incremental dataset, solving QP problems may be inconvenient. So this paper presents an incremental support vector learning method for function approximation problems.

  • PDF

Empirical Choice of the Shape Parameter for Robust Support Vector Machines

  • Pak, Ro-Jin
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.4
    • /
    • pp.543-549
    • /
    • 2008
  • Inspired by using a robust loss function in the support vector machine regression to control training error and the idea of robust template matching with M-estimator, Chen (2004) applies M-estimator techniques to gaussian radial basis functions and form a new class of robust kernels for the support vector machines. We are specially interested in the shape of the Huber's M-estimator in this context and propose a way to find the shape parameter of the Huber's M-estimating function. For simplicity, only the two-class classification problem is considered.

An Analysis of University Students' Needs for Learning Support Functions of Learning Management System Augmented with Artificial Intelligence Technology

  • Jeonghyun, Yun;Taejung, Park
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.1-15
    • /
    • 2023
  • The aim of this study is to identify intelligent learning support functions in Learning Management System (LMS) to support university student learning activities during the transition from face-to-face classes to online learning. To accomplish this, we investigated the perceptions of students on the levels of importance and urgency toward learning support functions of LMS powered with Artificial Intelligent (AI) technology and analyzed the differences in perception according to student characteristics. As a result of this study, the function that students considered to be the most important and felt an urgent need to adopt was to give automated grading and feedback for their writing assignments. The functions with the next highest score in importance and urgency were related to receiving customized feedback and help on task performance processed as well as results in the learning progress. In addition, students view a function to receive customized feedback according to their own learning plan and progress and to receive suggestions for improvement by diagnosing their strengths and weaknesses to be both vitally important and urgently needed. On the other hand, the learning support function of LMS, which was ranked as low importance and urgency, was a function that analyzed the interaction between professors and students and between fellow students. It is expected that the results of this student needs analysis will be helpful in deriving the contents of learning support functions that should be developed as well as providing basic information for prioritizing when applying AI technology to implement learner-centered LMS in the future.

A Study on future oriented urban space production Strategy for Activation of CBD (CBD 활성화를 위한 미래형 도시공간연출 전략에 관한 연구)

  • Oh, Jae-Woo;Park, Kwan-Il
    • The Journal of Information Technology
    • /
    • v.12 no.3
    • /
    • pp.25-48
    • /
    • 2009
  • 1. CONTENTS 1) RESEARCH OBJECTIVES The purpose of the study was to propose a future oriented urban space production strategy to offer diverse useful services to citizens to improve international competitiveness of cities in the times of competition that competitive subjects were changed from competition among countries to competition among cities. 2) RESEARCH METHOD In the proposed future-oriented urban space production strategy, the study compared/analyzed main plans related to development of urban space by selecting CBD(Jung-gu) of Busan out of local metropolises in South Korea. 3) RESEARCH FINDINGS In the proposed future-oriented urban space production strategy, the study largely sorted city's function into four scopes function of industrial support, function of social support, function of living support and function of urban infrastructure. 2. RESULTS It is expected that the proposed future oriented urban space production strategy will be utilized as a useful reference model when a lot of local governments, planning a ubiquitous urban space, establish a plan for constructing a ubiquitous urban space.

  • PDF

Support vector quantile regression ensemble with bagging

  • Shim, Jooyong;Hwang, Changha
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.3
    • /
    • pp.677-684
    • /
    • 2014
  • Support vector quantile regression (SVQR) is capable of providing more complete description of the linear and nonlinear relationships among random variables. To improve the estimation performance of SVQR we propose to use SVQR ensemble with bagging (bootstrap aggregating), in which SVQRs are trained independently using the training data sets sampled randomly via a bootstrap method. Then, they are aggregated to obtain the estimator of the quantile regression function using the penalized objective function composed of check functions. Experimental results are then presented, which illustrate the performance of SVQR ensemble with bagging.

Central Control over Distributed Service Function Path

  • Li, Dan;Lan, Julong;Hu, Yuxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.577-594
    • /
    • 2020
  • Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

On the Support Vector Machine with the kernel of the q-normal distribution

  • Joguchi, Hirofumi;Tanaka, Masaru
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.983-986
    • /
    • 2002
  • Support Vector Machine (SVM) is one of the methods of pattern recognition that separate input data using hyperplane. This method has high capability of pattern recognition by using the technique, which says kernel trick, and the Radial basis function (RBF) kernel is usually used as a kernel function in kernel trick. In this paper we propose using the q-normal distribution to the kernel function, instead of conventional RBF, and compare two types of the kernel function.

  • PDF

e-SVR using IRWLS Procedure

  • Shim, Joo-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.4
    • /
    • pp.1087-1094
    • /
    • 2005
  • e-insensitive support vector regression(e-SVR) is capable of providing more complete description of the linear and nonlinear relationships among random variables. In this paper we propose an iterative reweighted least squares(IRWLS) procedure to solve the quadratic problem of e-SVR with a modified loss function. Furthermore, we introduce the generalized approximate cross validation function to select the hyperparameters which affect the performance of e-SVR. Experimental results are then presented which illustrate the performance of the IRWLS procedure for e-SVR.

  • PDF

A study on the Time Series Prediction Using the Support Vector Machine (보조벡터 머신을 이용한 시계열 예측에 관한 연구)

  • 강환일;정요원;송영기
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.315-315
    • /
    • 2000
  • In this paper, we perform the time series prediction using the SVM(Support Vector Machine). We make use of two different loss functions and two different kernel functions; i) Quadratic and $\varepsilon$-insensitive loss function are used; ii) GRBF(Gaussian Radial Basis Function) and ERBF(Exponential Radial Basis Function) are used. Mackey-Glass time series are used for prediction. For both cases, we compare the results by the SVM to those by ANN(Artificial Neural Network) and show the better performance by SVM than that by ANN.