gum::MarkovBlanket Class Reference

Class building the markov Blanket from a BN and a nodeName. More...

#include <agrum/BN/algorithms/MarkovBlanket.h>

Collaboration diagram for gum::MarkovBlanket:

Public Member Functions
	MarkovBlanket (const DAGmodel &m, NodeId n, int level=1)
	MarkovBlanket (const DAGmodel &m, const std::string &name, int level=1)
	~MarkovBlanket ()
DAG	dag ()
std::string	toDot () const
const NodeSet &	parents (NodeId id) const
	wrapping DAG::parents(id) More...
const NodeSet &	children (NodeId id) const
	wrapping DAG::children(id) More...
NodeSet	parents (const NodeSet &ids) const
	wrapping DAG::parents(ids) More...
NodeSet	children (const NodeSet &ids) const
	wrapping DAG::children(ids) More...
Size	sizeArcs () const
	wrapping DAG::sizeArcs() More...
const ArcSet &	arcs () const
	wrapping DAG::arcs() More...
Size	sizeNodes () const
	wrapping DAG::sizeNodes() More...
Size	size () const
	wrapping DAG::size() More...
const NodeGraphPart &	nodes () const
	wrapping DAG::nodes() More...
bool	hasSameStructure (const DAGmodel &other)

Detailed Description

Class building the markov Blanket from a BN and a nodeName.

The main goal of this class is to build and to encapsulate the DiGraph which represents the Markov Blanket.

Definition at line 48 of file MarkovBlanket.h.

Constructor & Destructor Documentation

MarkovBlanket() [1/2]

gum::MarkovBlanket::MarkovBlanket	(	const DAGmodel &	m,
		NodeId	n,
		int	level = 1
	)

Definition at line 36 of file MarkovBlanket.cpp.

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

                                                                      : _model_(m), _node_(id) {
    if (level < 1) GUM_ERROR(InvalidArgument, "Argument level(=" << level << ") must be >0.")

    NodeSet done;
    _buildMarkovBlanket_(_node_);
    done.insert(_node_);

    while (level > 1) {
      level--;
      auto todo        = _mb_.nodes().asNodeSet() - done;
      bool anythingnew = false;
      for (NodeId n: todo) {
        done.insert(n);
        if (_buildMarkovBlanket_(n)) anythingnew = true;
      }
      if (!anythingnew) break;
    }

    // we add now some arcs that are between the nodes in  _mb_ but are not part of
    // the last ones.
    // For instance, an arc between a parent and a parent of children
    for (const auto node: _mb_.nodes()) {
      for (const auto child: _model_.children(node)) {
        if (_mb_.existsNode(child) && !_mb_.existsArc(Arc(node, child))) {
          _mb_.addArc(node, child);
          _specialArcs_.insert(Arc(node, child));
        }
      }
    }
  }

Here is the call graph for this function:

MarkovBlanket() [2/2]

gum::MarkovBlanket::MarkovBlanket	(	const DAGmodel &	m,
		const std::string &	name,
		int	level = 1
	)

Definition at line 67 of file MarkovBlanket.cpp.

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

                                                                                  :
      MarkovBlanket(m, m.idFromName(name), level) {}

Here is the call graph for this function:

~MarkovBlanket()

gum::MarkovBlanket::~MarkovBlanket

(

)

Definition at line 70 of file MarkovBlanket.cpp.

{}

Member Function Documentation

_buildMarkovBlanket_()

bool gum::MarkovBlanket::_buildMarkovBlanket_ ( const NodeId  id )

private

Definition at line 72 of file MarkovBlanket.cpp.

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

                                                            {
    bool change = false;
    if (!_model_.nodes().exists(node))
      GUM_ERROR(InvalidArgument, "Node " << node << " does not exist.")

    if (!_mb_.nodes().exists(node)) {
      _mb_.addNodeWithId(node);
      change = true;
    }

    for (const auto& parent: _model_.parents(node)) {
      if (!_mb_.nodes().exists(parent)) {
        _mb_.addNodeWithId(parent);
        change = true;
      }
      _mb_.addArc(parent, node);
    }

    for (const auto& child: _model_.children(node)) {
      if (!_mb_.nodes().exists(child)) {
        _mb_.addNodeWithId(child);
        change = true;
      }
      _mb_.addArc(node, child);
      for (const auto& opar: _model_.parents(child)) {
        if (opar != node) {
          if (!_mb_.nodes().exists(opar)) {
            _mb_.addNodeWithId(opar);
            change = true;
          }
          _mb_.addArc(opar, child);
        }
      }
    }

    return change;
  }

Here is the call graph for this function:

arcs()

INLINE const ArcSet & gum::MarkovBlanket::arcs

(

)

const

wrapping DAG::arcs()

Definition at line 46 of file MarkovBlanket_inl.h.

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

{ return _mb_.arcs(); }

Here is the call graph for this function:

children() [1/2]

INLINE const NodeSet & gum::MarkovBlanket::children

(

NodeId

id

)

const

