VMField.cc

Go to the documentation of this file.

// -*- C++ -*-

// PLearn (A C++ Machine Learning Library)
// Copyright (C) 1998 Pascal Vincent
// Copyright (C) 1999-2002 Pascal Vincent, Yoshua Bengio and University of Montreal
//

// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// 
//  1. Redistributions of source code must retain the above copyright
//     notice, this list of conditions and the following disclaimer.
// 
//  2. 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.
// 
//  3. The name of the authors may not be used to endorse or promote
//     products derived from this software without specific prior written
//     permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``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 AUTHORS 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.
// 
// This file is part of the PLearn library. For more information on the PLearn
// library, go to the PLearn Web site at www.plearn.org


 
/*
* $Id: VMField.cc,v 1.3 2004/02/20 21:14:44 chrish42 Exp $
* This file is part of the PLearn library.
******************************************************* */
#include "VMField.h"

namespace PLearn {
using namespace std;

VMField::VMField(const string& the_name, FieldType the_fieldtype)
  : name(the_name), fieldtype(the_fieldtype) {}

/*
void VMField::print(ostream& out) const
{
  out << name << "\t type: ";
  switch(fieldtype)
    {
      case VMField::UnknownType:
        out << "UnknownType\n";
        break;
      case VMField::Continuous:
        out << "Continuous\n";
        break;
      case VMField::DiscrGeneral:
        out << "DiscrGeneral\n";
        break;
      case VMField::DiscrMonotonic:
        out << "DiscrMonotonic\n";
        break;
      case VMField::DiscrFloat:
        out << "DiscrFloat\n";
        break;
      case VMField::Date:
        out << "Date\n";
        break;
      default:
        PLERROR("Can't write name of type");
    }  //writeField(out,"fieldtype", fieldtype);
}

void VMField::write(ostream& out) const
{
  writeHeader(out,"VMField");
  writeField(out,"name", name);
  //writeField(out,"fieldtype", fieldtype);
  //out << "fieldtype: " << fieldtype << endl;
  writeFooter(out,"VMField");
}

void VMField::read(istream& in)
{
  readHeader(in,"VMField");
  readField(in,"name", name);
  //readField(in,"fieldtype", fieldtype);
  readFooter(in,"VMField");
}
*/

VMFieldStat::VMFieldStat(int the_maxndiscrete)
  : nmissing_(0), nnonmissing_(0), npositive_(0), nnegative_(0), sum_(0.),
  sumsquare_(0.), min_(FLT_MAX), max_(-FLT_MAX),
  maxndiscrete(the_maxndiscrete) {}

void VMFieldStat::update(real val)
{
  if(is_missing(val))
    nmissing_++;
  else
  {
    nnonmissing_++;
    sum_ += val;
    sumsquare_ += val*val;
    if(val>0.)
      npositive_++;
    else if(val<0.)
      nnegative_++;
    if(val<min_)
      min_ = val;
    if(val>max_)
      max_ = val;
    if(maxndiscrete>0)
    {
      if(int(counts.size())<maxndiscrete)
        counts[val]++;
      else // reached maxndiscrete. Stop counting and reset counts.
      {
        maxndiscrete = -1;
        counts.clear();
      }
    }          
  }
}                           

void VMFieldStat::write(ostream& out) const
{
  out << nmissing_ << ' ' 
    << nnonmissing_ << ' '
    << npositive_ << ' '
    << nnegative_ << ' '
    << sum_ << ' '
    << sumsquare_ << ' '
    << min_ << ' '
    << max_ << "    ";

  out << counts.size() << "  ";

  map<real,int>::const_iterator it = counts.begin();
  map<real,int>::const_iterator countsend = counts.end();
  while(it!=countsend)
  {
    out << it->first << ' ' << it->second << "  "; 
    ++it;
  }
}

void VMFieldStat::read(istream& in)
{
  in >> nmissing_ >> nnonmissing_ >> npositive_ >> nnegative_ 
    >> sum_ >> sumsquare_ >> min_ >> max_ ;
  
  int ndiscrete;
  real value;
  int count;
  counts.clear();
  in >> ndiscrete;
  for(int k=0; k<ndiscrete; k++)
  {
    in >> value >> count;
    counts[value] = count;
  }
}

} // end of namespace PLearn

---