ai4ruby 1.11

data/test/data/statistics_test.rb

@@ -0,0 +1,65 @@
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+
+require 'test/unit'
+require File.dirname(__FILE__) + '/../../lib/ai4r/data/statistics'
+
+module Ai4r
+  module Data
+    class StatisticsTest < Test::Unit::TestCase
+      
+      DELTA = 0.00001
+      
+      def setup
+        @data_set = DataSet.new.
+          parse_csv "#{File.dirname(__FILE__)}/statistics_data_set.csv"
+      end
+    
+      def test_mean
+          assert_equal 2, Statistics.mean(@data_set, 1)
+          assert_equal 2.502, Statistics.mean(@data_set, 0)
+      end
+      
+      def test_variance
+          assert_equal 0, Statistics.variance(@data_set, 1)
+          assert_in_delta 4.47302, Statistics.variance(@data_set, 0), DELTA
+      end
+ 
+     def test_standard_deviation
+          assert_equal 0, Statistics.standard_deviation(@data_set, 1)
+          assert_in_delta 2.11495, Statistics.standard_deviation(@data_set, 0), DELTA
+      end
+ 
+      def test_mode
+        items = [ [ "New York", 25, "Y"],
+                  [ "New York", 55, "Y"],
+                  [ "Chicago", 23, "Y"],
+                  [ "Boston", 23, "N"],
+                  [ "Chicago", 12, "N"],
+                  [ "Chicago", 87, "Y"] ]
+        set = DataSet.new.set_data_items(items)
+        assert_equal "Chicago", Statistics.mode(set,0)
+        assert_equal 23, Statistics.mode(set,1)
+        assert_equal "Y", Statistics.mode(set,2)
+      end
+
+      def test_min
+          assert_equal 2, Statistics.min(@data_set, 1)
+          assert_equal 1, Statistics.min(@data_set, 0)
+      end
+      
+      def test_max
+          assert_equal 2, Statistics.max(@data_set, 1)
+          assert_equal 6, Statistics.max(@data_set, 0)
+          assert_equal 3.7, Statistics.max(@data_set, 2)
+      end      
+      
+    end
+  end
+end

data/test/experiment/classifier_evaluator_test.rb

@@ -0,0 +1,76 @@
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+
+require 'test/unit'
+require File.dirname(__FILE__) + '/../../lib/ai4r/experiment/classifier_evaluator'
+require File.dirname(__FILE__) + '/../../lib/ai4r/classifiers/classifier'
+
+class MockClassifier < Ai4r::Classifiers::Classifier
+  
+  attr_accessor :built
+  
+  def initialize(class_value)
+    @built = false
+    @class_value = class_value
+  end
+  
+  def build(data_set)
+    @built = true
+  end
+  
+  def eval(data)
+    @class_value
+  end
+  
+end
+
+module Ai4r
+  module Experiment
+    class ClassifierEvaluatorTest < Test::Unit::TestCase
+      
+      def test_add_classifier
+        evaluator = ClassifierEvaluator.new
+        evaluator << MockClassifier.new(nil) << MockClassifier.new(nil)
+        evaluator.add_classifier(MockClassifier.new(nil)).
+          add_classifier(MockClassifier.new(nil)).
+          add_classifier(MockClassifier.new(nil))
+        assert_equal 5, evaluator.classifiers.length
+      end
+
+      def test_build
+        evaluator = ClassifierEvaluator.new
+        5.times { evaluator << MockClassifier.new(nil) }
+        evaluator.classifiers.each {|c| assert !c.built}
+        evaluator.build(Ai4r::Data::DataSet.new)
+        evaluator.classifiers.each {|c| assert c.built}
+      end
+      
+      def test_eval
+        evaluator = ClassifierEvaluator.new
+        5.times { |x| evaluator << MockClassifier.new(x) }
+        assert_equal [0, 1, 2, 3, 4], evaluator.eval([])
+      end
+      
+      def test_test
+        evaluator = ClassifierEvaluator.new
+        5.times { |x| evaluator << MockClassifier.new(x) }
+        input = Ai4r::Data::DataSet.new :data_items => 
+          [[0],[0],[0],[1],[2],[3]]
+        output = evaluator.test input
+        assert_equal 5, output.data_items.length # 5 classifiers, 5 result rows
+        output.data_items.each { |result| assert result[1]>=0 && result[1]<1} # eval time
+        assert_equal 3, output.data_items.first[2] # 3 errors for the 1st classifier
+        assert_equal 0.5, output.data_items.first[3] # succes rate
+        assert_equal 6, output.data_items.last[2] # 6 errors for the last classifier
+        assert_equal 0, output.data_items.last[3] # succes rate
+      end
+      
+    end
+  end
+end

