BatchLearning.h

#ifndef BatchLearning_H
#define BatchLearning_H


#include "LearningAlgorithm.h"
#include "util.h"
#include "TopolParams.h"


class BatchLearning : public LearningAlgorithm {

/*
Q_OBJECT

signals:
        void valueChanged(int);
*/

public:
    BatchLearning(const TopolParams& s):LearningAlgorithm(s) {};

        int Learning ( NetParams& net );
        
        const char* className(); //dev-cpp implementation

};


int 
BatchLearning::Learning ( NetParams& net ) {

        int i, k, j, i1, i2, bmu, t;
        Value_Type h, r, htot;  
        Value_Type      d                       = net.getData()->getDimension(); 
        int             m                               = net.getMapcode()->getMapSize();
        int             n                               = net.getData()->getDataSize(); 
        int             dimension               = net.getMapcode()->getDimension();
        int             lattice                 = net.getMapcode()->getLattice();
        int*    dimensions              = net.getMapcode()->getDimensions();
        int             num_iterations  = net.getNumIterations();
        int             neighboor               = net.getMapcode()->getNeighborType();
        TMatrix entries                 = net.getData()->getEntries();
        SOMData * data                  = net.getData();
        TMatrix delta                   = net.getDelta();

        TMatrix codebook                = net.getMapcode()->getCodebook();
        TVector vn                              = create_vector(1, m);
        TMatrix S                               = create_matrix( 1, m, 1, (int)d ); //warning           
        Mapcode * mapcode               = net.getMapcode();
        
        TBMU  * tmp_bmu = new TBMU;                     
        
        

        r = net.getInitNeighbor();      
        
        for (t=1; t<= num_iterations; t++ ) {
                setActualIteraction( t );
                //emit valueChanged( t );
                
                tmp_bmu = MakeBMU( data, mapcode );
                                
                // initiate the voronoi vector and the SumData variables
                for (i=1; i<= m; i++) { vn[i] = 0; for (k=1; k<=d; k++) S[i][k] = 0.0;}
                
                for (j=1; j<= n; j++ ) {        
                        bmu = tmp_bmu[0][j-1][0].i;                             
                        vn[bmu]++;      
                        for (k=1; k<=d; k++) S[bmu][k] += entries[j][k]; 
                };
                                
                // fill mapcode with zeros
                for (i=1; i<=m; i++) for (k=1; k<=d; k++) codebook[i][k] = 0.0;

                
                for (i1=1; i1<=m; i1++) {
                        htot = 0;       
                        for (i2=1; i2 <= m; i2++ ) {                                                            
                                h = getTopology()->H( delta[i1][i2], r, neighboor ); 
                                for ( k=1; k<=d; k++) codebook[i1][k] += h*S[i2][k]; 
                                htot += h*vn[i2];       
                        }       
                        for (k=1; k<= d; k++) 
                                if (htot != 0 ) codebook[i1][k] /= htot; 
                }               
                mapcode->setCodebook( codebook );
                r = radius( r, num_iterations, t);                              
        }
        net.getMapcode()->setCodebook( codebook );

        free_vector( vn, 1, m );
        free_matrix( S, 1, m, 1, (int)d );
        return 0;
        
};

#endif

---