Search results

  1. 1.
    0404694 - UIVT-O 20020058 RIV DE eng C - Conference Paper (international conference)
    Savický, Petr - Klaschka, Jan
    Optimally Trained Regression Trees and Occam's Razor.
    COMPSTAT 2002. Proceedings in Computational Statistics. Heidelberg: PhysicaVerlag, 2002 - (Härdle, W.; Rönz, B.), s. 479-484. ISBN 3-7908-1517-9.
    [COMPSTAT 2002. Berlin (DE), 24.08.2002-28.08.2002]
    R&D Projects: GA ČR GA201/00/1482
    Institutional research plan: AV0Z1030915
    Keywords : regression trees * recursive partitioning * optimization * dynamic programming * bottom-up algorithms * generalization * Occam's razor
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124933
     
     
  2. 2.
    0404322 - UIVT-O 20020234 RIV GB eng C - Conference Paper (international conference)
    Kůrková, Věra
    Universality and Complexity of Approximation of Multivariable Functions by Feedforward Networks.
    Soft Computing and Industry. Recent Applications. London: Springer, 2002 - (Roy, R.; Köppen, M.; Ovaska, S.; Furuhashi, T.; Hoffmann, F.), s. 13-24. ISBN 978-1-4471-1101-6.
    [Online World Conference on Soft Computing in Industrial Applications /6./. On the Internet (XX), 10.10.2001-24.10.2001]
    R&D Projects: GA ČR GA201/00/1482
    Institutional research plan: AV0Z1030915
    Keywords : feedforward neural networks * approximation of multivariable functions * network complexity
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124581
     
     
  3. 3.
    0403996 - UIVT-O 20000136 RIV DE eng C - Conference Paper (international conference)
    Kůrková, Věra
    Rates of Approximation by Neural Networks.
    Quo Vadis Computational Intelligence? New Trends and Approaches in Computational Intelligence. Heidelberg: PhysicaVerlag, 2000 - (Sinčák, P.; Vaščák, J.), s. 23-36. Studies in Fuzziness and Soft Computing, 54. ISBN 3-7908-1324-9. ISSN 1434-9922.
    [ISCI'2000 International Symposium on Computational Intelligence. Košice (SK), 30.08.2000-01.09.2000]
    R&D Projects: GA ČR GA201/99/0092; GA ČR GA201/00/1482
    Institutional research plan: AV0Z1030915
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124277
     
     
  4. 4.
    0403970 - UIVT-O 20000110 RIV DE eng C - Conference Paper (international conference)
    Savický, Petr - Klaschka, Jan - Antoch, J.
    Optimal Classification Trees.
    COMPSTAT Proceedings in Computational Statistics. Heidelberg: PhysicaVerlag, 2000 - (Bethlehem, J.; van der Heijden, P.), s. 427-432. ISBN 3-7908-1326-5.
    [COMPSTAT 2000 Symposium /14./. Utrecht (NL), 21.08.2000-25.08.2000]
    R&D Projects: GA ČR GA201/00/1482; GA ČR GA201/00/0769
    Institutional research plan: AV0Z1030915
    Keywords : classification trees * cost-complexity measure * optimal trees * algorithms * bottom-up procedures
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124254
     
     


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