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

---

RandomTreeTable.h

Go to the documentation of this file.

#ifndef Impala_Core_Feature_RandomTreeTable_h
#define Impala_Core_Feature_RandomTreeTable_h

#include "Core/Column/Types.h"
#include "Core/Vector/Types.h"
#include "Core/Table/TableTem.h"
#include "Core/Feature/FeatureTable.h"

namespace Impala
{
namespace Core
{
namespace Feature
{

// We can store a number of random trees in a RandomTreeTable for disk i/o.
typedef Table::TableTem<Column::ColumnInt32,
                        Column::ColumnInt32,
                        Column::ColumnReal64> RandomTreeTable;

const Quid cInvalidCodeWord = 0x8000000000000000LL;
    
RandomTreeTable*
MakeRandomTreeTable(FeatureTable* ft)
{
    RandomTreeTable* rtt = new RandomTreeTable(ft->Size());
    for(int i=0 ; i<ft->Size() ; ++i)
    {
        Quid q = ft->Get1(i);
        const Vector::VectorReal64& v = ft->Get2(i);
        double dimension = v[0];
        double treshold = v[1];
        rtt->Add((q == cInvalidCodeWord) ? -1 : q, dimension, treshold);
    }
    return rtt;
}

FeatureTable*
MakeFeatureTable(RandomTreeTable* rtt)
{
    FeatureDefinition fdef("ceci_nest_pas_un_feature_table_its_a_random-forest");
    FeatureTable* ft = new FeatureTable(fdef, rtt->Size(), 2);
    for(int i=0 ; i<rtt->Size() ; ++i)
    {
        int codeword = rtt->Get1(i);
        Vector::VectorReal64 v(2);
        v[0] = rtt->Get2(i);
        v[1] = rtt->Get3(i);
        ft->Add((codeword == -1) ? cInvalidCodeWord : codeword, v);
    }
    return ft;
}    

} // namespace Koen
} // namespace Sandbox
} // namespace Impala

#endif

---