fpgrowth 0.0.1 → 0.0.2

data/README.md

@@ -7,7 +7,7 @@ Ruby implementation of FP-Growth
 FP-Growth is an algorithm used for mining frequent pattern in an item set. Such pattern are then used to build association rules.
 Literature example is { Potatoes, Onions } => { Burger } or { Beer, Chips } => { Dippers }.
 
-FP-Growth is known as a solution for Mining without Candidate generation (http://dl.acm.org/citation.cfm?id=335372).
+FP-Growth is known as a solution for Mining without Candidate generation (<http://dl.acm.org/citation.cfm?id=335372>).
 Main alternative to FP-Growth is A Priori which is a pretty much a naive solution. A Priori consist in generating candidate then scanning the database looking for them.
 
 FP-Growth solution is about reducing the database in one simple Tree Structure : The FP-Tree. The FP-Tree make easy to extract frequent pattern from it.
@@ -26,13 +26,13 @@ Imagine a web app allowing you to connect to other users. Such a website want to
 
 Imagine a commercial website showing some products to the users. It will scan users actions and make suggestions like : "People who like this products often like this other one !"
 
-Those applications are now easy thanks to fpgrowth-ruby !
+Those applications are now easy thanks to fpgrowth for Ruby !
 
-## Installation
+# Installation
 
 Add this line to your application's Gemfile:
 
-    gem 'fpgrowth-ruby'
+    gem 'fpgrowth'
 
 And then execute:
 
@@ -59,23 +59,27 @@ The larger is the number of transactions, the smaller should be the threshold. I
 
 ```ruby
 transactions = [['a', 'b'], ['b'], ['b', 'c'], ['a', 'b']]
-fp_tree = FpGrowth::FpTree.build(transactions, 30) # 30 stands for 30% of transactions. Here, 'c' would be pruned.
+fp_tree = FpGrowth::FpTree.build(transactions, 30)
+# 30 stands for 30% of transactions. Here, 'c' would be pruned.
 FpGrowth::Miner.fp_growth(fp_tree)
 
 ```
 
+### Examples
+
+You can find in the test repository a few concrete example on Open Data.
 
 
 ## Development : Next steps
 
 As we said, worst case is a is a DataSet with long transactions and where each item is significantly frequent. Solution would be to higher the threshold level, which would result in data-loss, maybe critical data would be lost...
 
-A better solution, described is following articles : [http://dl.acm.org/citation.cfm?id=1133907 , http://link.springer.com/chapter/10.1007/978-3-540-24775-3_19]
+A better solution, described is following articles : [<http://dl.acm.org/citation.cfm?id=1133907> , <http://link.springer.com/chapter/10.1007/978-3-540-24775-3_19>]
 Main concept is pruning the tree, once built in order to remove the less significant patterns. This is necessary to allow developer to prune his tree, losing least frequent pattern, in order to quickly obtain the most frequent ones.
 
 This is next step in our Roadmap.
 
-This is also a necessary step for allowing a Top-Down FP-Growth implementation as described in : http://link.springer.com/chapter/10.1007/3-540-47887-6_34
+This is also a necessary step for allowing a Top-Down FP-Growth implementation as described in : <http://link.springer.com/chapter/10.1007/3-540-47887-6_34>
 
 This last implementation is more scalable and more efficient than the current one.
 

data/fpgrowth-ruby.gemspec

@@ -10,7 +10,7 @@ Gem::Specification.new do |spec|
   spec.email         = ["dam.cavailles@laposte.net"]
   spec.description   = %q{FP-Growth implementation}
   spec.summary       = %q{FP-Growth is mean to detect}
-  spec.homepage      = ""
+  spec.homepage      = "https://github.com/thedamfr/fpgrowth"
   spec.license       = "MIT"
 
   spec.files         = `git ls-files`.split($/)

data/lib/fpgrowth/fp_tree/builder/first_pass.rb

@@ -1,4 +1,3 @@
-require "fpgrowth/models/transaction"
 
 module FpGrowth
   module FpTree

data/lib/fpgrowth/miner/conditional_tree_builder.rb

@@ -74,12 +74,12 @@ module FpGrowth
       end
 
 
-      def sort_by_support(pattern_base)
-        lookup = @fp_tree.item_order_lookup
-
+      def sort_by_support(pattern_base, fp_tree=@fp_tree)
+        lookup = fp_tree.item_order_lookup
         pattern_base.content.sort_by! do |item|
-          lookup.fetch(item, lookup.size + 1)
+          fp_tree.supports.fetch(item, fp_tree.supports.size + 1)
         end
+        pattern_base.content.reverse!
         return pattern_base
       end
 
@@ -117,6 +117,24 @@ module FpGrowth
         traverse(cursor_tree, Pattern.new(pattern_base.content[1..-1], pattern_base.support))
       end
 
+      #fonction qui sert uniquement pour les tests
+      def test_execute_threshold(value = 1)
+        if   value == @threshold
+        then  return true
+        end
+        return false
+      end
+
+      def test_execute_pattern_base(value = [])
+        if  value == @pattern_base
+        then  return true
+        end
+        return false
+      end
+
+
+
+
 
     end
   end

data/lib/fpgrowth/miner.rb

@@ -42,7 +42,7 @@ module FpGrowth
               pattern_beta << node
             end
             @pattern_set << pattern_beta
-            puts "Pattern extracted : #{pattern_beta.content.to_s}"
+            #puts "Pattern extracted : #{pattern_beta.content.to_s}"
           end
         else
           for item in fp_tree.supports.keys

data/lib/fpgrowth/version.rb

@@ -1,3 +1,3 @@
 module FpGrowth
-  VERSION = "0.0.1"
+  VERSION = "0.0.2"
 end

data/test/enel/3_canada_i_processi_e_i_prodotti_1.csv

@@ -0,0 +1,14 @@
+ENEL - Canada - I processi e i prodotti	Unità di misura	2007	2008	2009	2010	2011
+Produzione di energia elettrica (netta)						
+Da fonti rinnovabili	milioni di kWh	323	180	251	281	285
+biomassa e parte biodegradabile dei rifiuti 	milioni di kWh	175	172	149	182	175
+combinata con produzione di calore	milioni di kWh	175	172	149	182	175
+idrica da apporti naturali	milioni di kWh	148	0	0	0	0
+eolica	milioni di kWh	0	7.82	102	99.0	110
+Totale	milioni di kWh	323	180	251	281	285
+semplice	milioni di kWh	148	7.82	102	99.0	110
+combinata con produzione di calore	milioni di kWh	175	172	149	182	175
+"Produzione utile di calore (combinata con
+produzione di energia elettrica)"						
+In impianti termoelettrici (biomassa e parte biodegradabile dei rifiuti)	milioni di kcal	"29,626"	"30,149"	"23,042"	"32,524"	"29,117"
+In impianti termoelettrici (biomassa e parte biodegradabile dei rifiuti)	milioni di kWh	34.5	35.1	26.8	37.8	33.9

data/test/enel/Produzione_Impianti_Termoelettrici_en.csv

@@ -0,0 +1,46 @@
+Regione	Provincia	Comune	Centrale	Tipo	Sezioni	Potenza Lorda (MW)
+Piemonte	Vercelli	Trino	"Termoelettrica  ""Galileo Ferraris"" Trino (VC)"	Ciclo Combinato 	2	744
+	Alessandria	Alessandria	Termoelettrica Alessandria	Turbogas	2	176
+Veneto	Rovigo	Porto Tolle	Termoelettrica Porto Tolle	Olio  	4	"2,640"
+	Venezia	Venezia	"Termoelettrica ""Andrea Palladio"" Fusina (VE)"	Carbone / Metano / CDR / Olio / Idrogeno	6	"1,148"
+	Venezia	Venezia	Termoelettrica Porto Marghera	Carbone	2	140
+Emilia Romagna	Piacenza	Castel San Giovanni	"Termoelettrica ""Edoardo Amaldi"" La Casella (PC)"	Ciclo Combinato	4	"1,558"
+	Ravenna	Porto Corsini	"Termoelettrica ""Teodora"" Porto Corsini (RA)"	Ciclo Combinato 	2	761
+	Modena	Carpi	Termoelettrica Carpi Modenese	Turbogas	2	176
+Liguria	La Spezia	La Spezia	"Termoelettrica ""Eugenio Montale"" La Spezia (SP)"	Ciclo Combinato / Carbone	3	"1,282"
+	Genova	Genova	Termoelettrica Genova	Carbone 	3	295
+Toscana	Livorno	Piombino	Termoelettrica Piombino	Olio	4	"1,280"
+	Livorno	Livorno	Termoelettrica Livorno	Olio  	2	310
+	Livorno	Porto Ferraio	Termoelettrica Porto Ferraio	Diesel	1	17
+	Livorno	Isola  Capraia	Termoelettrica Capraia	Diesel	4	1.7
+	Arezzo	Cavriglia	"Termoelettrica ""Santa Barbara"" Cavriglia (AR)"	Ciclo Combinato 	1	394
+Marche	Ancona	Camerata Picena	Termoelettrica Camerata Picena	Turbogas	4	104
+Umbria	Perugia	Piegaro	"Termoelettrica ""Franco Rasetti"" Pietrafitta - Piegaro (PG)"	Turbogas / Ciclo Combinato	3	535
+	Perugia	Gualdo Cattaneo	"Termoelettrica ""Pietro Vannucci"" Bastardo - Giano dell' Umbria  (PG)"	Carbone	2	150
+Lazio	Viterbo	Montalto di Castro	"Termoelettrica ""Alessandro Volta"" Montalto di Castro (VT)"	Olio  / Gas Naturale	4	"3,580"
+	Roma	Civitavecchia	Termoelettrica Torrevaldaliga Nord	Carbone	3	"1,980"
+	Latina	Isola Ventotene	Termoelettrica Ventotene	Diesel	4	1.92
+Molise	Campobasso	Larino	Termoelettrica Larino	Turbogas	2	250
+	Campobasso	Campomarino	Termoelettrica Campomarino	Turbogas	1	88
+Campania	Napoli	Giugliano in Campania	Termoelettrica Giugliano	Turbogas	4	352
+	Caserta	Maddaloni	Termoelettrica Maddaloni	Turbogas	4	352
+Puglia	Brindisi	Brindisi	"Termoelettrica ""Federico II"" Brindisi"	Carbone	4	"2,640"
+	Bari	Bari	Termoelettrica Bari	Olio - Gas	3	206
+Calabria	Cosenza	Rossano Calabro	Termoelettrica Rossano	Olio - Gas	4	"1,738"
+	Cosenza	Laino Borgo	Termoelettrica Mercure	Biomasse	1	41
+Sicilia	Palermo	Termini Imerese	"Termoelettrica ""Ettore Majorana"""	 Gas / Turbogas / Ciclo Combinato	4	"1,330"
+	Siracusa	Priolo Gargallo	"Termoelettrica ""Archimede"""	Ciclo Combinato	2	780
+	Siracusa	Augusta	Termoelettrica Augusta	Olio	3	210
+	Agrigento	Porto Empedocle	Termoelettrica Porto Empedocle	Olio 	2	140
+"Sicilia
+( Isole EOLIE)"	Messina	Lipari	Termoelettrica Vulcano	Diesel	6	8.96
+	Messina	Lipari	Termoelettrica Panarea	Diesel	6	4
+	Messina	Lipari	Termoelettrica Stromboli	Diesel	6	3.1
+	Messina	Lipari	Termoelettrica Filicudi	Diesel	6	1.5
+	Messina	Lipari	Termoelettrica Alicudi	Diesel	3	0.5
+	Messina	Santa Maria Salina	Termoelettrica Santa Maria Salina	Diesel	5	4.4
+	Messina	Malfa	Termoelettrica Malfa	Diesel	2	2.2
+Sardegna	Carbonia-Iglesias	Portoscuso	"Termoelettrica ""Grazia Deledda"" Sulcis "	Carbone / Biomasse	2	590
+	Carbonia-Iglesias	Portoscuso	Termoelettrica Portoscuso	Olio 	2	320
+	Cagliari	Assemini	Termoelettrica Assemini	Turbogas	2	177
+					Totale (MW)	"26,510"

data/test/tc_conditional_tree_builder.rb

@@ -0,0 +1,135 @@
+require 'test/unit'
+require "fpgrowth/miner"
+require "fpgrowth/fp_tree"
+
+class TestConditionalTreeBuilder < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+
+    @tableau_pattern = []
+    @tableau_pattern << FpGrowth::Miner::Pattern.new(['a', 'b'], 2)
+    @tableau_pattern << FpGrowth::Miner::Pattern.new(['a', 'b', 'c'], 2)
+    @tableau_pattern << FpGrowth::Miner::Pattern.new(['b', 'c'], 1)
+
+    @tableau_pattern_one_element = []
+    @tableau_pattern_one_element << FpGrowth::Miner::Pattern.new(['a'], 12)
+
+    @supports_exemple = {'a' => 1, 'b' => 5, 'c' => 4}
+    @pattern_exemple = FpGrowth::Miner::Pattern.new(['a', 'b'], 2)
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+
+  #  test initialiser
+  def test_initialize
+    conditional_tree_builder = nil
+
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new() }
+    assert_equal(true, conditional_tree_builder.test_execute_threshold(1))
+    assert_equal(true, conditional_tree_builder.test_execute_pattern_base())
+
+    #initialisation avec un argument
+
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new(@tableau_pattern) }
+    assert_equal(true, conditional_tree_builder.test_execute_pattern_base(@tableau_pattern))
+    assert_equal(true, conditional_tree_builder.test_execute_threshold)
+
+    #initialisation avec deux arguments
+
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new(@tableau_pattern, 3) }
+    assert_equal(true, conditional_tree_builder.test_execute_pattern_base(@tableau_pattern))
+    assert_equal(true, conditional_tree_builder.test_execute_threshold(3))
+
+  end
+
+
+  def test_execute
+
+
+  end
+
+  def test_second_pass
+
+  end
+
+  def test_first_pass
+
+  end
+
+  def test_scan
+
+    # with no argument
+    conditional_tree_builder = nil
+    supports = nil
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new() }
+    assert_nothing_raised { supports = conditional_tree_builder.scan() }
+    assert_equal(Hash.new(0), supports)
+
+    #with one argument
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new(@tableau_pattern) }
+    assert_nothing_raised { supports = conditional_tree_builder.scan() }
+    assert_equal(4, supports['a'])
+    assert_equal(5, supports['b'])
+    assert_equal(3, supports['c'])
+
+  end
+
+  def test_pruning
+
+  end
+
+  def test_sort
+    conditional_tree_builder = nil
+    supports = nil
+
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new() }
+
+
+    #with one argument
+    assert_nothing_raised { supports = conditional_tree_builder.sort(@supports_exemple) }
+    assert_equal(1, supports['a'])
+    assert_equal(5, supports['b'])
+    assert_equal(4, supports['c'])
+    assert_equal('b', supports.keys[0])
+    assert_equal('c', supports.keys[1])
+    assert_equal('a', supports.keys[2])
+  end
+
+  def test_sort_by_support
+    conditional_tree_builder = nil
+    pattern_base = nil
+    fp_tree = nil
+    # One element
+    assert_nothing_raised { fp_tree = FpGrowth::FpTree::FpTree.new(@supports_exemple) }
+    assert_nothing_raised { conditional_tree_builder = FpGrowth::Miner::ConditionalTreeBuilder.new(@tableau_pattern_one_element) }
+    assert_nothing_raised { pattern_base = conditional_tree_builder.sort_by_support(@tableau_pattern_one_element.first, fp_tree) }
+    assert_equal(@tableau_pattern_one_element.first, pattern_base)
+
+    #Two element
+    assert_nothing_raised { pattern_base = conditional_tree_builder.sort_by_support(@pattern_exemple, fp_tree) }
+
+    assert_equal(['b', 'a'], pattern_base.content, "en plus, #{fp_tree.supports.to_s}")
+    assert_equal(2, pattern_base.support)
+
+    #Two element
+    assert_nothing_raised { pattern_base = conditional_tree_builder.sort_by_support(FpGrowth::Miner::Pattern.new(['a','b','c'],2), fp_tree) }
+
+    assert_equal(['b', 'c', 'a'], pattern_base.content, "en plus, #{fp_tree.supports.to_s}")
+    assert_equal(2, pattern_base.support)
+
+
+  end
+
+  def test_traverse
+
+  end
+
+
+end

