|| || || || || ||

---

TrainDataSrcKernelMatrix.h

Go to the documentation of this file.

#ifndef Impala_Core_Training_TrainDataSrcKernelMatrix_h
#define Impala_Core_Training_TrainDataSrcKernelMatrix_h

#include "Core/Training/TrainDataSrc.h"
#include "Core/Table/AnnotationTable.h"
#include "Link/Svm/LinkSvm.h"

namespace Impala
{
namespace Core
{
namespace Training
{


class TrainDataSrcKernelMatrix : public TrainDataSrc
{
public:
    TrainDataSrcKernelMatrix(Matrix::Mat* kernelMatrix)
        : TrainDataSrc(0)
    {
        mMatrix = kernelMatrix;
    }

    virtual ~TrainDataSrcKernelMatrix()
    {
    }

    virtual svm_problem* MakeSvmProblem()
    {
        return MakeProblem(0, mMatrix->CW());
    }

    virtual svm_problem* MakeSvmProblem(int i)
    {
        if(i >= mMatrix->CH())
        {
            ILOG_WARNING("MakeSvmProblem(int) : index out of range");
            return MakeEmptyProblem();
        }
        svm_problem* p = MakeProblem(i, i+1);
        return p;
    }
    virtual int GetVectorLength()
    {
        return 1;
    }

    virtual int
    Size()
    {
        ILOG_DEBUG("correct Size called");
        return mMatrix->CH();
    }

    virtual Quid
    GetQuid(int i)
    {
        ILOG_DEBUG("correct GetQuid called, but a matrix doesn't have quids");
        return 0;
    }


private:
    Matrix::Mat* mMatrix;

    svm_problem* MakeProblem(int start, int end)
    {
        ILOG_VAR(Core.Training.Svm.KernelSvmProblem);
        int vectorLength = mMatrix->CW();
        svm_problem* problem = new svm_problem;
        problem->l = end - start;
        problem->y = new double[problem->l];
        problem->x = new struct svm_node *[problem->l];
        struct svm_node* nodes = new struct svm_node[problem->l*(2+vectorLength)];
        for(int i=0 ; i<problem->l ; i++)
        {
            problem->y[i] = 0;
            problem->x[i] = &nodes[i*(vectorLength+2)];
            problem->x[i][0].index = 0;
            problem->x[i][0].value = 0; // empty column expected by libsvm
            const double* values = mMatrix->CPB(0, start+i);
            int j;
            for(j=0 ; j<vectorLength ; j++)
            {
                problem->x[i][j+1].index = j+1;
                problem->x[i][j+1].value = values[j];
            }
            problem->x[i][j+1].index = -1;
        }
        return problem;
    }
};

}//namespace Core
}//namespace Training
}//namespace Impala


#endif

---