Biorithm
1.1
|
This class computes a graph that represents a specific subset of the lattice containing all TTs. Each maximal TT has a node in the graph. In addition, for every pair X and Y of such TTs, let Z be the TT formed by the intersection of the columns in X and Y. If Z is not empty, the graph contains an edge from Z to X and from Z to Y. More...
#include <LatticeFilter.h>
Public Member Functions | |
LatticeFilter (const LatticeFilter &src) | |
virtual LatticeFilter & | operator= (const LatticeFilter &rhs) |
virtual bool | filter (const ItemSet &is, TruthMatrix &tm, string &msg) |
Protected Attributes | |
MyGraph | graph |
map< string, set< string > > | columnSets |
unsigned int | numNonMaximalItemsets |
This class computes a graph that represents a specific subset of the lattice containing all TTs. Each maximal TT has a node in the graph. In addition, for every pair X and Y of such TTs, let Z be the TT formed by the intersection of the columns in X and Y. If Z is not empty, the graph contains an edge from Z to X and from Z to Y.
bool LatticeFilter::filter | ( | const ItemSet & | is, |
TruthMatrix & | tm, | ||
string & | msg | ||
) | [virtual] |
This method performs the primary computations to obtain the lattice connecting maximal TTs ------------------------------- Parameters ------------------------------- const ItemSet& is The truth table to examine TruthMatrix& tm The matrix where the truth table came from string& msg We can alter this to add a message to the filter, IE: what tt it is similar to
--------------------------------- Return --------------------------------- True if it passed, false if not
Implements Filter.