AboutTheTrunk

Introduction

As of version Slatt 0.2.2 in the correspondingly named tag ([r31]) and download, main.py includes examples of how to handle Slatt jobs to do the available tasks:

• GD: Guigues-Duquenne basis
• RR: representative rules
• B*: B-star closure-based basis, needs to be complemented with GD to compare to RR

Additionally, both for RR and for B-star it is possible to bound the rules on the basis of the appropriate notion of confidence boost.

To do

1. Include the alternative complete version to the incomplete heuristic for RR.
2. Must refactor confidence boost for RR and also the lattice inside a job.
3. Quite a few additional loose ends (mainly in the unit testing)
4. Some day, add our own closure set miner and a more sophisticate (Hasse?) lattice constructor. This might happen in a different project.

Deprecated

Add your content here.

About the goals and history of this project, specifically the version considered trunk.

To do one of these days.

Details

Add your content here. Format your content with:

• Text in bold or italic
• Headings, paragraphs, and lists
• Automatic links to other wiki pages