data/test/tc_open_data_enel.rb

@@ -0,0 +1,73 @@
+require 'test/unit'
+
+class TestEnelOpenData < Test::Unit::TestCase
+
+
+  def setup
+    @transactions_canada_processi_prodotti = []
+    CSV.foreach("test/enel/3_canada_i_processi_e_i_prodotti_1.csv", {:headers => true, :header_converters => :symbol, :header_converters => :symbol, :converters => :all, :col_sep => "\t"}) do |row|
+      @transactions_canada_processi_prodotti << row.to_a
+    end
+    @transactions_produzione_impianti_termoelecttrici = []
+    CSV.foreach("test/enel/Produzione_Impianti_Termoelettrici_en.csv", {:headers => true, :header_converters => :symbol, :header_converters => :symbol, :converters => :all, :col_sep => "\t"}) do |row|
+      transaction = [[:tipo, [row[:tipo]]], [:sezioni, row[:sezioni]]]
+      potenza_lorda = row[:potenza_lorda_mw].to_s.gsub(',', '').to_i
+      if potenza_lorda < 10
+        transaction << [:lorda_order, "<10"]
+      elsif potenza_lorda > 10 and potenza_lorda < 100
+        transaction << [:lorda_order, ">10"]
+      elsif potenza_lorda > 100 and potenza_lorda < 1000
+        transaction << [:lorda_order, ">100"]
+      elsif potenza_lorda > 1000
+        transaction << [:lorda_order, ">1000"]
+      end
+      transaction.delete_if { |item| item[1]==nil }
+      @transactions_produzione_impianti_termoelecttrici << transaction
+    end
+  end
+
+  def teardown
+
+  end
+
+  def test_canada_processi_prodotti
+
+    start = Time.now
+    fp_tree = FpGrowth::FpTree.build(@transactions_canada_processi_prodotti, 1)
+    loop = Time.now
+    puts "Tree built in #{loop - start}"
+
+    patterns = FpGrowth::Miner.fp_growth(fp_tree)
+
+    finish = Time.now
+    puts "Tree Mined in #{finish -start}"
+
+    patterns.sort! { |a, b| a.support <=> b.support }.reverse!
+
+    #patterns.each { |pattern| puts "<#{pattern.content}:#{pattern.support}>"}
+
+
+    assert_not_equal(0, patterns.size)
+
+  end
+
+  def test_canada_produzione_impianti_termoelecttrici
+
+    start = Time.now
+    fp_tree = FpGrowth::FpTree.build(@transactions_produzione_impianti_termoelecttrici, 1)
+    loop = Time.now
+    puts "Tree built in #{loop - start}"
+    patterns = FpGrowth::Miner.fp_growth(fp_tree)
+    finish = Time.now
+    puts "Tree Mined in #{finish - start}"
+
+    patterns.sort! { |a, b| a.support <=> b.support }
+    patterns.sort! { |a, b| a.content.length <=> b.content.length }
+
+    assert_not_equal(0, patterns.size)
+
+    #patterns.each { |pattern| puts "<#{pattern.content}:#{pattern.support}>" if pattern.support > 1}
+
+  end
+
+end

