<?xml version="1.0" encoding="UTF-8"?>
<commit>
  <added type="array"/>
  <modified type="array">
    <modified>
      <diff>@@ -1,3 +1,6 @@
+== 0.2.2 2008-09-13
+* updated all the docs for the association rules. preped the first gem
+
 == 0.2.1 2008-09-12
 * updated requirements to check for the proper rubygems version 
 </diff>
      <filename>History.txt</filename>
    </modified>
    <modified>
      <diff>@@ -68,15 +68,15 @@ This document is not an introduction to the Apriori algorithm. To find out more
   puts rules.join(&quot;\n&quot;)
 
   # Results: 
-  # doritos &lt;- beer (33.3/2, 100.0)
-  # beer &lt;- doritos (50.0/3, 66.7)
-  # apple &lt;- doritos (50.0/3, 33.3)
-  # doritos &lt;- apple (66.7/4, 25.0)
-  # apple &lt;- cheese (50.0/3, 100.0)
-  # cheese &lt;- apple (66.7/4, 75.0)
+  # beer -&gt; doritos (33.3/2, 100.0)
+  # doritos -&gt; beer (50.0/3, 66.7)
+  # doritos -&gt; apple (50.0/3, 33.3)
+  # apple -&gt; doritos (66.7/4, 25.0)
+  # cheese -&gt; apple (50.0/3, 100.0)
+  # apple -&gt; cheese (66.7/4, 75.0)
 
   # NOTE:
-  # doritos &lt;- beer (33.3/2, 100.0)
+  # beer -&gt; doritos (33.3/2, 100.0)
   # means: 
   # * beer appears in 33.3% (2 total) of the transactions (the support)
   # * beer implies doritos 100% of the time (the confidence)</diff>
      <filename>README.txt</filename>
    </modified>
    <modified>
      <diff>@@ -17,16 +17,16 @@ rules = Apriori.find_association_rules(transactions,
 
 puts rules.join(&quot;\n&quot;)
 
-# RETURNS: 
-# doritos &lt;- beer (33.3/2, 100.0)
-# beer &lt;- doritos (50.0/3, 66.7)
-# apple &lt;- doritos (50.0/3, 33.3)
-# doritos &lt;- apple (66.7/4, 25.0)
-# apple &lt;- cheese (50.0/3, 100.0)
-# cheese &lt;- apple (66.7/4, 75.0)
+# Results: 
+# beer -&gt; doritos (33.3/2, 100.0)
+# doritos -&gt; beer (50.0/3, 66.7)
+# doritos -&gt; apple (50.0/3, 33.3)
+# apple -&gt; doritos (66.7/4, 25.0)
+# cheese -&gt; apple (50.0/3, 100.0)
+# apple -&gt; cheese (66.7/4, 75.0)
 
 # NOTE:
-# doritos &lt;- beer (33.3/2, 100.0)
+# beer -&gt; doritos (33.3/2, 100.0)
 # means: 
 # * beer appears in 33.3% (2 total) of the transactions (the support)
 # * beer implies doritos 100% of the time (the confidence)</diff>
      <filename>examples/01_simple_example.rb</filename>
    </modified>
    <modified>
      <diff>@@ -41,6 +41,10 @@ module Apriori
       # Given +line+ returns an Itemset 
       # Example of a line:
       #   foo &lt;- bar baz bangle (66.7/4, 75.0)
+      # 
+      # Note that this is the opposite order of how apriori.rb returns the
+      # AssociationRule#to_s.  (apriori.rb returns the antecedent on the left
+      # and consequent on the right)
       def parse_line(line)
         is = new
         line =~ /(.+)\s+&lt;-\s+(.+?)\s+\((\d+\.\d)(?:\/(\d+))?,\s+(\d+\.\d)\)/
@@ -56,6 +60,10 @@ module Apriori
 
     # Returns the standard form of this rule as a string. For instance:
     #   bar baz bangle -&gt; foo (66.7/4, 75.0)
+    # # (antecedent)     (consequent)
+    #
+    # Note that this order is the opposite order of the association rules returned by apriori.c
+    # I believe this format reads more naturally.
     def to_s
       # &quot;%s &lt;- %s (%0.01f%s, %0.01f)&quot; % [ consequent, 
       #   antecedent.join(&quot; &quot;), </diff>
      <filename>lib/apriori/association_rule.rb</filename>
    </modified>
    <modified>
      <diff>@@ -2,7 +2,7 @@ module Apriori
   module VERSION #:nodoc:
     MAJOR = 0
     MINOR = 2
-    TINY  = 1
+    TINY  = 2
 
     STRING = [MAJOR, MINOR, TINY].join('.')
   end</diff>
      <filename>lib/apriori/version.rb</filename>
    </modified>
    <modified>
      <diff>@@ -47,7 +47,7 @@ large sets of transactions. This library provides a Ruby interface to Christian
 Borgelt&amp;#8217;s C implementation of this algorithm.&lt;/p&gt;
 
 
-	&lt;p&gt;From Christian Borgelt&amp;#8217;s Apriori:http://www.borgelt.net/apriori.html documentation:&lt;/p&gt;
+	&lt;p&gt;From &lt;a href=&quot;http://www.borgelt.net/apriori.html&quot;&gt;Christian Borgelt&amp;#8217;s Apriori&lt;/a&gt; documentation:&lt;/p&gt;
 
 
 	&lt;blockquote&gt;
@@ -147,13 +147,16 @@ Borgelt&amp;#8217;s C implementation of this algorithm.&lt;/p&gt;
 	&lt;p&gt;See the &lt;ins&gt;examples&lt;/ins&gt; directory for more examples of usage.&lt;/p&gt;
 
 
-	&lt;h2&gt;Forum&lt;/h2&gt;
+	&lt;h2&gt;Rdoc&lt;/h2&gt;
 
 
-	&lt;p&gt;&lt;a href=&quot;http://groups.google.com/group/apriori&quot;&gt;http://groups.google.com/group/apriori&lt;/a&gt;&lt;/p&gt;
+	&lt;p&gt;&lt;a href=&quot;http://apriori.rubyforge.org/rdoc/&quot;&gt;View the rdoc here&lt;/a&gt;&lt;/p&gt;
 
 
-	&lt;p&gt;&lt;span class=&quot;caps&quot;&gt;TODO&lt;/span&gt; &amp;#8211; create Google Group &amp;#8211; apriori&lt;/p&gt;
+	&lt;h2&gt;Mailing List&lt;/h2&gt;
+
+
+	&lt;p&gt;&lt;a href=&quot;http://rubyforge.org/mail/?group_id=6948&quot;&gt;Rubyforge Mailing List&lt;/a&gt;&lt;/p&gt;
 
 
 	&lt;h2&gt;How to submit patches&lt;/h2&gt;
@@ -173,7 +176,7 @@ Borgelt&amp;#8217;s C implementation of this algorithm.&lt;/p&gt;
 rake test
 rake install_gem&lt;/pre&gt;
 
-	&lt;p&gt;h3.&lt;/p&gt;
+	&lt;h3&gt;&lt;tt&gt;add_development_dependency&lt;/tt&gt; error&lt;/h3&gt;
 
 
 	&lt;p&gt;If you get the error:&lt;/p&gt;
@@ -237,7 +240,7 @@ included in all copies or substantial portions of the Software.&lt;/p&gt;
 
 	&lt;p&gt;Comments are welcome. Send an email to &lt;a href=&quot;mailto:nate@natemurray.com&quot;&gt;Nate Murray&lt;/a&gt; via the &lt;a href=&quot;http://groups.google.com/group/apriori&quot;&gt;forum&lt;/a&gt;&lt;/p&gt;
     &lt;p class=&quot;coda&quot;&gt;
-      &lt;a href=&quot;nate@natemurray.com&quot;&gt;Nate Murray&lt;/a&gt;, 8th September 2008&lt;br&gt;
+      &lt;a href=&quot;nate@natemurray.com&quot;&gt;Nate Murray&lt;/a&gt;, 18th September 2008&lt;br&gt;
       Theme extended from &lt;a href=&quot;http://rb2js.rubyforge.org/&quot;&gt;Paul Battley&lt;/a&gt;
     &lt;/p&gt;
 &lt;/div&gt;</diff>
      <filename>website/index.html</filename>
    </modified>
    <modified>
      <diff>@@ -9,7 +9,7 @@ Ruby Apriori is a library to efficiently find item association rules within
 large sets of transactions. This library provides a Ruby interface to Christian
 Borgelt's C implementation of this algorithm.
 
-From Christian Borgelt's Apriori:http://www.borgelt.net/apriori.html documentation: 
+From &quot;Christian Borgelt's Apriori&quot;:http://www.borgelt.net/apriori.html documentation: 
 
 bq. Association rule induction is a powerful method for so-called market basket
     analysis, which aims at finding regularities in the shopping behavior of
@@ -68,15 +68,15 @@ h2. Demonstration of usage
   puts rules.join(&quot;\n&quot;)
 
   # Results: 
-  # doritos &lt;- beer (33.3/2, 100.0)
-  # beer &lt;- doritos (50.0/3, 66.7)
-  # apple &lt;- doritos (50.0/3, 33.3)
-  # doritos &lt;- apple (66.7/4, 25.0)
-  # apple &lt;- cheese (50.0/3, 100.0)
-  # cheese &lt;- apple (66.7/4, 75.0)
+  # beer -&gt; doritos (33.3/2, 100.0)
+  # doritos -&gt; beer (50.0/3, 66.7)
+  # doritos -&gt; apple (50.0/3, 33.3)
+  # apple -&gt; doritos (66.7/4, 25.0)
+  # cheese -&gt; apple (50.0/3, 100.0)
+  # apple -&gt; cheese (66.7/4, 75.0)
 
   # NOTE:
-  # doritos &lt;- beer (33.3/2, 100.0)
+  # beer -&gt; doritos (33.3/2, 100.0)
   # means: 
   # * beer appears in 33.3% (2 total) of the transactions (the support)
   # * beer implies doritos 100% of the time (the confidence)
@@ -84,11 +84,13 @@ h2. Demonstration of usage
 
 See the +examples+ directory for more examples of usage.
 
-h2. Forum
+h2. Rdoc
 
-&quot;http://groups.google.com/group/apriori&quot;:http://groups.google.com/group/apriori
+&quot;View the rdoc here&quot;:http://apriori.rubyforge.org/rdoc/
 
-TODO - create Google Group - apriori
+h2. Mailing List
+
+&quot;Rubyforge Mailing List&quot;:http://rubyforge.org/mail/?group_id=6948
 
 h2. How to submit patches
 
@@ -102,7 +104,7 @@ h3. Build and test instructions
 rake test
 rake install_gem&lt;/pre&gt;
 
-h3.
+h3. &lt;tt&gt;add_development_dependency&lt;/tt&gt; error
 
 If you get the error:
 </diff>
      <filename>website/index.txt</filename>
    </modified>
  </modified>
  <removed type="array"/>
  <parents type="array">
    <parent>
      <id>48f18f6aab3c61a67752d656887c16ad51b032cc</id>
    </parent>
  </parents>
  <author>
    <name>Nate Murray</name>
    <email>nate@natemurray.com</email>
  </author>
  <url>http://github.com/jashmenn/apriori/commit/c911a32b750648b275ae137a83118b9d2ac98d76</url>
  <id>c911a32b750648b275ae137a83118b9d2ac98d76</id>
  <committed-date>2008-09-18T09:15:53-07:00</committed-date>
  <authored-date>2008-09-18T09:15:53-07:00</authored-date>
  <message>v0.2.2 - updated docs, cleaning rough edges for gem</message>
  <tree>1d138145bc73d33500aa563b60d6ad121357ea2b</tree>
  <committer>
    <name>Nate Murray</name>
    <email>nate@natemurray.com</email>
  </committer>
</commit>
