RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Approximate training of one-class support vector machines using expected margin

        Kang, Seokho,Kim, Dongil,Cho, Sungzoon Elsevier 2019 COMPUTERS & INDUSTRIAL ENGINEERING Vol.130 No.-

        <P><B>Abstract</B></P> <P>One-class support vector machine (OCSVM) has demonstrated superior performance in one-class classification problems. However, its training is impractical for large-scale datasets owing to high computational complexity with respect to the number of training instances. In this study, we propose an approximate training method based on the concept of expected margin to obtain a model identical to full training with reduced computational burden. The proposed method selects prospective support vectors using multiple OCSVM models trained on small bootstrap samples of an original dataset. The final OCSVM model is trained using only the selected instances. The proposed method is not only simple and straightforward but also considerably effective in improving the training efficiency of OCSVM. Preliminary experiments are conducted on large-scale benchmark datasets to examine the effectiveness of the proposed method in terms of approximation performance and computational efficiency.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Approximate training method for one-class support vector machine is presented. </LI> <LI> It selects instances likely to be support vectors using expected margin. </LI> <LI> Final model is trained only using selected instances. </LI> <LI> Training time is reduced without sacrificing predictive performance. </LI> <LI> Effectiveness is demonstrated on large-scale datasets. </LI> </UL> </P>

      • Robust Nonlinear Model Predictive Control via Approximate Value Function

        Yu Yang,Jong Min Lee 제어로봇시스템학회 2011 제어로봇시스템학회 국제학술대회 논문집 Vol.2011 No.10

        In order to improve the performance of nonlinear model predictive control (NMPC) in the presence of disturbances or model uncertainties, an approximate dynamic programming (ADP) control scheme is proposed. Namely, the Bellman’s optimality principle is employed to determine the input based on the approximate value function constructed from the historical operation data. In addition, the support vector data description is also applied in the state space to determine if the ADP control is suitable for the current state. The proposed control strategy is illustrated on a CSTR example to show its effectiveness.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