data/test/tc_open_data_sondage_montreal.rb

@@ -24,8 +24,8 @@ class TestOpenDataMTLSondage < Test::Unit::TestCase
     # Do nothing
   end
 
-  # Fake test
-  def test_fp_growth
+
+  def  fp_growth
 
     d = Time.now
     puts "Start time : "+d.to_s
@@ -33,17 +33,17 @@ class TestOpenDataMTLSondage < Test::Unit::TestCase
     fp_tree = FpGrowth::FpTree.build(@transactions, 1)
 
     puts "Tree built at :"+Time.now.to_s
-    patterns = FpGrowth::Miner.fp_growth(fp_tree)
-
-    f=Time.now
-    puts "Mining took #{(f-d)}sec"
-
-    patterns.sort! { |a, b| a.support <=> b.support }.reverse!
-
-    for pattern in patterns
-      puts "#{pattern.content} #{pattern.support}"
-    end
-
-    assert_not_equal(0, patterns.size)
+    #patterns = FpGrowth::Miner.fp_growth(fp_tree)
+    #
+    #f=Time.now
+    #puts "Mining took #{(f-d)}sec"
+    #
+    #patterns.sort! { |a, b| a.support <=> b.support }.reverse!
+    #
+    #for pattern in patterns
+    #  puts "#{pattern.content} #{pattern.support}"
+    #end
+    #
+    #assert_not_equal(0, patterns.size)
   end
 end

