SiGraph: sulcal graphs


traineriterator.h
Go to the documentation of this file.
1
2#ifndef SI_LEARNER_TRAINERITERATOR_H
3#define SI_LEARNER_TRAINERITERATOR_H
4
5#include <set>
6#include <map>
7#include <list>
8#include <cartobase/object/object.h>
9
10namespace sigraph
11{
12 class Trainer;
13 class CGraph;
14 class Model;
15 class Clique;
16 class Adaptive;
17
19 {
20 public:
21 typedef std::map<Model *, std::list<Clique *> > CliquesModelMap;
22
23 TrainerIterator( Trainer &, const std::set<CGraph *> *lrnBase,
24 const std::set<CGraph *> *tstBase = 0, int cycles = 1,
25 int cycles_tst = 1 );
28
30
33 void next();
34 bool isValid() const;
35
41 int cycles() const;
42 int testCycles() const;
44 int count() const;
45
46 private:
47 friend class Trainer;
48 struct Private;
49 Private *d;
50 };
51
52}
53
54#endif
55
56
Elément adaptatif (classe abstraite).
Definition adaptive.h:23
Graphes avec étiquettes et gestion de cliques (classe abstraite).
Definition cgraph.h:37
Classe Clique.
Definition clique.h:35
Modèle pour l'évaluation de cliques de graphes (classe abstraite).
Definition model.h:26
std::map< Model *, std::list< Clique * > > CliquesModelMap
TrainerIterator(const TrainerIterator &)
int count() const
total number of iterations
Adaptive * adaptive()
same as model() but dynamic_casted to Adaptive *
CliquesModelMap * testBase()
CliquesModelMap * learnBase()
TrainerIterator & operator=(const TrainerIterator &)
TrainerIterator(Trainer &, const std::set< CGraph * > *lrnBase, const std::set< CGraph * > *tstBase=0, int cycles=1, int cycles_tst=1)
void train(carto::Object &o)
trains the Trainer for 1 cycle, so the iterator increments
Apprentissage des éléments adaptatifs des graphes modèles.
Definition trainer.h:18