wrapping DAG::children(id)

Definition at line 38 of file MarkovBlanket_inl.h.

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

{ return _mb_.children(id); }

Here is the call graph for this function:

children() [2/2]

INLINE NodeSet gum::MarkovBlanket::children

(

const NodeSet &

ids

)

const

wrapping DAG::children(ids)

Definition at line 42 of file MarkovBlanket_inl.h.

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

{ return _mb_.children(ids); }

Here is the call graph for this function:

dag()

INLINE DAG gum::MarkovBlanket::dag

(

)

Returns

a copy of the graph

Definition at line 34 of file MarkovBlanket_inl.h.

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

{ return _mb_; }

Here is the call graph for this function:

hasSameStructure()

bool gum::MarkovBlanket::hasSameStructure

(

const DAGmodel &

other

)

Returns

true if all the named node are the same and all the named arcs are the same

Definition at line 110 of file MarkovBlanket.cpp.

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

                                                            {
    if (size() != other.size()) return false;

    if (sizeArcs() != other.sizeArcs()) return false;

    for (const auto& nid: nodes()) {
      try {
        other.idFromName(_model_.variable(nid).name());
      } catch (NotFound) { return false; }
    }

    for (const auto& arc: arcs()) {
      if (!other.arcs().exists(Arc(other.idFromName(_model_.variable(arc.tail()).name()),
                                   other.idFromName(_model_.variable(arc.head()).name()))))
        return false;
    }

    return true;
  }

Here is the call graph for this function:

nodes()

INLINE const NodeGraphPart & gum::MarkovBlanket::nodes

(

)

const

wrapping DAG::nodes()

Definition at line 52 of file MarkovBlanket_inl.h.

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

{ return _mb_.nodes(); }

Here is the call graph for this function:

parents() [1/2]

INLINE const NodeSet & gum::MarkovBlanket::parents

(

NodeId

id

)

const

wrapping DAG::parents(id)

Definition at line 36 of file MarkovBlanket_inl.h.

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

{ return _mb_.parents(id); }

Here is the call graph for this function:

parents() [2/2]

INLINE NodeSet gum::MarkovBlanket::parents

(

const NodeSet &

ids

)

const

wrapping DAG::parents(ids)

Definition at line 40 of file MarkovBlanket_inl.h.

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

{ return _mb_.parents(ids); }

Here is the call graph for this function:

size()

INLINE Size gum::MarkovBlanket::size

(

)

const

wrapping DAG::size()

Definition at line 50 of file MarkovBlanket_inl.h.

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

{ return _mb_.size(); }

Here is the call graph for this function:

sizeArcs()

INLINE Size gum::MarkovBlanket::sizeArcs

(

)

const

wrapping DAG::sizeArcs()

Definition at line 44 of file MarkovBlanket_inl.h.

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

{ return _mb_.sizeArcs(); }

Here is the call graph for this function:

sizeNodes()

INLINE Size gum::MarkovBlanket::sizeNodes

(

)

const

wrapping DAG::sizeNodes()

Definition at line 48 of file MarkovBlanket_inl.h.

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

{ return _mb_.sizeNodes(); }

Here is the call graph for this function:

toDot()

std::string gum::MarkovBlanket::toDot

(

)

const

Definition at line 130 of file MarkovBlanket.cpp.

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

                                       {
    std::stringstream output;
    std::stringstream nodeStream;
    std::stringstream arcStream;
    List< NodeId >    treatedNodes;
    output << "digraph \""
           << "no_name\" {" << std::endl;
    nodeStream << "node [shape = ellipse];" << std::endl;
    std::string tab = "  ";

    for (const auto node: _mb_.nodes()) {
      nodeStream << tab << node << "[label=\"" << _model_.variable(node).name() << "\"";
      if (node == _node_) { nodeStream << ", color=red"; }
      nodeStream << "];" << std::endl;

      for (const auto chi: _mb_.children(node)) {
        arcStream << tab << node << " -> " << chi;
        if (_specialArcs_.exists(Arc(node, chi))) { arcStream << " [color=grey]"; }
        arcStream << ";" << std::endl;
      }
    }

    output << nodeStream.str() << std::endl << arcStream.str() << std::endl << "}" << std::endl;

    return output.str();
  }

Here is the call graph for this function:

Member Data Documentation

_mb_

DAG gum::MarkovBlanket::_mb_

private

Definition at line 99 of file MarkovBlanket.h.

_model_

const DAGmodel& gum::MarkovBlanket::_model_

private

Definition at line 98 of file MarkovBlanket.h.

_node_

const NodeId gum::MarkovBlanket::_node_

private

Definition at line 100 of file MarkovBlanket.h.

_specialArcs_

ArcSet gum::MarkovBlanket::_specialArcs_

private

Definition at line 101 of file MarkovBlanket.h.

---

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

• agrum/BN/algorithms/MarkovBlanket.h
• agrum/BN/algorithms/MarkovBlanket.cpp
• agrum/BN/algorithms/MarkovBlanket_inl.h