[68172a] | 1 | /*
|
---|
| 2 | * Project: MoleCuilder
|
---|
| 3 | * Description: creates and alters molecular systems
|
---|
| 4 | * Copyright (C) 2012 University of Bonn. All rights reserved.
|
---|
| 5 | * Please see the COPYING file or "Copyright notice" in builder.cpp for details.
|
---|
| 6 | *
|
---|
| 7 | *
|
---|
| 8 | * This file is part of MoleCuilder.
|
---|
| 9 | *
|
---|
| 10 | * MoleCuilder is free software: you can redistribute it and/or modify
|
---|
| 11 | * it under the terms of the GNU General Public License as published by
|
---|
| 12 | * the Free Software Foundation, either version 2 of the License, or
|
---|
| 13 | * (at your option) any later version.
|
---|
| 14 | *
|
---|
| 15 | * MoleCuilder is distributed in the hope that it will be useful,
|
---|
| 16 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 18 | * GNU General Public License for more details.
|
---|
| 19 | *
|
---|
| 20 | * You should have received a copy of the GNU General Public License
|
---|
| 21 | * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 22 | */
|
---|
| 23 |
|
---|
| 24 | /*
|
---|
| 25 | * TrainingData.cpp
|
---|
| 26 | *
|
---|
| 27 | * Created on: 15.10.2012
|
---|
| 28 | * Author: heber
|
---|
| 29 | */
|
---|
| 30 |
|
---|
| 31 | // include config.h
|
---|
| 32 | #ifdef HAVE_CONFIG_H
|
---|
| 33 | #include <config.h>
|
---|
| 34 | #endif
|
---|
| 35 |
|
---|
| 36 | #include "CodePatterns/MemDebug.hpp"
|
---|
| 37 |
|
---|
| 38 | #include "TrainingData.hpp"
|
---|
| 39 |
|
---|
[04cc7e] | 40 | #include <boost/bind.hpp>
|
---|
[68172a] | 41 | #include <iostream>
|
---|
| 42 |
|
---|
[04cc7e] | 43 | #include "CodePatterns/Assert.hpp"
|
---|
[68172a] | 44 | #include "CodePatterns/toString.hpp"
|
---|
| 45 |
|
---|
| 46 | #include "Fragmentation/SetValues/Fragment.hpp"
|
---|
| 47 | #include "FunctionApproximation/FunctionModel.hpp"
|
---|
| 48 |
|
---|
| 49 | void TrainingData::operator()(const range_t &range) {
|
---|
| 50 | for (HomologyContainer::const_iterator iter = range.first; iter != range.second; ++iter) {
|
---|
| 51 | // get distance out of Fragment
|
---|
| 52 | const Fragment &fragment = iter->second.first;
|
---|
| 53 | FunctionModel::arguments_t args = extractor(
|
---|
| 54 | fragment,
|
---|
| 55 | DistanceVector.size()
|
---|
| 56 | );
|
---|
| 57 | DistanceVector.push_back( args );
|
---|
| 58 | const double &energy = iter->second.second;
|
---|
| 59 | EnergyVector.push_back( FunctionModel::results_t(1, energy) );
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | const double TrainingData::getL2Error(const FunctionModel &model) const
|
---|
| 64 | {
|
---|
| 65 | double L2sum = 0.;
|
---|
| 66 |
|
---|
| 67 | FunctionApproximation::inputs_t::const_iterator initer = DistanceVector.begin();
|
---|
| 68 | FunctionApproximation::outputs_t::const_iterator outiter = EnergyVector.begin();
|
---|
| 69 | for (; initer != DistanceVector.end(); ++initer, ++outiter) {
|
---|
| 70 | const FunctionModel::results_t result = model((*initer));
|
---|
| 71 | const double temp = fabs((*outiter)[0] - result[0]);
|
---|
| 72 | L2sum += temp*temp;
|
---|
| 73 | }
|
---|
| 74 | return L2sum;
|
---|
| 75 | }
|
---|
| 76 |
|
---|
| 77 | const double TrainingData::getLMaxError(const FunctionModel &model) const
|
---|
| 78 | {
|
---|
| 79 | double Lmax = 0.;
|
---|
| 80 | size_t maxindex = -1;
|
---|
| 81 | FunctionApproximation::inputs_t::const_iterator initer = DistanceVector.begin();
|
---|
| 82 | FunctionApproximation::outputs_t::const_iterator outiter = EnergyVector.begin();
|
---|
| 83 | for (; initer != DistanceVector.end(); ++initer, ++outiter) {
|
---|
| 84 | const FunctionModel::results_t result = model((*initer));
|
---|
| 85 | const double temp = fabs((*outiter)[0] - result[0]);
|
---|
| 86 | if (temp > Lmax) {
|
---|
| 87 | Lmax = temp;
|
---|
| 88 | maxindex = std::distance(
|
---|
| 89 | const_cast<const FunctionApproximation::inputs_t &>(DistanceVector).begin(),
|
---|
| 90 | initer
|
---|
| 91 | );
|
---|
| 92 | }
|
---|
| 93 | }
|
---|
| 94 | return Lmax;
|
---|
| 95 | }
|
---|
| 96 |
|
---|
[04cc7e] | 97 | const TrainingData::DistanceEnergyTable_t TrainingData::getDistanceEnergyTable() const
|
---|
| 98 | {
|
---|
| 99 | TrainingData::DistanceEnergyTable_t table;
|
---|
| 100 | const InputVector_t &DistanceVector = getTrainingInputs();
|
---|
| 101 | const OutputVector_t &EnergyVector = getTrainingOutputs();
|
---|
| 102 |
|
---|
| 103 | /// extract distance member variable from argument_t and first value from results_t
|
---|
| 104 | OutputVector_t::const_iterator ergiter = EnergyVector.begin();
|
---|
| 105 | for (InputVector_t::const_iterator iter = DistanceVector.begin();
|
---|
| 106 | iter != DistanceVector.end(); ++iter, ++ergiter) {
|
---|
| 107 | ASSERT( ergiter != EnergyVector.end(),
|
---|
| 108 | "TrainingData::getDistanceEnergyTable() - less output than input values.");
|
---|
| 109 | std::vector< double > values(iter->size(), 0.);
|
---|
| 110 | // transform all distances
|
---|
| 111 | const FunctionModel::arguments_t &args = *iter;
|
---|
| 112 | std::transform(
|
---|
| 113 | args.begin(), args.end(),
|
---|
| 114 | values.begin(),
|
---|
| 115 | boost::bind(&argument_t::distance, _1));
|
---|
| 116 |
|
---|
| 117 | // get first energy value
|
---|
| 118 | values.push_back((*ergiter)[0]);
|
---|
| 119 |
|
---|
| 120 | // push as table row
|
---|
| 121 | table.push_back(values);
|
---|
| 122 | }
|
---|
| 123 |
|
---|
| 124 | return table;
|
---|
| 125 | }
|
---|
| 126 |
|
---|
[68172a] | 127 | std::ostream &operator<<(std::ostream &out, const TrainingData &data)
|
---|
| 128 | {
|
---|
| 129 | const TrainingData::InputVector_t &DistanceVector = data.getTrainingInputs();
|
---|
| 130 | const TrainingData::OutputVector_t &EnergyVector = data.getTrainingOutputs();
|
---|
| 131 | out << "(" << DistanceVector.size()
|
---|
| 132 | << "," << EnergyVector.size() << ") data pairs: " << std::endl;
|
---|
| 133 | FunctionApproximation::inputs_t::const_iterator initer = DistanceVector.begin();
|
---|
| 134 | FunctionApproximation::outputs_t::const_iterator outiter = EnergyVector.begin();
|
---|
| 135 | for (; initer != DistanceVector.end(); ++initer, ++outiter) {
|
---|
| 136 | for (size_t index = 0; index < (*initer).size(); ++index)
|
---|
| 137 | out << "(" << (*initer)[index].indices.first << "," << (*initer)[index].indices.second
|
---|
| 138 | << ") " << (*initer)[index].distance;
|
---|
| 139 | out << " with energy ";
|
---|
| 140 | out << (*outiter);
|
---|
| 141 | out << std::endl;
|
---|
| 142 | }
|
---|
| 143 | return out;
|
---|
| 144 | }
|
---|