data/test/tc_open_data_velo_montreal.rb

@@ -10,26 +10,7 @@ class TestOpenDataVelo < Test::Unit::TestCase
     @transactions = []
     CSV.foreach("test/montreal-velos-comptage/2012.csv", {:headers => true, :header_converters => :symbol, :header_converters => :symbol, :converters => :all, :encoding => 'windows-1251:utf-8', :col_sep => ";"}) do |row|
       date = Date.parse(row[:date])
-      @transactions << [ [:wday, date.wday], [:month, date.month], [:date, row[:date]], [:berri, row[:berri_1]], [:ctesaintecatherine, row[:ctesaintecatherine]], [:maisonneuve_1, row[:maisonneuve_1]], [:maisonneuve_2, row[:maisonneuve_2]], [:du_parc, row[:du_parc]], [:pierredupuy, row[:pierredupuy]], [:rachel, row[:rachel1]]]
-    end
-
-
-    CSV.foreach("test/montreal-velos-comptage/2011.csv", {:headers => true, :header_converters => :symbol, :header_converters => :symbol, :converters => :all, :encoding => 'windows-1251:utf-8', :col_sep => ";"}) do |row|
-
-      date = Date.parse(row[:date])
-      mois = date.month
-      mois = 2 if row[:date].to_s.match("/f.vr/")
-      mois = 3 if row[:date].to_s.include?("avr")
-      mois = 5 if row[:date].to_s.include?("mai")
-      mois = 6 if row[:date].to_s.include?("juin")
-      mois = 7 if row[:date].to_s.include?("juil")
-      mois = 8 if row[:date].to_s.match("/ao.t/")
-      mois = 9 if row[:date].to_s.match("/d.c/")
-      date = Date.new(2011, mois, date.day)
-      transaction = [ [:wday, date.wday], [:month, date.month], [:date, row[:date]], [:berri, row[:berri]], [:ctesaintecatherine, row[:ctesaintecatherine]], [:maisonneuve_1, row[:maisonneuve_1]], [:maisonneuve_2, row[:maisonneuve_2]], [:du_parc, row[:du_parc]], [:pierredupuy, row[:pierredupuy]], [:rachel, row[:rachel]]]
-
-      transaction.delete_if { |x| x[1]==nil }
-      @transactions << transaction
+      @transactions << [[:wday, date.wday], [:month, date.month], [:date, row[:date]], [:berri, row[:berri_1]], [:ctesaintecatherine, row[:ctesaintecatherine]], [:maisonneuve_1, row[:maisonneuve_1]], [:maisonneuve_2, row[:maisonneuve_2]], [:du_parc, row[:du_parc]], [:pierredupuy, row[:pierredupuy]], [:rachel, row[:rachel1]]]
     end
 
 
