A new sequential algorithm for regression problems by using mixture distribution

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

Abstract

A newsequen tial method for the regression problems is studied. The suggested method is motivated by boosting methods in the classification problems. Boosting algorithms use the weighted data to update the estimator. In this paper we construct a sequential estimation method from the viewpoint of nonparametric estimation by using mixture distribution. The algorithm uses the weighted residuals of training data. We compare the suggested algorithm to the greedy algorithm by the simple simulation. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Kanamori, T. (2002). A new sequential algorithm for regression problems by using mixture distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2415 LNCS, pp. 535–540). Springer Verlag. https://doi.org/10.1007/3-540-46084-5_87

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