gum::LeafAggregator Class Reference

<agrum/FMDP/learning/FunctionGraph/leafAggregator.h> More...

#include <leafAggregator.h>

Collaboration diagram for gum::LeafAggregator:

Public Member Functions
void	update ()
bool	needsUpdate ()
HashTable< NodeId, AbstractLeaf *>	leavesMap ()
std::string	toString ()
Constructor & destructor.
	LeafAggregator (NodeGraphPart *idSource, double similarityThreshold)
	Default constructor. More...
	~LeafAggregator ()
	Default destructor. More...
Leaf Handling methods
void	addLeaf (AbstractLeaf *)
bool	updateLeaf (AbstractLeaf *)
void	removeLeaf (AbstractLeaf *)
void	begin ()
bool	hasNext ()
double	next ()

Detailed Description

<agrum/FMDP/learning/FunctionGraph/leafAggregator.h>

Gather together leaves with similar distributions

Definition at line 59 of file leafAggregator.h.

Constructor & Destructor Documentation

LeafAggregator()

gum::LeafAggregator::LeafAggregator	(	NodeGraphPart *	idSource,
		double	similarityThreshold
	)

Default constructor.

Definition at line 43 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                                                    :
      _leavesCpt_(idSource), _similarityThreshold_(similarityThreshold) {
    GUM_CONSTRUCTOR(LeafAggregator);
    _initialContext_ = new FusionContext< true >(nullptr);
    _needsUpdate_    = false;
  }

Here is the call graph for this function:

~LeafAggregator()

gum::LeafAggregator::~LeafAggregator

(

)

Default destructor.

Definition at line 53 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                  {
    _removeContext_(0);

    delete _initialContext_;

    for (HashTableIteratorSafe< AbstractLeaf*, Set< LeafPair* >* > leafIter
         = _leaf2Pair_.beginSafe();
         leafIter != _leaf2Pair_.endSafe();
         ++leafIter) {
      for (SetIteratorSafe< LeafPair* > pairIter = leafIter.val()->beginSafe();
           pairIter != leafIter.val()->endSafe();
           ++pairIter) {
        LeafPair* curPair = *pairIter;
        _leaf2Pair_[curPair->otherLeaf(leafIter.key())]->erase(*pairIter);
        leafIter.val()->erase(curPair);
        delete curPair;
      }
      delete leafIter.val();
    }


    GUM_DESTRUCTOR(LeafAggregator);
  }

Here is the call graph for this function:

Member Function Documentation

_addInitialPair_()

void gum::LeafAggregator::_addInitialPair_ ( LeafPair *  p )

private

Definition at line 342 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                   {
    bool res = _initialContext_->addPair(p);
    if (res) _removeContext_(0);
  }

Here is the call graph for this function:

_removeContext_()

void gum::LeafAggregator::_removeContext_ ( Idx  startingPos )

private

Definition at line 328 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                      {
    for (Idx i = _fusionSeq_.size() - 1; !_fusionSeq_.empty() && i >= startingPos; --i) {
      _leavesCpt_->eraseNode(_fusionSeq_.atPos(i)->leaf()->id());
      delete _fusionSeq_.atPos(i);
      _fusionSeq_.erase(_fusionSeq_.atPos(i));
    }

    _needsUpdate_ = true;
  }

Here is the call graph for this function:

_removeInitialPair_()

void gum::LeafAggregator::_removeInitialPair_ ( LeafPair *  p )

private

Definition at line 359 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                      {
    bool res = _initialContext_->removePair(p);
    if (res) _removeContext_(0);
  }

Here is the call graph for this function:

_updateInitialPair_()

void gum::LeafAggregator::_updateInitialPair_ ( LeafPair *  p )

private

Definition at line 351 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                      {
    bool res = _initialContext_->updatePair(p);
    if (res) _removeContext_(0);
  }

Here is the call graph for this function:

addLeaf()

void gum::LeafAggregator::addLeaf

(

AbstractLeaf *

l

)