@@ -42,9 +23,16 @@ class TestOpenDataVelo < Test::Unit::TestCase
 
   # Fake test
   def test_fp_growth
+    start = Time.now
     fp_tree = FpGrowth::FpTree.build(@transactions, 1)
+    loop = Time.now
+    puts "Tree built in #{loop - start}"
+
     patterns = FpGrowth::Miner.fp_growth(fp_tree)
 
+    finish = Time.now
+    puts "Tree Mined in #{finish -start}"
+
     patterns.sort! { |a, b| a.support <=> b.support }.reverse!
 
 =begin

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: fpgrowth
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-05-29 00:00:00.000000000 Z
+date: 2013-05-30 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -75,21 +75,25 @@ files:
 - lib/fpgrowth/miner/pattern.rb
 - lib/fpgrowth/miner/pattern_base_extractor.rb
 - lib/fpgrowth/version.rb
+- test/enel/3_canada_i_processi_e_i_prodotti_1.csv
+- test/enel/Produzione_Impianti_Termoelettrici_en.csv
 - test/montreal-sondage/mtlsat12.csv
 - test/montreal-velos-comptage/2009.csv
 - test/montreal-velos-comptage/2010.csv
 - test/montreal-velos-comptage/2011.csv
 - test/montreal-velos-comptage/2012.csv
 - test/tc_builder.rb
