/* * Open BEAGLE * Copyright (C) 2001-2005 by Christian Gagne and Marc Parizeau * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * Contact: * Laboratoire de Vision et Systemes Numeriques * Departement de genie electrique et de genie informatique * Universite Laval, Quebec, Canada, G1K 7P4 * http://vision.gel.ulaval.ca * */ /*! * \file beagle/GP/src/StatsCalcFitnessSimpleOp.cpp * \brief Source code of class GP::StatsCalcFitnessSimpleOp. * \author Christian Gagne * \author Marc Parizeau * $Revision: 1.7 $ * $Date: 2005/10/04 16:25:10 $ */ #include "beagle/GP.hpp" #include #include using namespace Beagle; /*! * \brief Construct a calculate stats operator. * \param inName Name of the operator. */ GP::StatsCalcFitnessSimpleOp::StatsCalcFitnessSimpleOp(Beagle::string inName) : Beagle::StatsCalcFitnessSimpleOp(inName) { } /*! * \brief Calculate statistics of a given GP deme. * \param outStats Evaluated statistics. * \param ioDeme Deme to evalute the statistics. * \param ioContext Context of the evolution. */ void GP::StatsCalcFitnessSimpleOp::calculateStatsDeme(Beagle::Stats& outStats, Beagle::Deme& ioDeme, Beagle::Context& ioContext) const { Beagle_StackTraceBeginM(); outStats.clear(); outStats.clearItems(); outStats.addItem("processed", ioContext.getProcessedDeme()); outStats.addItem("total-processed", ioContext.getTotalProcessedDeme()); if(ioDeme.size() == 0) { outStats.setGenerationValues(string("deme")+uint2str(ioContext.getDemeIndex()+1), ioContext.getGeneration(), 0, true); outStats.resize(3); outStats[0].mId = "fitness"; outStats[0].mAvg = 0.0; outStats[0].mStd = 0.0; outStats[0].mMax = 0.0; outStats[0].mMin = 0.0; outStats[1].mId = "treedepth"; outStats[1].mAvg = 0.0; outStats[1].mStd = 0.0; outStats[1].mMax = 0.0; outStats[1].mMin = 0.0; outStats[2].mId = "treesize"; outStats[2].mAvg = 0.0; outStats[2].mStd = 0.0; outStats[2].mMax = 0.0; outStats[2].mMin = 0.0; return; } const GP::Deme& lGPDeme = castObjectT(ioDeme); const FitnessSimple::Handle lFirstIndivFitness = castHandleT(ioDeme[0]->getFitness()); if(ioDeme.size() == 1) { outStats.setGenerationValues(string("deme")+uint2str(ioContext.getDemeIndex()+1), ioContext.getGeneration(), 1, true); outStats.resize(3); outStats[0].mId = "fitness"; outStats[0].mAvg = lFirstIndivFitness->getValue(); outStats[0].mStd = 0.0; outStats[0].mMax = lFirstIndivFitness->getValue(); outStats[0].mMin = lFirstIndivFitness->getValue(); outStats[1].mId = "treedepth"; outStats[1].mAvg = lGPDeme[0]->getMaxTreeDepth(); outStats[1].mStd = 0.0; outStats[1].mMax = outStats[1].mAvg; outStats[1].mMin = outStats[1].mAvg; outStats[2].mId = "treesize"; outStats[2].mAvg = lGPDeme[0]->getTotalNodes(); outStats[2].mStd = 0.0; outStats[2].mMax = outStats[2].mAvg; outStats[2].mMin = outStats[2].mAvg; return; } double lSum = (double)lFirstIndivFitness->getValue(); double lPow2Sum = pow2Of((double)lFirstIndivFitness->getValue()); double lMax = lFirstIndivFitness->getValue(); double lMin = lFirstIndivFitness->getValue(); unsigned int lMaxDepth = lGPDeme[0]->getMaxTreeDepth(); unsigned int lMinDepth = lMaxDepth; double lSumDepth = (double)lMaxDepth; double lPow2SumDepth = pow2Of(lSumDepth); unsigned int lMaxSize = lGPDeme[0]->getTotalNodes(); unsigned int lMinSize = lMaxSize; double lSumSize = (double)lMaxSize; double lPow2SumSize = pow2Of(lSumSize); for(unsigned int i=1; i(ioDeme[i]->getFitness()); lSum += (double)lIndivFitness->getValue(); lPow2Sum += pow2Of((double)lIndivFitness->getValue()); lMax = maxOf(lMax, (double)lIndivFitness->getValue()); lMin = minOf(lMin, (double)lIndivFitness->getValue()); unsigned int lTmpDepth = lGPDeme[i]->getMaxTreeDepth(); lSumDepth += (double)lTmpDepth; lPow2SumDepth += pow2Of((double)lTmpDepth); lMaxDepth = maxOf(lMaxDepth, lTmpDepth); lMinDepth = minOf(lMinDepth, lTmpDepth); unsigned int lTmpSize = lGPDeme[i]->getTotalNodes(); lSumSize += (double)lTmpSize; lPow2SumSize += pow2Of((double)lTmpSize); lMaxSize = maxOf(lMaxSize, lTmpSize); lMinSize = minOf(lMinSize, lTmpSize); } double lAverage = lSum / ioDeme.size(); double lStdError = (lPow2Sum - (pow2Of(lSum)/ioDeme.size())) / (ioDeme.size()-1); lStdError = sqrt(lStdError); float lDepthAverage = (float)(lSumDepth / lGPDeme.size()); float lDepthStdError = (float)(lPow2SumDepth - (pow2Of(lSumDepth) / lGPDeme.size())) / (lGPDeme.size() - 1); lDepthStdError = sqrt(lDepthStdError); float lSizeAverage = (float)(lSumSize / lGPDeme.size()); float lSizeStdError = (float)(lPow2SumSize - (pow2Of(lSumSize) / lGPDeme.size())) / (lGPDeme.size() - 1); lSizeStdError = sqrt(lSizeStdError); outStats.setGenerationValues(string("deme")+uint2str(ioContext.getDemeIndex()+1), ioContext.getGeneration(), ioDeme.size(), true); outStats.resize(3); outStats[0].mId = "fitness"; outStats[0].mAvg = lAverage; outStats[0].mStd = lStdError; outStats[0].mMax = lMax; outStats[0].mMin = lMin; outStats[1].mId = "treedepth"; outStats[1].mAvg = lDepthAverage; outStats[1].mStd = lDepthStdError; outStats[1].mMax = (float)lMaxDepth; outStats[1].mMin = (float)lMinDepth; outStats[2].mId = "treesize"; outStats[2].mAvg = lSizeAverage; outStats[2].mStd = lSizeStdError; outStats[2].mMax = (float)lMaxSize; outStats[2].mMin = (float)lMinSize; Beagle_StackTraceEndM("void GP::StatsCalcFitnessSimpleOp::calculateStatsDeme(Beagle::Stats& outStats, Beagle::Deme& ioDeme, Beagle::Context& ioContext) const"); }