<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to SlattFrontPage</title><link>https://sourceforge.net/p/slatt/wiki/SlattFrontPage/</link><description>Recent changes to SlattFrontPage</description><atom:link href="https://sourceforge.net/p/slatt/wiki/SlattFrontPage/feed" rel="self"/><language>en</language><lastBuildDate>Sat, 28 Mar 2015 13:34:13 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/slatt/wiki/SlattFrontPage/feed" rel="self" type="application/rss+xml"/><item><title>SlattFrontPage modified by Anonymous</title><link>https://sourceforge.net/p/slatt/wiki/SlattFrontPage/</link><description>&lt;div class="markdown_content"&gt;&lt;h1 id="introduction"&gt;Introduction&lt;/h1&gt;
&lt;p&gt;Slatt is a project on which some researchers will implement a number of algorithmic ideas regarding closure-based association mining. The purpose, as of now, is research: empirical investigations complementing the mathematical advances that could be put forward for the task. &lt;/p&gt;
&lt;h1 id="downloads"&gt;Downloads&lt;/h1&gt;
&lt;p&gt;Most recent version is Slatt 0.2.2 alpha, which includes confidence boost bounds for both representative rules and the B&lt;strong&gt; basis. &lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Early: Public download offered nov 21, 2009, Slatt 0.2.0 alpha, first public download ever available - although sources can be checked out or browsed without limit. Followed shortly by a bugfix version, Slatt 0.2.1 alpha. Further, there remains a tiny trivial bug in rerulattice.py, corrected in the sources since dec 19th but which did not warrant a new download. Get that file by browsing through the trunk sources if you wish. &lt;/p&gt;
&lt;h1 id="details"&gt;Details&lt;/h1&gt;
&lt;p&gt;As of the creation of this page, the code was able to find association rules but through a somewhat chaotic structure. There were a number of desirable variants: what sort of rules are output among various sets or bases, what info is necessary for it, maybe just closures, maybe minimal generators; how to output rules and compare the output rule sets; and maybe we can also support a simulator of the Angluin-Frazier-Pitt query learner for implications. This is likely to lead to several branches, and the project creator has decided to open a project in Google Code for this. &lt;/p&gt;
&lt;p&gt;The project is slowly developing since. See the page &lt;a class="" href="/p/slatt/wiki/AboutTheTrunk"&gt;AboutTheTrunk&lt;/a&gt;. &lt;/p&gt;
&lt;p&gt;Add your content here. Format your content with: &lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Text in &lt;strong&gt;bold&lt;/strong&gt; or &lt;em&gt;italic&lt;/em&gt;&lt;/li&gt;
&lt;li&gt;Headings, paragraphs, and lists &lt;/li&gt;
&lt;li&gt;Automatic links to other wiki pages &lt;/li&gt;
&lt;/ul&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Anonymous</dc:creator><pubDate>Sat, 28 Mar 2015 13:34:13 -0000</pubDate><guid>https://sourceforge.net53c03c5246d0e9e63c02ec6161304b9c502b5170</guid></item></channel></rss>