UCItranslator-val.cc

Go to the documentation of this file.

/*

Copyright (c) 2003, Cornell University
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

   - Redistributions of source code must retain the above copyright notice,
       this list of conditions and the following disclaimer.
   - Redistributions in binary form must reproduce the above copyright
       notice, this list of conditions and the following disclaimer in the
       documentation and/or other materials provided with the distribution.
   - Neither the name of Cornell University nor the names of its
       contributors may be used to endorse or promote products derived from
       this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.

*/

#include <string>
#include <vector>
#include <list>
#include <iostream>
#include <fstream>
#include <string.h>
#include <time.h>

using namespace std;

struct elemList
{
    vector<int> disc;
    vector<double> cont;

    elemList(vector<int>& Disc, vector<double>& Cont):
            disc(Disc), cont(Cont)
    { }
}
;


int main(int argc, char** argv)
{
    // what percent of the data to give to train, prune, and test sets.
    double trainFrac = .5;
    double pruneFrac =.25;

    if (argc<3 || argc>5)
    {
        cerr << "Usage: UCItranslator description(c=continouous, d=discrete) valC0 [trainFrac pruneFrac] " << endl;
        return 1;
    }

    /* valC0 has to be from 0 up. When is out of range,
       1 is returned so that the script that is calling 
       UCItranslator-val does not have to know about the 
       maximum value admissible */

    srandom(time(0));

    char description[256];
    strcpy(description,argv[1]);
    int valC0=atoi(argv[2]);

    if (argc>=4)
        trainFrac=atof(argv[3]);
    if (argc>=5)
        pruneFrac=atof(argv[4]);

    int noVars = strlen(description);
    // nuber of variables
    int noDiscrete;
    int noContinuous;
    int noLines=0;

    list<elemList*> Repository;

    /* If variable is discrete or classLabel build the dictionary
       on the fly 
    */

    noDiscrete=0;
    noContinuous=0;
    for (int i=0; i<noVars; i++)
    {
        switch (description[i])
        {
        case 'c':
            noContinuous++;
            break;

        case 'd':
        case 's':
        case 'n':
            noDiscrete++;
            break;

        default:
            cerr << "Wrong decription" << endl;
            return 1;
        }
    }

    // for discrete variables keep a dictionary
    vector< list<string> > Dictionary(noDiscrete);
    vector< int > sizeDiscrete(noDiscrete); // for substraction variables

    // data/tuple
    vector< int > discreteData(noDiscrete);
    vector< double > continuousData(noContinuous);


    while (!cin.eof())
    {
        noLines++;

        // parse the line
        int curr_cont=0;
        int curr_disc=0;

        char c;
        // skip separators
        while ( (c=cin.get())==' ' || c=='\t' || c=='\n' || c==',')
        { }
        cin.putback(c);

        for (int i=0; i<noDiscrete+noContinuous; i++)
        {
            char buffer[10000];
            int pos=0;

            while ( (c=cin.get())!=' ' && c!='\t' && c!='\n' && c!=',' && !cin.eof())
                buffer[pos++]=c;
            buffer[pos]=0;
            if (cin.eof())
                goto EOFencountered;
            cin.putback(c);

            // skip separators
            while ( (c=cin.get())==' ' || c=='\t' || c=='\n' || c==',')
            { }
            cin.putback(c);
            if (cin.eof())
                goto EOFencountered;


            string token(buffer);

            if (cin.eof())
                goto EOFencountered;

            switch (description[i])
            {
            case 'c':
                {
                    double value=atof(token.c_str());
                    continuousData[curr_cont]=value;

                    curr_cont++;
                }
                break;

            case 'd':
                {
                    // discrete data. Look token in Dictionary. If not there insert it
                    int c_pos=0;
                    discreteData[curr_disc]=-1;
                    list<string>& dict = Dictionary[curr_disc];
                    list<string>::iterator itrt;
                    for (itrt=dict.begin();
                            itrt!=dict.end(); itrt++)
                    {
                        string entry=*itrt;
                        if (entry==token)
                        {
                            discreteData[curr_disc]=c_pos;
                            break;
                        }
                        c_pos++;
                    }

                    if (discreteData[curr_disc]==-1)
                    {
                        dict.push_back(token);
                        discreteData[curr_disc]=c_pos;
                        sizeDiscrete[curr_disc]++;
                    }

                    curr_disc++;
                }
                break;

            case 's':
                {
                    // discrete but already between 1 and n; just substract -1
                    int value=atoi(token.c_str())-1;
                    discreteData[curr_disc]=value;

                    if (sizeDiscrete[curr_disc]<value+1)
                        sizeDiscrete[curr_disc]=value+1;

                    curr_disc++;
                }
                break;

            case 'n':
                {
                    // discrete but already between 1 and n; just substract -1
                    int value=atoi(token.c_str());
                    discreteData[curr_disc]=value;

                    if (sizeDiscrete[curr_disc]<value+1)
                        sizeDiscrete[curr_disc]=value+1;

                    curr_disc++;
                }

            }
        }

        assert(curr_disc+curr_cont==noDiscrete+noContinuous);

        elemList* elp = new elemList(discreteData, continuousData);
        Repository.push_back(elp );
    }

EOFencountered:

    // Check if valC0 is within limits
    if (valC0<0 || valC0>=(int)Dictionary[noDiscrete-1].size())
        return 1;

    int trainLines=0;
    int pruneLines=0;
    int testLines=0;

    vector<int> whichSet(noLines);
    // decide whether each line will be put in training, test, or pruning file.
    for (int i=0; i < noLines; i++)
    {
        double d =1.0*rand()/RAND_MAX;
        if (d<trainFrac)
        {
            whichSet[i] = 0;
            trainLines++;
        }
        else if (d < trainFrac+pruneFrac)
        {
            whichSet[i]=1;
            pruneLines++;
        }
        else
        {
            whichSet[i]=2;
            testLines++;
        }
    }

    ofstream trainFile("trainset");
    ofstream pruneFile("pruneset");
    ofstream testFile("testset");
    ofstream trainQuest("trainset-quest");
    ofstream testQuest("testset-quest");
    ofstream pruneQuest("pruneset-quest");

    // put headers on each of the files

    trainFile << "# " << trainLines << " " << noDiscrete << " " << noContinuous << endl;

    if (noDiscrete>0)
    {
        trainFile << "# " ;
        for (int i=0; i<noDiscrete-1; i++)
            trainFile << sizeDiscrete[i] << " ";
        trainFile << 2 << endl;
    }

    pruneFile << "# " << pruneLines << " " << noDiscrete << " " << noContinuous << endl;
    if (noDiscrete>0)
    {
        pruneFile << "# " ;
        for (int i=0; i<noDiscrete-1; i++)
            pruneFile << sizeDiscrete[i] << " ";
        pruneFile << 2 << endl;
    }

    testFile << "# " << testLines << " " << noDiscrete << " " << noContinuous << endl;
    if (noDiscrete>0)
    {
        testFile << "# " ;
        for (int i=0; i<noDiscrete-1; i++)
            testFile << sizeDiscrete[i] << " ";
        testFile << 2 << endl;
    }

    //int n = (int)Dictionary[noDiscrete-1].size();
    //int threshold = rand()%( n>2 ? n-1 : 2);

    int cLine=0;
    list<elemList*>::iterator itrt;
    for (itrt=Repository.begin();
            itrt!=Repository.end(); itrt++)
    {
        elemList& eL = *(*itrt);
        vector<int> discreteData = eL.disc;
        vector<double> continuousData = eL.cont;

        if (discreteData[noDiscrete-1] == valC0)
            discreteData[noDiscrete-1] = 0;
        else
            discreteData[noDiscrete-1]=1;

        if (whichSet[cLine]==0)
        {
            for (int i=0; i<noDiscrete; i++)
                trainFile << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                trainFile << continuousData[i] << " ";

            trainFile << endl;


            for (int i=0; i<noDiscrete; i++)
                trainQuest << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                trainQuest << continuousData[i] << " ";

            trainQuest << 1 << endl;

        }
        else if (whichSet[cLine]==1)
        {
            for (int i=0; i<noDiscrete; i++)
                pruneFile << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                pruneFile << continuousData[i] << " ";

            pruneFile << endl;

            for (int i=0; i<noDiscrete; i++)
                pruneQuest << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                pruneQuest << continuousData[i] << " ";

            pruneQuest << 1 << endl;

        }
        else
        { // testing; format last discrete variable is the class label; put it last
            for (int i=0; i<noDiscrete-1; i++)
                testFile << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                testFile << continuousData[i] << " ";

            testFile << discreteData[noDiscrete-1];
            testFile << endl;

            for (int i=0; i<noDiscrete; i++)
                testQuest << discreteData[i] << " ";

            for (int i=0; i<noContinuous; i++)
                testQuest << continuousData[i] << " ";

            testQuest << 0 << endl;

        }

        cLine++;
    }

    return 0;
}

---