seq_step_straight.hpp

Go to the documentation of this file.

#ifndef FSTSEARCHSEQSTEPSTRAIGHT_H
#define FSTSEARCHSEQSTEPSTRAIGHT_H
 /* 
=========================================================================
Copyright and license:
  * FST4 software (with the exception of any bundled or externally linked
    third-party components) is Copyright (C) 2000-present Institute of
    Information Theory and Automation of the Czech Academy of Sciences (UTIA).
  * FST4 is free software: you can redistribute it and/or modify it under
    the terms of the GNU Affero General Public License as published by the
    Free Software Foundation, version 3. The full text of the license is in
    the file LICENSE in the distribution root and at
    https://www.gnu.org/licenses/agpl-3.0.html.
  * FST4 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 Affero General Public
    License for more details.
  * Closed-source use without the AGPL's copyleft obligations requires a
    commercial license from UTIA; in case of interest write to
    utia@utia.cas.cz. LICENSING.md in the distribution root explains both
    options, the contributor license agreement that every contribution
    requires, and the contacts (technical questions and pull requests:
    somol@utia.cas.cz, with "FST" in the subject line).
========================================================================== */
 
#include <memory>
#include <cassert>
#include <iostream>
#include <sstream>
#include "error.hpp"
#include "global.hpp"
#include "seq_step.hpp"
#include "candidate_evaluator.hpp"
#include "candidate_evaluator_sequential.hpp"
 
/*============== Template parameter type naming conventions ==============
--------- Numeric types: -------------------------------------------------
DATATYPE - data sample values - usually real numbers (but may be integers
          in text processing etc.)
REALTYPE - must be real numbers - for representing intermediate results of 
          calculations like mean, covariance etc.
IDXTYPE - index values for enumeration of data samples - (nonnegative) integers, 
          extent depends on numbers of samples in data
DIMTYPE - index values for enumeration of features (dimensions), or classes (not 
          class sizes) - (nonnegative) integers, usually lower extent than IDXTYPE, 
          but be aware of expressions like _classes*_features*_features ! 
          in linearized representations of feature matrices for all classes
BINTYPE - feature selection marker type - represents ca. <10 different feature 
          states (selected, deselected, sel./desel. temporarily 1st nested loop, 2nd...)
RETURNTYPE - criterion value: real value, but may be extended in future to support 
          multiple values 
--------- Class types: ---------------------------------------------------
SUBSET       - class of class type Subset 
CLASSIFIER   - class implementing interface defined in abstract class Classifier 
EVALUATOR    - class implementing interface defined in abstract class Sequential_Step 
DISTANCE     - class implementing interface defined in abstract class Distance 
DATAACCESSOR - class implementing interface defined in abstract class Data_Accessor 
INTERVALCONTAINER - class of class type Data_Intervaller 
CONTAINER    - STL container of class type Data_Interval  
========================================================================== */
 
namespace FST {

template<class RETURNTYPE, typename DIMTYPE, class SUBSET, class CRITERION>
class Sequential_Step_Straight : public Sequential_Step<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>{
public:
        typedef Sequential_Step<RETURNTYPE,DIMTYPE,SUBSET,CRITERION> parent; 
        typedef std::shared_ptr<CRITERION> PCriterion; 
        typedef std::shared_ptr<SUBSET> PSubset; 
        typedef Candidate_Evaluator<RETURNTYPE,DIMTYPE,SUBSET,CRITERION> EVALUATORENGINE; 
        typedef std::shared_ptr<EVALUATORENGINE> PEvaluatorEngine; 
        explicit Sequential_Step_Straight(PEvaluatorEngine engine=PEvaluatorEngine()):Sequential_Step<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>(),_engine(engine) {
                if(!_engine) _engine.reset(new Candidate_Evaluator_Sequential<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>());
                notify("Sequential_Step_Straight constructor.");
        }
        virtual ~Sequential_Step_Straight() {notify("Sequential_Step_Straight destructor.");}
 
        // NOTE: crit is expected to be already initialize()d before use here
        inline bool evaluate_candidates(RETURNTYPE &result, const PSubset sub, const PCriterion crit, const DIMTYPE _generalization_level=1, std::ostream& os=std::cout) override; 

        virtual std::ostream& print(std::ostream& os) const override {
                if(_engine->is_threaded()) os << "Sequential_Step_Straight(threads="<<_engine->get_max_threads()<<")";
                else os << "Sequential_Step_Straight()";
                if(parent::result_tracker_active()) os << " with " << *parent::_tracker;
                return os;
        }
protected:
        PEvaluatorEngine _engine; 
};
 
template<class RETURNTYPE, typename DIMTYPE, class SUBSET, class CRITERION>
bool Sequential_Step_Straight<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>::evaluate_candidates(RETURNTYPE &result, const PSubset sub, const PCriterion crit, const DIMTYPE _generalization_level, std::ostream& os)
{
        assert(sub);
        assert(crit);
        assert(_generalization_level>=1 && _generalization_level<=sub->get_n());
        assert(_engine);
        // a per-result callback is installed only when a result tracker is attached:
        // without one the candidates are evaluated exactly as before, they are just
        // not recorded anywhere
        typename EVALUATORENGINE::ResultCallback on_result;
        if(parent::result_tracker_active()) {
                typename parent::PResultTracker tracker=parent::_tracker;
                on_result=[tracker](const RETURNTYPE val, const PSubset &csub, const DIMTYPE) {tracker->add(val,csub);};
        }
        // the candidate count is needed only by the threaded engine, to size its result
        // storage; the sequential engine streams candidates and never needs it.
        // getNoOfCandidateSubsets() computes C(n,g) incrementally in 64 bits, so
        // generalized steps (g>=2) are supported threaded as well; it throws only if the
        // count genuinely exceeds DIMTYPE - i.e., when the step loop itself would be
        // infeasible anyway
        const DIMTYPE max_candidates = _engine->is_threaded() ? sub->getNoOfCandidateSubsets(_generalization_level,false/*reverse*/) : 1;
        _engine->initialize(crit, max_candidates, on_result);
 
        bool b=sub->getFirstCandidateSubset(_generalization_level,false/*reverse*/);
        if(!b) return false; // no candidate subsets can be traversed for whatever reason
        if(parent::output_detailed()) {std::ostringstream sos; sos << "Step...: sub=" << *sub << std::endl << std::endl << std::flush; syncout::print(os,sos);}
        if(!_engine->add_candidate(sub)) return false;
 
        b=sub->getNextCandidateSubset(); // evaluate the remaining candidates
        while(b) {
                if(parent::output_detailed()) {std::ostringstream sos; sos << "Step...: sub=" << *sub << std::endl << std::endl << std::flush; syncout::print(os,sos);}
                if(!_engine->add_candidate(sub)) return false;
                b=sub->getNextCandidateSubset();
        }
 
        PSubset psub;
        DIMTYPE dummyfeature;
        if(!_engine->getBestResult(result,psub,dummyfeature)) return false;
        assert(psub);
        assert(psub->get_n()==sub->get_n());
        sub->stateless_copy(*psub);
        return true;
}
 
 
} // namespace
#endif // FSTSEARCHSEQSTEPSTRAIGHT_H ///:~