Definition at line 84 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                              {
    Set< LeafPair* >* leafPairSet = new Set< LeafPair* >();
    Set< LeafPair* >  bag;

    // ****************************************************************************************
    // Création et ajout des pairs de base (Feuille de base + nouvelle Feuille)
    for (HashTableConstIteratorSafe< AbstractLeaf*, Set< LeafPair* >* > leafIter
         = _leaf2Pair_.cbeginSafe();
         leafIter != _leaf2Pair_.cendSafe();
         ++leafIter) {
      // Création de la pair et ajout dans les listes de pair des feuilles de
      // base
      LeafPair* p = new LeafPair(l, leafIter.key());
      p->updateLikelyhood();
      leafPairSet->insert(p);
      (leafIter.val())->insert(p);

      // Ajout de la nouvelle pair au tas initial
      _addInitialPair_(p);

      bag.insert(p);
    }

    // ****************************************************************************************
    // Enregistrement de la nouvelle Feuille en tant que feuille de base
    _leaf2Pair_.insert(l, leafPairSet);

    // ****************************************************************************************
    // Ajout de la feuille aux FusionContext

    for (SequenceIteratorSafe< FusionContext< false >* > fusIter = _fusionSeq_.beginSafe();
         fusIter != _fusionSeq_.endSafe();
         ++fusIter) {
      // Ajout de la nouvelle pair composée de la feuille de FusIter et de la
      // nouvelle feuille aux FusionContext suivant
      for (SetIteratorSafe< LeafPair* > pairIter = bag.beginSafe(); pairIter != bag.endSafe();
           ++pairIter) {
        if ((*fusIter)->leaf()->contains((*pairIter)->secondLeaf()->id())) {
          bag >> *pairIter;
          continue;
        }

        if ((*fusIter)->addPair(*pairIter)) _removeContext_(fusIter.pos() + 1);
      }

      if ((*fusIter)->associateLeaf(l)) _removeContext_(fusIter.pos() + 1);

      bag << (*fusIter)->leafAssociatedPair(l);
    }

    _needsUpdate_ = true;
  }

Here is the call graph for this function:

begin()

void gum::LeafAggregator::begin

(

)

hasNext()

bool gum::LeafAggregator::hasNext

(

)

leavesMap()

HashTable< NodeId, AbstractLeaf *> gum::LeafAggregator::leavesMap

(

)

Definition at line 274 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                               {
    HashTable< NodeId, AbstractLeaf* > retMap;
    for (SequenceIteratorSafe< FusionContext< false >* > fusIter = _fusionSeq_.rbeginSafe();
         fusIter != _fusionSeq_.rendSafe();
         --fusIter) {
      bool alreadyIn = false;
      for (HashTableIteratorSafe< NodeId, AbstractLeaf* > mapIter = retMap.beginSafe();
           mapIter != retMap.endSafe();
           ++mapIter)
        if (mapIter.val()->contains((*fusIter)->leaf()->id())) {
          alreadyIn = true;
          break;
        }
      if (!alreadyIn) retMap.insert((*fusIter)->leaf()->id(), (*fusIter)->leaf());
    }

    for (HashTableIteratorSafe< AbstractLeaf*, Set< LeafPair* >* > leafIter
         = _leaf2Pair_.beginSafe();
         leafIter != _leaf2Pair_.endSafe();
         ++leafIter) {
      for (HashTableIteratorSafe< NodeId, AbstractLeaf* > mapIter = retMap.beginSafe();
           mapIter != retMap.endSafe();
           ++mapIter)
        if (mapIter.val()->contains(leafIter.key()->id())) {
          retMap.insert(leafIter.key()->id(), mapIter.val());
          break;
        }
      if (!retMap.exists(leafIter.key()->id())) retMap.insert(leafIter.key()->id(), leafIter.key());
    }

    return retMap;
  }

Here is the call graph for this function:

needsUpdate()

bool gum::LeafAggregator::needsUpdate ( )

inline

Definition at line 124 of file leafAggregator.h.

References _needsUpdate_.

