root/library/bdm/estim/mixtures.h @ 1009

Revision 1009, 4.7 kB (checked in by smidl, 14 years ago)

changes in bayes_batch

  • Property svn:eol-style set to native
Line 
1/*!
2  \file
3  \brief Bayesian Filtering for mixtures of exponential family (EF) members
4  \author Vaclav Smidl.
5
6  -----------------------------------
7  BDM++ - C++ library for Bayesian Decision Making under Uncertainty
8
9  Using IT++ for numerical operations
10  -----------------------------------
11*/
12
13#ifndef MIXTURES_H
14#define MIXTURES_H
15
16
17#include "../math/functions.h"
18#include "../stat/exp_family.h"
19#include "../stat/emix.h"
20#include "arx.h"
21
22namespace bdm {
23
24//! enum switch for internal approximation used in MixEF
25enum MixEF_METHOD { EM = 0, QB = 1};
26
27/*!
28* \brief Mixture of Exponential Family Densities
29
30An approximate estimation method for models with latent discrete variable, such as
31mixture models of the following kind:
32\f[
33f(y_t|\psi_t, \Theta) = \sum_{i=1}^{n} w_i f(y_t|\psi_t, \theta_i)
34\f]
35where  \f$\psi\f$ is a known function of past outputs, \f$w=[w_1,\ldots,w_n]\f$ are component weights, and component parameters \f$\theta_i\f$ are assumed to be mutually independent. \f$\Theta\f$ is an aggregation af all component parameters and weights, i.e. \f$\Theta = [\theta_1,\ldots,\theta_n,w]\f$.
36
37The characteristic feature of this model is that if the exact values of the latent variable were known, estimation of the parameters can be handled by a single model. For example, for the case of mixture models, posterior density for each component parameters would be a BayesianModel from Exponential Family.
38
39This class uses EM-style type algorithms for estimation of its parameters. Under this simplification, the posterior density is a product of exponential family members, hence under EM-style approximate estimation this class itself belongs to the exponential family.
40
41TODO: Extend BM to use rvc.
42*/
43class MixEF: public BMEF {
44protected:
45        //! Models for Components of \f$\theta_i\f$
46        Array<BMEF*> Coms;
47        //! Statistics for weights
48        multiBM weights;
49        //aux
50        friend class eprod_mix;
51        //!Posterior on component parameters
52        class eprod_mix: public eprod_base {
53                protected:
54                const MixEF &mix; // pointer to parent.n
55                public:
56                eprod_mix(const MixEF &m):mix(m){}
57                const epdf* factor(int i) const {return (i==(mix.Coms.length()-1)) ? &mix.weights.posterior() : &mix.Coms(i)->posterior();}
58                const int no_factors()const {return mix.Coms.length()+1;}
59        } est;
60        ////!indices of component rvc in common rvc
61
62        //! Flag for a method that is used in the inference
63        MixEF_METHOD method;
64
65        //! maximum number of iterations
66        int max_niter;
67public:
68        //! Full constructor
69        MixEF ( const Array<BMEF*> &Coms0, const vec &alpha0 ) :
70                        BMEF ( ), Coms ( Coms0.length() ),
71                        weights (), est(*this), method ( QB ), max_niter(10) {
72                for ( int i = 0; i < Coms0.length(); i++ ) {
73                        Coms ( i ) = ( BMEF* ) Coms0 ( i )->_copy();
74                }
75                weights.set_parameters(alpha0);
76                weights.validate();
77        }
78
79        //! Constructor of empty mixture
80        MixEF () :
81                        BMEF ( ), Coms ( 0 ),
82                        weights (), est(*this), method ( QB ), max_niter(10) {
83        }
84        //! Copy constructor
85        MixEF ( const MixEF &M2 ) : BMEF ( ),  Coms ( M2.Coms.length() ),
86                        weights ( M2.weights ), est(*this), method ( M2.method ), max_niter(M2.max_niter) {
87                for ( int i = 0; i < M2.Coms.length(); i++ ) {
88                        Coms ( i ) = (BMEF*) M2.Coms ( i )->_copy();
89                }
90        }
91
92        //! Initializing the mixture by a random pick of centroids from data
93        //! \param Com0 Initial component - necessary to determine its type.
94        //! \param Data Data on which the initialization will be done
95        //! \param c Initial number of components, default=5
96        void init ( BMEF* Com0, const mat &Data, const int c = 5 );
97        //Destructor
98        //! Recursive EM-like algorithm (QB-variant), see Karny et. al, 2006
99        void bayes ( const vec &yt, const vec &cond );
100        //! EM algorithm
101        void bayes ( const mat &yt, const vec &cond );
102        //! batch weighted Bayes rule
103        double bayes_batch ( const mat &yt, const mat &cond, const vec &wData );
104        double logpred ( const vec &yt, const vec &cond ) const;
105        //! return correctly typed posterior (covariant return)
106        const eprod_mix& posterior() const {
107                return est;
108        }
109
110        emix* epredictor(const vec &cond=vec()) const;
111        //! Flatten the density as if it was not estimated from the data
112        void flatten ( const BMEF* M2 );
113        //! Access function
114        BMEF* _Coms ( int i ) {
115                return Coms ( i );
116        }
117
118        //!Set which method is to be used
119        void set_method ( MixEF_METHOD M ) {
120                method = M;
121        }
122
123void to_setting ( Setting &set ) const {
124        BMEF::to_setting( set );
125        UI::save ( Coms, set, "Coms" );
126        UI::save ( &weights, set, "weights" );
127}
128/*! \brief reads data from setting
129*/
130void from_setting (const  Setting &set ) {
131        BMEF::from_setting( set );
132        UI::get ( Coms, set, "Coms" );
133        UI::get ( weights, set, "weights" );
134}
135};
136UIREGISTER ( MixEF );
137
138class ARXprod: public ProdBMBase {
139        Array<shared_ptr<ARX> > arxs;
140        public:
141                ARX* bm(int i){return arxs(i).get();}
142                int no_bms() {return arxs.length();}
143};
144UIREGISTER(ARXprod);
145
146}
147#endif // MIXTURES_H
Note: See TracBrowser for help on using the browser.