STK::CEMAlgo Class Reference

Implementation of the SEM algorithm. More...

#include <STK_MixtureAlgo.h>

Inheritance diagram for STK::CEMAlgo:

Public Member Functions
	CEMAlgo ()
	default constructor
	CEMAlgo (CEMAlgo const &algo)
	Copy constructor.
virtual	~CEMAlgo ()
	destructor
virtual CEMAlgo *	clone () const
	clone pattern
virtual bool	run ()
	run the algorithm on the model calling cStep, mStep and eStep of the model until the maximal number of iteration is reached or the variation of the lnLikelihood is less than epsilon.
Public Member Functions inherited from STK::IMixtureAlgo
virtual	~IMixtureAlgo ()
	destructor
int	nbIterMax () const
int	epsilon () const
Real	threshold () const
void	setModel (IMixtureComposer *p_model)
	set model
void	setNbIterMax (int nbIterMax)
	set maximal number of iterations
void	setEpsilon (Real epsilon)
	set tolerance value
void	setThreshold (Real threshold)
	set threshold value
Public Member Functions inherited from STK::IRunnerBase
String const &	error () const
	get the last error message.

Additional Inherited Members
Protected Member Functions inherited from STK::IMixtureAlgo
	IMixtureAlgo ()
	default constructor
	IMixtureAlgo (IMixtureAlgo const &algo)
	Copy constructor.
Protected Member Functions inherited from STK::IRunnerBase
	IRunnerBase ()
	default constructor
	IRunnerBase (IRunnerBase const &runner)
	copy constructor
virtual	~IRunnerBase ()
	destructor
virtual void	update ()
	update the runner.
Protected Attributes inherited from STK::IMixtureAlgo
IMixtureComposer *	p_model_
	pointer on the mixture model
int	nbIterMax_
	number of iterations of the algorithm
Real	epsilon_
	tolerance of the algorithm.
Real	threshold_
	Minimal number of individuals.
Protected Attributes inherited from STK::IRunnerBase
String	msg_error_
	String with the last error message.
bool	hasRun_
	true if run has been used, false otherwise

Detailed Description

Implementation of the SEM algorithm.

The CEM algorithm calls alternatively the steps:

• cStep()
• paramUpdateStep()
• eStep() until the maximum number of iterations is reached or the variation of the ln-likelihood is less than the tolerance.

Definition at line 80 of file STK_MixtureAlgo.h.

Constructor & Destructor Documentation

CEMAlgo() [1/2]

STK::CEMAlgo::CEMAlgo ( )

inline

default constructor

Definition at line 84 of file STK_MixtureAlgo.h.

: IMixtureAlgo() {}

Referenced by clone().

CEMAlgo() [2/2]

STK::CEMAlgo::CEMAlgo ( CEMAlgo const &  algo )

inline

Copy constructor.

Parameters

algo	the algorithm to copy

Definition at line 87 of file STK_MixtureAlgo.h.

: IMixtureAlgo(algo) {}

~CEMAlgo()

virtual STK::CEMAlgo::~CEMAlgo ( )

inlinevirtual

destructor

Definition at line 89 of file STK_MixtureAlgo.h.

{}

Member Function Documentation

clone()

virtual CEMAlgo * STK::CEMAlgo::clone ( ) const

inlinevirtual

clone pattern

Definition at line 91 of file STK_MixtureAlgo.h.

{ return new CEMAlgo(*this);}

References CEMAlgo().

run()

bool STK::CEMAlgo::run ( )

virtual

run the algorithm on the model calling cStep, mStep and eStep of the model until the maximal number of iteration is reached or the variation of the lnLikelihood is less than epsilon.

Returns

true if no error occur, false otherwise

Implements STK::IRunnerBase.

Definition at line 44 of file STK_MixtureAlgo.cpp.

{
#ifdef STK_MIXTURE_VERY_VERBOSE
  stk_cout << _T("Entering CEMAlgo::run() with:\n")
           << _T("nbIterMax_ = ") << nbIterMax_
           << _T(", epsilon_ = ") << epsilon_ << _T("\n");
#endif
  try
  {
    Real currentLnLikelihood =  p_model_->lnLikelihood();
    int iter;
    for (iter = 0; iter < nbIterMax_; iter++)
    {
      if (p_model_->cStep()<threshold_)
      {
        msg_error_ = STKERROR_NO_ARG(CEMAlgo::run,No more individuals after cStep\n);
#ifdef STK_MIXTURE_VERBOSE
  stk_cout << _T("An error occur in CEMAlgo::run():\n") << msg_error_ << _T("\n");
#endif
        return false;
      }
      p_model_->imputationStep();
      p_model_->pStep();
      p_model_->paramUpdateStep();
      Real nb = p_model_->eStep();
      if (nb<threshold_)
      {
        msg_error_ = STKERROR_1ARG(CEMAlgo::run,nb,Not enough individuals after eStep\n);
#ifdef STK_MIXTURE_VERBOSE
        stk_cout << _T("An error occur in CEMAlgo::run():\n") << msg_error_ << _T("\n");
#endif
        return false;
      }
      Real lnLikelihood = p_model_->lnLikelihood();
      if (std::abs(lnLikelihood - currentLnLikelihood) < epsilon_)
      {
#ifdef STK_MIXTURE_VERY_VERBOSE
        stk_cout << _T("Terminating CEMAlgo::run() with:\n")
                 << _T("iter = ") << iter << _T("\n")
                 << _T("delta = ") << lnLikelihood - currentLnLikelihood << _T("\n");
#endif
        break;
      }
      currentLnLikelihood = lnLikelihood;
    }
#ifdef STK_MIXTURE_VERBOSE
    stk_cout << _T("In EMAlgo::run() iteration ") << iter << _T("terminated.\n")
             << _T("p_model_->lnLikelihood = ") << p_model_->lnLikelihood() << _T("\n");
#endif
  }
  catch (Clust::exceptions const& error)
  {
    msg_error_ = Clust::exceptionToString(error);
#ifdef STK_MIXTURE_VERBOSE
    stk_cout << _T("An error occur in CEMAlgo::run():\n") << msg_error_ << _T("\n");
#endif
    return false;
  }
  return true;
}

References _T, STK::IMixtureComposer::cStep(), STK::IMixtureAlgo::epsilon_, STK::IRunnerBase::error(), STK::IMixtureComposer::eStep(), STK::Clust::exceptionToString(), STK::IMixtureStatModel::imputationStep(), STK::IStatModelBase::lnLikelihood(), STK::IRunnerBase::msg_error_, STK::IMixtureAlgo::nbIterMax_, STK::IMixtureAlgo::p_model_, STK::IMixtureComposer::paramUpdateStep(), STK::IMixtureComposer::pStep(), run(), stk_cout, STKERROR_1ARG, STKERROR_NO_ARG, and STK::IMixtureAlgo::threshold_.

Referenced by run().

---

The documentation for this class was generated from the following files:

• STK_MixtureAlgo.h
• STK_MixtureAlgo.cpp