New specifics for a hierarchial estimator meta-algorithm

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hierarchical Estimator is a meta-algorithm presented in [1] concerned with learning a nonlinear relation between two vector variables from training data, which is one of the core tasks of machine learning, primarily for the purpose of prediction. It arranges many simple function approximators into a tree-like structure in order to achieve a solution with a low error. This paper presents a new version of specifics for that meta-algorithm - a so called training set division and a competence function creation method. The included experimental results show improvement over the methods described in [1]. A short recollection of Hierarchical Estimator is also included. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brodowski, S., & Bielecki, A. (2012). New specifics for a hierarchial estimator meta-algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7268 LNAI, pp. 22–29). Springer Verlag. https://doi.org/10.1007/978-3-642-29350-4_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free