A regularized minimum cross-entropy algorithm on mixtures of experts for time series prediction

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

Abstract

The well-known mixtures of experts(ME) model is usually trained by expectation maximization(EM) algorithm for maximum likelihood learning. However, we have to first determine the number of experts, which is often hardly known. Derived from regularization theory, a regularized minimum cross-entropy(RMCE) algorithm is proposed to train ME model, which can automatically make model selection. When time series is modeled by ME, it is demonstrated by some climate prediction experiments that RMCE algorithm outperforms EM algorithm. We also compare RMCE algorithm with other regression methods such as back-propagation(BP) algorithm and normalized radial basis function(NRBF) network, and find that RMCE algorithm still shows promising results. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Lu, Z. (2006). A regularized minimum cross-entropy algorithm on mixtures of experts for time series prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3972 LNCS, pp. 753–758). Springer Verlag. https://doi.org/10.1007/11760023_111

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