data/test/genetic_algorithm/chromosome_test.rb

@@ -0,0 +1,58 @@
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+ 
+
+require File.dirname(__FILE__) + '/../../lib/ai4r/genetic_algorithm/genetic_algorithm'
+
+require 'test/unit'
+
+module Ai4r
+  
+  module GeneticAlgorithm
+
+    COST = [
+              [  0,       10,       12,       21,       25,     25,       34,         26,     28,       11],
+              [ 10,       0,        12,       21,       19,     21,       18,         12,     22,       11],
+              [ 10,       12,       0,        24,       18,     16,       36,         29,     17,       22],
+              [ 20,       12,       22,       0,        32,     34,       28,         24,     31,        9],
+              [ 23,       20,       19,       31,        0,     25,       29,         25,     31,       28],
+              [ 24,       20,       15,       33,       24,      0,       38,         34,     17,       25],
+              [ 33,       19,       35,       29,       24,     34,        0,          9,     38,       28],
+              [ 25,       13,       28,       25,       25,     34,        9,          0,     33,       19],
+              [ 30,       23,       18,       29,       31,     18,       38,         34,      0,       23],
+              [ 11,       11,       22,       9,        28,     26,       27,         19,     22,        0]
+  ]
+
+    class ChromosomeTest < Test::Unit::TestCase
+
+      def test_chromosome_seed
+        Chromosome.set_cost_matrix(COST)
+        chromosome = Chromosome.seed
+        assert_equal [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], chromosome.data.sort
+      end
+
+      def test_fitness
+        Chromosome.set_cost_matrix(COST)
+        chromosome = Chromosome.new([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+        assert_equal( -206, chromosome.fitness)
+      end
+
+      def test_reproduce
+        Chromosome.set_cost_matrix(COST)
+        c1 = Chromosome.new([2, 8, 5, 3, 6, 7, 1, 9, 0, 4])
+        c2 = Chromosome.new([3, 2, 0, 1, 5, 4, 6, 7, 9, 8])
+        c3 = Chromosome.reproduce(c1, c2)
+        assert_equal([0, 1, 2, 3, 4, 5, 6, 7, 8, 9], c3.data.sort)
+      end
+
+    end
+
+  end
+
+end

data/test/genetic_algorithm/genetic_algorithm_test.rb

@@ -0,0 +1,81 @@
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+ 
+require File.dirname(__FILE__) + '/../../lib/ai4r/genetic_algorithm/genetic_algorithm'
+require 'test/unit'
+
+module Ai4r
+  
+  module GeneticAlgorithm
+
+  COUNTRY = %w"Belgium France Germany Ireland Italy Poland Portugal Spain Sweden UK"
+
+   #         Belgium,  France,   Germany,  Ireland,  Italy,  Poland,   Portugal,   Spain,  Sweden,   UK
+  COSTS = [
+              [  0,       10,       12,       21,       25,     25,       34,         26,     28,       11],
+              [ 10,       0,        12,       21,       19,     21,       18,         12,     22,       11],
+              [ 10,       12,       0,        24,       18,     16,       36,         29,     17,       22],
+              [ 20,       12,       22,       0,        32,     34,       28,         24,     31,        9],
+              [ 23,       20,       19,       31,        0,     25,       29,         25,     31,       28],
+              [ 24,       20,       15,       33,       24,      0,       38,         34,     17,       25],
+              [ 33,       19,       35,       29,       24,     34,        0,          9,     38,       28],
+              [ 25,       13,       28,       25,       25,     34,        9,          0,     33,       19],
+              [ 30,       23,       18,       29,       31,     18,       38,         34,      0,       23],
+              [ 11,       11,       22,       9,        28,     26,       27,         19,     22,        0]
+  ]
+
+
+    class GeneticAlgorithmTest < Test::Unit::TestCase
+
+      def test_chromosome_seed
+        Chromosome.set_cost_matrix(COSTS)
+        chromosome = Chromosome.seed
+        assert_equal [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], chromosome.data.sort
+      end
+
+      def test_fitness
+        Chromosome.set_cost_matrix(COSTS)
+        chromosome = Chromosome.new([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+        assert_equal( -206, chromosome.fitness)
+      end
+
+      def test_selection
+        search = GeneticSearch.new(10, 5)
+        search.generate_initial_population
+        selected =  search.selection
+        selected.each { |c| assert c!=nil }
+        assert_equal 6, selected.length
+        assert_equal 1, search.population[0].normalized_fitness
+        assert_equal 0, search.population.last.normalized_fitness
+        assert_equal 10, search.population.length
+      end
+
+      def test_reproduction
+        search = GeneticSearch.new(10, 5)
+        search.generate_initial_population
+        selected =  search.selection
+        offsprings = search.reproduction selected
+        assert_equal 3, offsprings.length
+      end    
+
+      def test_replace_worst_ranked
+        search = GeneticSearch.new(10, 5)
+        search.generate_initial_population
+        selected =  search.selection
+        offsprings = search.reproduction selected
+        search.replace_worst_ranked offsprings
+        assert_equal 10, search.population.length
+        offsprings.each { |c| assert search.population.include?(c)}
+      end 
+
+    end
+
+  end
+
+end

data/test/neural_network/backpropagation_test.rb

@@ -0,0 +1,82 @@
+# 
+# neural_network_test.rb
+# 
+# This is a unit test file for the backpropagation neural network implemented
+# in ai4r 
+# 
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+# 
+ 
+
+require File.dirname(__FILE__) + '/../../lib/ai4r/neural_network/backpropagation'
+require 'test/unit'
+
+Ai4r::NeuralNetwork::Backpropagation.send(:public, *Ai4r::NeuralNetwork::Backpropagation.protected_instance_methods)  
+Ai4r::NeuralNetwork::Backpropagation.send(:public, *Ai4r::NeuralNetwork::Backpropagation.private_instance_methods)
+
+module Ai4r
+  
+  module NeuralNetwork
+
+
+    class BackpropagationTest < Test::Unit::TestCase
+
+      
+      def test_init_network
+        net_4_2 = Backpropagation.new([4, 2]).init_network
+        assert_equal [[1.0, 1.0, 1.0, 1.0, 1.0], [1.0, 1.0]], 
+          net_4_2.activation_nodes
+        assert_equal 1, net_4_2.weights.size
+        assert_equal 5, net_4_2.weights.first.size
+        net_4_2.weights.first.each do |weights_n|
+          assert_equal 2, weights_n.size  
+        end
+        
+        net_2_2_1 = Backpropagation.new([2, 2, 1]).init_network
+        assert_equal [[1.0, 1.0, 1.0], [1.0, 1.0, 1.0], [1.0]], 
+          net_2_2_1.activation_nodes
+        assert_equal 2, net_2_2_1.weights.size
+        assert_equal 3, net_2_2_1.weights.first.size
+        
+        net_2_2_1.disable_bias = true
+        net_2_2_1_no_bias = net_2_2_1.init_network
+        assert_equal [[1.0, 1.0], [1.0, 1.0], [1.0]], 
+          net_2_2_1_no_bias.activation_nodes
+      end
+      
+      def test_eval
+        #Test set 1
+        net = Backpropagation.new([3, 2])
+        y = net.eval([3, 2, 3])
+        assert y.length == 2
+        #Test set 2
+        net = Backpropagation.new([2, 4, 8, 10, 7])
+        y = net.eval([2, 3])
+        assert y.length == 7
+      end
+
+      def test_dump
+        net = Backpropagation.new([3, 2]).init_network
+        s = Marshal.dump(net)
+        x = Marshal.load(s)
+        assert_equal net.structure, x.structure
+        assert_equal net.disable_bias, x.disable_bias
+        assert_equal net.learning_rate, x.learning_rate
+        assert_equal net.momentum, x.momentum
+        assert_equal net.weights, x.weights
+        assert_equal net.last_changes, x.last_changes
+        assert_equal net.activation_nodes, x.activation_nodes
+      end
+
+    end
+
+  end
+
+end

data/test/neural_network/hopfield_test.rb

@@ -0,0 +1,72 @@
+# This is a unit test file for the hopfield neural network AI4r implementation
+# 
+# Author::    Sergio Fierens
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Mozilla Public License version 1.1  as published by the 
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+
+require File.dirname(__FILE__) + '/../../lib/ai4r'
+require 'test/unit'
+
+Ai4r::NeuralNetwork::Hopfield.send(:public, *Ai4r::NeuralNetwork::Hopfield.protected_instance_methods)  
+
+module Ai4r
+  
+  module NeuralNetwork
+
+
+    class HopfieldTest < Test::Unit::TestCase
+      
+      def setup
+        @data_set = Ai4r::Data::DataSet.new :data_items => [
+          [1,1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,-1],
+          [-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1],
+          [-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1],
+          [1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1],
+          ]
+      end
+      
+      def test_initialize_nodes
+        net = Hopfield.new
+        data_set = Ai4r::Data::DataSet.new :data_items => [[1,1,0,0,1,1,0,0]]
+        assert_equal [-1,-1,-1,-1,-1,-1,-1,-1], net.initialize_nodes(data_set)
+      end
+      
+      def test_initialize_weights
+        net = Hopfield.new
+        net.initialize_nodes @data_set
+        net.initialize_weights(@data_set)
+        assert_equal 15, net.weights.length
+        net.weights.each_with_index {|w_row, i| assert_equal i+1, w_row.length}
+      end
+      
+      def test_run
+        net = Hopfield.new
+        net.train @data_set
+        pattern = [1,1,-1,1,1,1,-1,-1,1,1,-1,-1,1,1,1,-1]
+        100.times do
+          pattern = net.run(pattern)
+        end
+        assert_equal [1,1,-1,-1,1,1,-1,-1,1,1,-1,-1,1,1,-1,-1], pattern
+      end
+      
+      def test_eval
+        net = Hopfield.new
+        net.train @data_set
+        p = [1,1,-1,1,1,1,-1,-1,1,1,-1,-1,1,1,1,-1]
+        assert_equal @data_set.data_items[0], net.eval(p)
+        p = [-1,-1,1,1,1,-1,1,1,-1,-1,1,-1,-1,-1,1,1]
+        assert_equal @data_set.data_items[1], net.eval(p)
+        p = [-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1]
+        assert_equal @data_set.data_items[2], net.eval(p)
+        p = [-1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,-1,-1,-1]
+        assert_equal @data_set.data_items[3], net.eval(p)        
+      end
+
+    end
+  end
+end

data/test/som/som_test.rb

@@ -0,0 +1,97 @@
+# This is a unit test file for the SOM algorithm implemented
+# in ai4r
+#
+# Author::    Thomas Kern
+# License::   MPL 1.1
+# Project::   ai4r
+# Url::       http://ai4r.rubyforge.org/
+#
+# You can redistribute it and/or modify it under the terms of
+# the Mozilla Public License version 1.1  as published by the
+# Mozilla Foundation at http://www.mozilla.org/MPL/MPL-1.1.txt
+
+require File.dirname(__FILE__) + '/../../lib/ai4r/som/som'
+require 'test/unit'
+
+module Ai4r
+
+  module Som
+
+    class SomTest < Test::Unit::TestCase
+
+      def setup
+        @som = Som.new 2, 5, Layer.new(3, 3)
+        @som.initiate_map
+      end
+
+      def test_random_initiation
+        assert_equal 25, @som.nodes.length
+
+        @som.nodes.each do |node|
+          assert_equal 2, node.weights.length
+
+          node.weights.each do |weight|
+            assert weight < 1
+            assert weight > 0
+          end
+
+        end
+      end
+
+
+      # bmu
+
+      def test_find_bmu
+        bmu = @som.find_bmu([0.5, 0.5])
+      end
+
+      def test_adjust_nodes
+        @som.adjust_nodes [1, 2], @som.find_bmu([0.5, 0.5]), 2, 0.1
+      end
+
+      def test_access_to_nodes
+        assert_raise Exception do
+          @som.get_node(5, 5)
+        end
+
+        assert_raise Exception do
+          @som.get_node(5, -3)
+        end
+
+        assert_equal Node, @som.get_node(0, 0).class
+      end
+
+      def test_distance_for_same_row
+        assert_equal 2, distancer(0, 0, 0, 2)
+        assert_equal 2, distancer(0, 4, 0, 2)
+        assert_equal 0, distancer(0, 0, 0, 0)
+      end
+
+      def test_distance_for_same_column
+        assert_equal 1, distancer(0, 0, 1, 0)
+        assert_equal 2, distancer(2, 0, 0, 0)
+      end
+
+      def test_distance_for_diagonally_point
+        assert_equal 1, distancer(1, 0, 0, 1)
+        assert_equal 2, distancer(2, 2, 0, 0)
+        assert_equal 2, distancer(3, 2, 1, 4)
+      end
+
+      def test_distance_for_screwed_diagonally_point
+        assert_equal 2, distancer(0, 0, 2, 1)
+        assert_equal 4, distancer(3, 4, 1, 0)
+        assert_equal 2, distancer(3, 2, 1, 3)
+      end
+
+      private
+
+      def distancer(x1, y1, x2, y2)
+        @som.get_node(x1, y1).distance_to_node(@som.get_node(x2, y2))
+      end
+
+    end
+
+  end
+
+end