This is class is an implementation of a simple serach strategy for the gspan algorithm: it accept a growth if its frequency is above a user defined value. More...

#include <agrum/PRM/gspan/DFSTree.h>

Inheritance diagram for gum::prm::gspan::FrequenceSearch< GUM_SCALAR >:

[legend]

Collaboration diagram for gum::prm::gspan::FrequenceSearch< GUM_SCALAR >:

[legend]

Public Member Functions
Constructor and destructor.
	FrequenceSearch (Size freq)
	Default constructor.
	FrequenceSearch (const FrequenceSearch &from)
	Copy constructor.
	~FrequenceSearch () override
	Destructor.
FrequenceSearch &	operator= (const FrequenceSearch &from)
	Copy operator.
Search methods.
bool	accept_root (const Pattern *r) override
bool	accept_growth (const Pattern parent, const Pattern child, const EdgeGrowth< GUM_SCALAR > &growth) override
bool	operator() (LabelData i, LabelData j) override
bool	operator() (Pattern i, Pattern j) override
Search methods.
void	setTree (DFSTree< GUM_SCALAR > *tree)

Protected Member Functions
double	computeCost_ (const Pattern &p)

Protected Attributes
DFSTree< GUM_SCALAR > *	tree_

Private Attributes
Size	_freq_

Detailed Description

template<GUM_Numeric GUM_SCALAR>
class gum::prm::gspan::FrequenceSearch< GUM_SCALAR >

This is class is an implementation of a simple serach strategy for the gspan algorithm: it accept a growth if its frequency is above a user defined value.

Definition at line 133 of file searchStrategy.h.

Constructor & Destructor Documentation

◆ FrequenceSearch() [1/2]

template<GUM_Numeric GUM_SCALAR>

gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch ( Size freq )

explicit

Default constructor.

Definition at line 244 of file searchStrategy_tpl.h.

                                                              :
          SearchStrategy< GUM_SCALAR >(), _freq_(freq) {
        GUM_CONSTRUCTOR(FrequenceSearch);
      }

References FrequenceSearch(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), and _freq_.

Referenced by gum::prm::gspan::DFSTree< GUM_SCALAR >::DFSTree(), FrequenceSearch(), FrequenceSearch(), ~FrequenceSearch(), and operator=().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ FrequenceSearch() [2/2]

template<GUM_Numeric GUM_SCALAR>

gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::FrequenceSearch ( const FrequenceSearch< GUM_SCALAR > & from )

Copy constructor.

Definition at line 250 of file searchStrategy_tpl.h.

                                                                                              :
          SearchStrategy< GUM_SCALAR >(from), _freq_(from._freq_) {
        GUM_CONS_CPY(FrequenceSearch);
      }

References FrequenceSearch(), gum::prm::gspan::SearchStrategy< GUM_SCALAR >::SearchStrategy(), and _freq_.

Here is the call graph for this function:

◆ ~FrequenceSearch()

template<GUM_Numeric GUM_SCALAR>

gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::~FrequenceSearch ( )

override

Destructor.

Definition at line 256 of file searchStrategy_tpl.h.

                                                      {
        GUM_DESTRUCTOR(FrequenceSearch);
      }

References FrequenceSearch().

Here is the call graph for this function:

Member Function Documentation

◆ accept_growth()

template<GUM_Numeric GUM_SCALAR>

bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_growth	(	const Pattern *	parent,
		const Pattern *	child,
		const EdgeGrowth< GUM_SCALAR > &	growth )

overridevirtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 273 of file searchStrategy_tpl.h.

                                                                                               {
        return this->tree_->frequency(*child) >= _freq_;
      }

References _freq_, and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::tree_.

◆ accept_root()

template<GUM_Numeric GUM_SCALAR>

bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::accept_root ( const Pattern * r )

overridevirtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 268 of file searchStrategy_tpl.h.

                                                                      {
        return this->tree_->frequency(*r) >= _freq_;
      }

References _freq_, and gum::prm::gspan::SearchStrategy< GUM_SCALAR >::tree_.

◆ computeCost_()

template<GUM_Numeric GUM_SCALAR>

double gum::prm::gspan::SearchStrategy< GUM_SCALAR >::computeCost_ ( const Pattern & p )

protectedinherited