{ return _needsUpdate_; }

next()

double gum::LeafAggregator::next

(

)

removeLeaf()

void gum::LeafAggregator::removeLeaf

(

AbstractLeaf *

l

)

Definition at line 186 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                 {
    // ***********************************************************************************
    // First we update every base pair linked to that leaf
    Set< LeafPair* > bag(*(_leaf2Pair_[l]));
    for (SetIteratorSafe< LeafPair* > pairIter = bag.beginSafe(); pairIter != bag.endSafe();
         ++pairIter) {
      _removeInitialPair_(*pairIter);
      (*_leaf2Pair_[(*pairIter)->otherLeaf(l)]) >> *pairIter;
    }

    // **********************************************************************************
    // The we have top update FusionContext pairs associated to that leaf
    Set< LeafPair* > toBeDeleted;
    for (SequenceIteratorSafe< FusionContext< false >* > fusIter = _fusionSeq_.beginSafe();
         fusIter != _fusionSeq_.endSafe();
         ++fusIter) {
      for (SetIteratorSafe< LeafPair* > pairIter = bag.beginSafe(); pairIter != bag.endSafe();
           ++pairIter) {
        if ((*fusIter)->leaf()->contains((*pairIter)->secondLeaf()->id())
            || (*fusIter)->leaf()->contains((*pairIter)->firstLeaf()->id())) {
          bag >> *pairIter;
          continue;
        }

        if ((*fusIter)->removePair(*pairIter)) { _removeContext_(fusIter.pos() + 1); }
      }

      bag << (*fusIter)->leafAssociatedPair(l);
      toBeDeleted << (*fusIter)->leafAssociatedPair(l);

      if ((*fusIter)->deassociateLeaf(l)) { _removeContext_(fusIter.pos() + 1); }
    }

    for (SetIteratorSafe< LeafPair* > pairIter = toBeDeleted.beginSafe();
         pairIter != toBeDeleted.endSafe();
         ++pairIter)
      delete *pairIter;

    for (SetIteratorSafe< LeafPair* > pairIter = _leaf2Pair_[l]->beginSafe();
         pairIter != _leaf2Pair_[l]->endSafe();
         ++pairIter)
      delete *pairIter;
    delete _leaf2Pair_[l];
    _leaf2Pair_.erase(l);

    _needsUpdate_ = true;
  }

Here is the call graph for this function:

toString()

std::string gum::LeafAggregator::toString

(

)

Definition at line 308 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                     {
    std::stringstream ss;
    ss << "################\nTas Initial : " << std::endl
       << _initialContext_->toString() << std::endl;

    for (auto fusIter = _fusionSeq_.beginSafe(); fusIter != _fusionSeq_.endSafe(); ++fusIter) {
      ss << "################\nTas " << fusIter.pos() << " : " << std::endl
         << (*fusIter)->toString();
    }

    return ss.str();
  }

Here is the call graph for this function:

update()

void gum::LeafAggregator::update

(

)

Definition at line 238 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                              {
    LeafPair*     nextPair = _initialContext_->top();
    pair_iterator pb       = _initialContext_->beginPairs();
    pair_iterator pe       = _initialContext_->endPairs();
    if (!_fusionSeq_.empty()) {
      nextPair = _fusionSeq_.back()->top();
      pb       = _fusionSeq_.back()->beginPairs();
      pe       = _fusionSeq_.back()->endPairs();
    }


    while (nextPair && nextPair->likelyhood() < _similarityThreshold_) {
      AbstractLeaf*           newLeaf    = nextPair->convert2Leaf(_leavesCpt_->addNode());
      FusionContext< false >* newContext = new FusionContext< false >(newLeaf);

      for (pair_iterator pairIter = pb; pairIter != pe; ++pairIter) {
        if (!newLeaf->contains(pairIter.key()->firstLeaf()->id())
            && !newLeaf->contains(pairIter.key()->secondLeaf()->id()))
          newContext->addPair(pairIter.key());
        if (!newLeaf->contains(pairIter.key()->firstLeaf()->id())
            && !newContext->containsAssociatedLeaf(pairIter.key()->firstLeaf()))
          newContext->associateLeaf(pairIter.key()->firstLeaf());
        if (!newLeaf->contains(pairIter.key()->secondLeaf()->id())
            && !newContext->containsAssociatedLeaf(pairIter.key()->secondLeaf()))
          newContext->associateLeaf(pairIter.key()->secondLeaf());
      }

      _fusionSeq_.insert(newContext);
      nextPair = _fusionSeq_.back()->top();
      pb       = _fusionSeq_.back()->beginPairs();
      pe       = _fusionSeq_.back()->endPairs();
    }
    _needsUpdate_ = false;
  }

