RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        An Iterative Approach to Determine the Complexity of Local Models for Robust Identification of Nonlinear Systems

        Salman Ahmadi,Mehdi Karrari 제어·로봇·시스템학회 2012 International Journal of Control, Automation, and Vol.10 No.1

        In this paper, a new multi-model approach is proposed for identification of nonlinear systems. In similar identification methods, the operating space is partitioned and a local model is suggested for each partition. In such approaches, since the same linear structure is often used for all local models; huge number of local linear models is usually required to reasonably model an operating region with severely nonlinear dynamics. Therefore the size of the global model may exponentially increase; and as a result model robustness may decrease. In the proposed approach the best model structure is selected for the particular nonlinear study system in an iterative approach. At each iteration, a choice is made to increase number of local models and/or increase the local model complexity. Furthermore, it determines the complexity of local models based on increasing the model accuracy and ensuring the model robustness. In order to optimize the model approximation capability and model robustness, a model term selection approach based on a forward orthogonal least squares algorithm and a criterion that minimizes the sum of the variance of the parameter estimates is applied. Simulation results show that the proposed method results in an excellent validation performance with fewer parameters.

      • Distributed Incremental EM Algorithm for Density Estimation in Peer-to-Peer Networks

        Behrooz Safarinejadian,Mohammad B. Menhaj,Mehdi Karrari 제어로봇시스템학회 2008 제어로봇시스템학회 국제학술대회 논문집 Vol.2008 No.10

        In this paper a distributed incremental EM algorithm (DIEM) is proposed for density estimation and clustering of data distributed over the nodes of a network. Environmental modeling using a sensor network or clustering a data set in a computer network are some of the applications of this algorithm. After a full derivation of the distributed EM algorithm, it will be shown that DIEM converges faster than the standard distributed EM (DEM) algorithm. In DIEM, the data set of each node is partitioned into disjoint blocks of data which incrementally partial E-steps are performed over. Simulation results show that DIEM remarkably outperforms DEM.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