Definition at line 57 of file searchStrategy_tpl.h.

                                                                        {
        double                                        cost = 0;
        const Sequence< PRMInstance< GUM_SCALAR >* >& seq
            = *(this->tree_->data(p).iso_map.begin().val());
        Sequence< PRMClassElement< GUM_SCALAR >* > input_set;
 
        for (const auto inst: seq) {
          for (const auto input: inst->type().slotChains())
            for (const auto inst2: inst->getInstances(input->id()))
              if ((!seq.exists(inst2))
                  && (!input_set.exists(&(inst2->get(input->lastElt().safeName()))))) {
                cost += std::log(input->type().variable().domainSize());
                input_set.insert(&(inst2->get(input->lastElt().safeName())));
              }
 
          for (auto vec = inst->beginInvRef(); vec != inst->endInvRef(); ++vec)
            for (const auto& inverse: *vec.val())
              if (!seq.exists(inverse.first)) {
                cost += std::log(inst->get(vec.key()).type().variable().domainSize());
                break;
              }
        }
 
        return cost;
      }

References gum::SequenceImplementation< Key, Gen >::exists(), gum::SequenceImplementation< Key, Gen >::insert(), and tree_.

Referenced by gum::prm::gspan::StrictSearch< GUM_SCALAR >::_compute_costs_(), and gum::prm::gspan::TreeWidthSearch< GUM_SCALAR >::cost().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ operator()() [1/2]

template<GUM_Numeric GUM_SCALAR>

bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator()	(	LabelData *	i,
		LabelData *	j )

overridevirtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 286 of file searchStrategy_tpl.h.

                                                                               {
        return (this->tree_->internalGraph().size(i) > this->tree_->internalGraph().size(j));
      }

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::tree_.

◆ operator()() [2/2]

template<GUM_Numeric GUM_SCALAR>

bool gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator()	(	gspan::Pattern *	i,
		gspan::Pattern *	j )

overridevirtual

Implements gum::prm::gspan::SearchStrategy< GUM_SCALAR >.

Definition at line 280 of file searchStrategy_tpl.h.

                                                                                     {
        // We want a descending order
        return this->tree_->frequency(*i) > this->tree_->frequency(*j);
      }

References gum::prm::gspan::SearchStrategy< GUM_SCALAR >::tree_.

◆ operator=()

template<GUM_Numeric GUM_SCALAR>

FrequenceSearch< GUM_SCALAR > & gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::operator= ( const FrequenceSearch< GUM_SCALAR > & from )

Copy operator.

Definition at line 262 of file searchStrategy_tpl.h.

                                                                                          {
        _freq_ = from._freq_;
        return *this;
      }

References FrequenceSearch(), and _freq_.

Here is the call graph for this function:

◆ setTree()

template<GUM_Numeric GUM_SCALAR>

void gum::prm::gspan::SearchStrategy< GUM_SCALAR >::setTree ( DFSTree< GUM_SCALAR > * tree )

inherited

Definition at line 236 of file searchStrategy_tpl.h.

                                                                            {
        this->tree_ = tree;
      }

References tree_.

Referenced by operator=().

Here is the caller graph for this function:

Member Data Documentation

◆ _freq_

template<GUM_Numeric GUM_SCALAR>

Size gum::prm::gspan::FrequenceSearch< GUM_SCALAR >::_freq_

private

Definition at line 169 of file searchStrategy.h.

Referenced by FrequenceSearch(), FrequenceSearch(), accept_growth(), accept_root(), and operator=().

◆ tree_

template<GUM_Numeric GUM_SCALAR>

DFSTree< GUM_SCALAR >* gum::prm::gspan::SearchStrategy< GUM_SCALAR >::tree_

protectedinherited

Definition at line 119 of file searchStrategy.h.

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

agrum/PRM/gspan/searchStrategy.h
agrum/PRM/gspan/searchStrategy_tpl.h

Public Member Functions

Protected Member Functions

Protected Attributes

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ FrequenceSearch() [1/2]

◆ FrequenceSearch() [2/2]

◆ ~FrequenceSearch()

Member Function Documentation

◆ accept_growth()

◆ accept_root()

◆ computeCost_()

◆ operator()() [1/2]

◆ operator()() [2/2]

◆ operator=()

◆ setTree()

Member Data Documentation

◆ _freq_

◆ tree_