source: trunk/yat/classifier/DataLookup1D.cc @ 820

Last change on this file since 820 was 820, checked in by Peter, 15 years ago

Changed name again. ROCScore is now called AUC. Also fixed several bugs and added test for these.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date ID
File size: 3.2 KB
Line 
1// $Id$
2
3/*
4  Copyright (C) The authors contributing to this file.
5
6  This file is part of the yat library, http://lev.thep.lu.se/trac/yat
7
8  The yat library is free software; you can redistribute it and/or
9  modify it under the terms of the GNU General Public License as
10  published by the Free Software Foundation; either version 2 of the
11  License, or (at your option) any later version.
12
13  The yat library is distributed in the hope that it will be useful,
14  but WITHOUT ANY WARRANTY; without even the implied warranty of
15  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16  General Public License for more details.
17
18  You should have received a copy of the GNU General Public License
19  along with this program; if not, write to the Free Software
20  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
21  02111-1307, USA.
22*/
23
24#include "DataLookup1D.h"
25#include "DataLookup2D.h"
26#include "MatrixLookup.h"
27
28#include "yat/utility/matrix.h"
29#include "yat/utility/vector.h"
30
31#include <cassert>
32#include <iostream>
33#include <iomanip>
34
35namespace theplu {
36namespace yat {
37namespace classifier {
38
39  DataLookup1D::DataLookup1D(const DataLookup2D& m, const size_t i, 
40                             const bool row_vector)
41    : column_vector_(!row_vector), index_(i), matrix_(&m), owner_(false)
42  {
43    assert( !column_vector_ || i<m.columns());
44    assert( column_vector_ || i<m.rows());
45  }
46 
47
48  DataLookup1D::DataLookup1D(const size_t size, const double value)
49    : column_vector_(false), index_(0), owner_(true)
50  {
51    matrix_ = new MatrixLookup(1,size,value);
52  }
53
54
55  DataLookup1D::DataLookup1D(const DataLookup1D& other)
56    : column_vector_(other.column_vector_), index_(other.index_),
57      matrix_(other.matrix_), owner_(false)
58  {
59  }
60
61
62  DataLookup1D::DataLookup1D(const utility::vector& v, 
63                             const std::vector<size_t>& index)
64    : column_vector_(true), index_(0), owner_(true)
65  {
66    utility::matrix* m = new utility::matrix(1,index.size());
67    for (size_t i=0; i<index.size(); ++i){
68      assert(index[i]<v.size());
69      (*m)(0,i)=v(index[i]);
70    }
71    matrix_ = new MatrixLookup(*m, true);
72  }
73
74
75  DataLookup1D::DataLookup1D(const utility::vector& v)
76    : column_vector_(false), index_(0), owner_(true)
77  {
78    utility::matrix* m = new utility::matrix(1,v.size());
79    for (size_t i=0; i<v.size(); ++i){
80      (*m)(0,i)=v(i);
81    }
82    matrix_ = new MatrixLookup(*m, true);
83  }
84
85
86  DataLookup1D::~DataLookup1D()
87  {
88    if (owner_)
89      delete matrix_;
90  }
91
92
93  size_t DataLookup1D::size(void) const
94  {
95    return column_vector_ ? matrix_->rows() : matrix_->columns();
96  }
97
98
99  double DataLookup1D::operator()(const size_t i) const
100  { 
101    assert(i<size());
102    return column_vector_ ? (*matrix_)(i,index_) : (*matrix_)(index_,i);
103  }
104
105
106  double DataLookup1D::operator[](const size_t i) const
107  { 
108    return this->operator()(i);
109  }
110
111
112  double DataLookup1D::operator*(const DataLookup1D& other) const
113  {
114    assert(other.size()==size());
115    double res=0;
116    for (size_t i = 0; i<size(); i++)
117      res += (*this)(i)*other(i);
118    return res;
119  }
120
121
122  std::ostream& operator<<(std::ostream& os, const DataLookup1D& x)
123  {
124    os.setf(std::ios::dec);
125    os.precision(12);
126   
127    for (size_t i=0; i<x.size(); ++i) {
128      os << x(i);
129      if ((i+1)<x.size())
130        os << os.fill();
131    }
132    return os;
133  }
134
135}}} // of namespace classifier, yat, and theplu
Note: See TracBrowser for help on using the repository browser.