+- test/tc_conditional_tree_builder.rb
 - test/tc_first_pass.rb
 - test/tc_fp_tree.rb
 - test/tc_miner.rb
 - test/tc_node.rb
+- test/tc_open_data_enel.rb
 - test/tc_open_data_sondage_montreal.rb
 - test/tc_open_data_velo_montreal.rb
 - test/tc_pattern.rb
 - test/tc_second_pass.rb
-homepage: ''
+homepage: https://github.com/thedamfr/fpgrowth
 licenses:
 - MIT
 post_install_message: 
@@ -115,16 +119,20 @@ signing_key:
 specification_version: 3
 summary: FP-Growth is mean to detect
 test_files:
+- test/enel/3_canada_i_processi_e_i_prodotti_1.csv
+- test/enel/Produzione_Impianti_Termoelettrici_en.csv
 - test/montreal-sondage/mtlsat12.csv
 - test/montreal-velos-comptage/2009.csv
 - test/montreal-velos-comptage/2010.csv
 - test/montreal-velos-comptage/2011.csv
 - test/montreal-velos-comptage/2012.csv
 - test/tc_builder.rb
+- test/tc_conditional_tree_builder.rb
 - test/tc_first_pass.rb
 - test/tc_fp_tree.rb
 - test/tc_miner.rb
 - test/tc_node.rb
+- test/tc_open_data_enel.rb
 - test/tc_open_data_sondage_montreal.rb
 - test/tc_open_data_velo_montreal.rb
 - test/tc_pattern.rb