gum::learning::GreaterTupleOnLast Class Reference

#include <Miic.h>

Public Member Functions
bool	operator() (const std::tuple< std::tuple< NodeId, NodeId, NodeId > *, double, double, double > &e1, const std::tuple< std::tuple< NodeId, NodeId, NodeId > *, double, double, double > &e2) const

Detailed Description

Definition at line 77 of file Miic.h.

Member Function Documentation

operator()()

bool gum::learning::GreaterTupleOnLast::operator()	(	const std::tuple< std::tuple< NodeId, NodeId, NodeId > *, double, double, double > &	e1,
		const std::tuple< std::tuple< NodeId, NodeId, NodeId > *, double, double, double > &	e2
	)		const

Definition at line 91 of file Miic.cpp.

References gum::learning::genericBNLearner::Database::Database().

                       {
      double p1xz = std::get< 2 >(e1);
      double p1yz = std::get< 3 >(e1);
      double p2xz = std::get< 2 >(e2);
      double p2yz = std::get< 3 >(e2);
      double I1   = std::get< 1 >(e1);
      double I2   = std::get< 1 >(e2);
      // First, we look at the sign of information.
      // Then, the probility values
      // and finally the abs value of information.
      if ((I1 < 0 && I2 < 0) || (I1 >= 0 && I2 >= 0)) {
        if (std::max(p1xz, p1yz) == std::max(p2xz, p2yz)) {
          return std::abs(I1) > std::abs(I2);
        } else {
          return std::max(p1xz, p1yz) > std::max(p2xz, p2yz);
        }
      } else {
        return I1 < I2;
      }
    }

Here is the call graph for this function:

---

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

• agrum/BN/learning/Miic.h
• agrum/BN/learning/Miic.cpp