Number of the records: 1  

Cloning for Heteroscedasticity Elimination in GMDH learning procedure

  1. 1.
    SYSNO ASEP0330094
    Document TypeA - Abstract
    R&D Document TypeThe record was not marked in the RIV
    R&D Document TypeNení vybrán druh dokumentu
    TitleCloning for Heteroscedasticity Elimination in GMDH learning procedure
    TitleKlonování pro eliminaci heteroskedasticity v učicí proceduře sítě typu GMDH
    Author(s) Jiřina, Marcel (UIVT-O) SAI, RID
    Jiřina jr., M. (CZ)
    Source TitleUnconventional Computation. - Berlin : Springer, 2009 / Calude C.S. ; Costa J.F. ; Dershowitz N. ; Freire E. ; Rozenberg G. - ISBN 978-3-642-03744-3
    S. 288-288
    Number of pages1 s.
    ActionUC 2009. Unconventional Computation /8./
    Event date07.09.2009-11.09.2009
    VEvent locationPonta Delgada
    CountryPT - Portugal
    Event typeWRD
    Languageeng - English
    CountryDE - Germany
    Keywordsmultivariate data ; GMDH ; linear regression ; Gauss-Markov conditions ; cloning ; genetic selection ; classification
    Subject RIVBA - General Mathematics
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000272047700026
    DOI10.1007/978-3-642-03745-0_31
    AnnotationFor the classification of multivariate data into two classes the well-known GMDH MIA (group method data handling multilayer iterative algorithm) is often used. The process of adaptation of the GMDH network is based on standard linear regression. However, it can be found that the mathematical condition of homoscedasticity for linear regression to get unbiased results is not fulfilled. We found that cloning is a simple and effective method for obtaining a less biased solution and faster convergence. Our results demonstrate that the influence of heteroscedasticity can be easily eliminated this way better behavior of GMDH algorithm can be obtained.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.