README

• Benjamin Negrevergne, Anton Dries, Tias Guns, and Siegfried Nijssen. Dominance programming for itemset mining. In International Conference on Data Mining (ICDM), 2013.

http://www.lamsade.dauphine.fr/~bnegrevergne/webpage/software/dp/dp_latest.tar.gz

Models for itemset mining can be found in the src/main.cpp file.

Thanks to the new syntax, specifying a "dominance program" is quite simple. For example the complete program for closed itemset mining looks like this:

#include "common.h"					        // core functionality
#include "pattern_mining.h"					// macros and constraints for pattern mining

OperatorChain closed(int argc, char* argv[]) {
    LOAD_DATA;							// initializes tdb0, tdb1, nr_i, nr_t0, nr_t1
    LOAD_FREQ;							// initializes freq

    return OperatorChain()
    << DefineOperator("items", 0, 1, nr_i)			// define "items" variable
    << DefineOperator("cover", 0, 1, nr_t)			// define "cover" variable
    << CoverConstraint("items", "cover", tdb)			// apply cover constraint
    << FrequencyConstraint("items", "cover", tdb, freq);	// apply frequency constraint
    << DominanceOperator( Preorder("items", GEQ) &		// apply closedness constraint
                                 Preorder("cover", EQ) )
    << OutputOperator(cout,					// specify output formatting
                OutSpec(OutSpecType::ARR2SET, "items") &
                OutSpec(OutSpecType::CONSTANT, "| ") &
                OutSpec(OutSpecType::SETSIZE, "cover"));
}

int main(int argc, char* argv[]) {
    closed(argc,argv).solve();					// solve the algebra expression
}

See src/README doc/userguide.html and src/main.cpp for more information.

Report bugs to Benjamin Negrevergne or Anton Dries at:

• Benjamin.Negrevergne@dauphine.fr
• Anton.Dries@cs.kuleuven.be