Here is the call graph for this function:

updateLeaf()

bool gum::LeafAggregator::updateLeaf

(

AbstractLeaf *

l

)

Definition at line 141 of file leafAggregator.cpp.

References gum::Set< Key, Alloc >::emplace().

                                                 {
    // ***********************************************************************************
    // First we update every base pair linked to that leaf
    Set< LeafPair* > bag(*(_leaf2Pair_[l]));
    for (SetIteratorSafe< LeafPair* > pairIter = bag.beginSafe(); pairIter != bag.endSafe();
         ++pairIter) {
      (*pairIter)->updateLikelyhood();
      _updateInitialPair_(*pairIter);
    }

    // **********************************************************************************
    // The we have top update FusionContext pairs associated to that leaf
    AbstractLeaf* curLeaf = l;
    for (SequenceIteratorSafe< FusionContext< false >* > fusIter = _fusionSeq_.beginSafe();
         fusIter != _fusionSeq_.endSafe();
         ++fusIter) {
      if ((*fusIter)->leaf()->contains(curLeaf->id())) {
        bag.clear();
        if ((*fusIter)->updateAllAssociatedLeaves()) _removeContext_(fusIter.pos() + 1);
        bag     = (*fusIter)->associatedPairs();
        curLeaf = (*fusIter)->leaf();
        continue;
      }

      for (SetIteratorSafe< LeafPair* > pairIter = bag.beginSafe(); pairIter != bag.endSafe();
           ++pairIter) {
        if ((*fusIter)->leaf()->contains((*pairIter)->secondLeaf()->id())
            || (*fusIter)->leaf()->contains((*pairIter)->firstLeaf()->id())) {
          bag >> *pairIter;
          continue;
        }

        if ((*fusIter)->updatePair(*pairIter)) _removeContext_(fusIter.pos() + 1);
      }
      if ((*fusIter)->updateAssociatedLeaf(curLeaf)) _removeContext_(fusIter.pos() + 1);
      bag << (*fusIter)->leafAssociatedPair(curLeaf);
    }

    return _needsUpdate_;
  }

Here is the call graph for this function:

Member Data Documentation

_fusionSeq_

Sequence< FusionContext< false >* > gum::LeafAggregator::_fusionSeq_

private

Definition at line 136 of file leafAggregator.h.

_initialContext_

FusionContext< true >* gum::LeafAggregator::_initialContext_

private

Definition at line 138 of file leafAggregator.h.

_leaf2Pair_

HashTable< AbstractLeaf*, Set< LeafPair* >* > gum::LeafAggregator::_leaf2Pair_

private

Definition at line 140 of file leafAggregator.h.

_leavesCpt_

NodeGraphPart* gum::LeafAggregator::_leavesCpt_

private

Definition at line 142 of file leafAggregator.h.

_needsUpdate_

bool gum::LeafAggregator::_needsUpdate_

private

Definition at line 145 of file leafAggregator.h.

Referenced by needsUpdate().

_similarityThreshold_

double gum::LeafAggregator::_similarityThreshold_

private

Definition at line 144 of file leafAggregator.h.

---

The documentation for this class was generated from the following files:

• agrum/FMDP/learning/datastructure/leaves/leafAggregator.h
• agrum/FMDP/learning/datastructure/leaves/leafAggregator.cpp