ai4r 1.0

data/site/src/documentation/translations/menu_sk.xml

@@ -0,0 +1,33 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="sk">
+  <message key="About">O programe</message>
+  <message key="Index">Zoznám</message>
+  <message key="Changes">Zmeny</message>
+  <message key="Todo">Úlohy</message>
+  <message key="Samples">Príklady</message>
+  <message key="Apache document">Apache Document</message>
+  <message key="Static content">Statický Obsah</message>
+  <message key="Linking">Linking</message>
+  <message key="Wiki page">Wiki stránka</message>
+  <message key="ihtml page">ihtml stránka</message>
+  <message key="ehtml page">ehtml stránka</message>
+  <message key="FAQ">Casté Otázky</message>
+  <message key="Simplifed Docbook">Simplifed Docbook stránka</message>
+  <message key="XSP page">XSP stránka</message>
+</catalogue>

data/site/src/documentation/translations/tabs.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="en">
+  <message key="Home">Home</message>
+  <message key="Samples">Samples</message>
+  <message key="Apache XML Projects">Apache XML Projects</message>
+</catalogue>

data/site/src/documentation/translations/tabs_de.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="de">
+  <message key="Home">Home</message>
+  <message key="Samples">Beispiele</message>
+  <message key="Apache XML Projects">Apache XML Projekte</message>
+</catalogue>

data/site/src/documentation/translations/tabs_es.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="es">
+  <message key="Home">Inicio</message>
+  <message key="Samples">Ejemplos</message>
+  <message key="Apache XML Projects">Projectos XML Apache</message>
+</catalogue>

data/site/src/documentation/translations/tabs_fr.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="fr">
+  <message key="Home">Accueil</message>
+  <message key="Samples">Exemples</message>
+  <message key="Apache XML Projects">Projets Apache XML</message>
+</catalogue>

data/site/src/documentation/translations/tabs_nl.xml

@@ -0,0 +1,22 @@
+<?xml version="1.0"?>
+<!--
+  Licensed to the Apache Software Foundation (ASF) under one or more
+  contributor license agreements.  See the NOTICE file distributed with
+  this work for additional information regarding copyright ownership.
+  The ASF licenses this file to You under the Apache License, Version 2.0
+  (the "License"); you may not use this file except in compliance with
+  the License.  You may obtain a copy of the License at
+
+      http://www.apache.org/licenses/LICENSE-2.0
+
+  Unless required by applicable law or agreed to in writing, software
+  distributed under the License is distributed on an "AS IS" BASIS,
+  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+  See the License for the specific language governing permissions and
+  limitations under the License.
+-->
+<catalogue xml:lang="nl">
+  <message key="Home">Home</message>
+  <message key="Samples">Voorbeelden</message>
+  <message key="Apache XML Projects">Apache XML Projecten</message>
+</catalogue>

data/test/decision_tree/id3_test.rb

@@ -0,0 +1,209 @@
+# 
+# id3_test.rb
+# 
+# This is a unit test file for the ID3 algorithm (Quinlan) 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/decision_tree/id3'
+require 'test/unit'
+
+DATA_LABELS = [ 'city', 'age_range', 'gender', 'marketing_target'  ]
+
+DATA_SET = [  ['New York',  '<30',      'M', 'Y'],
+              ['Chicago',     '<30',      'M', 'Y'],
+              ['Chicago',     '<30',      'F', 'Y'],
+              ['New York',  '<30',      'M', 'Y'],
+              ['New York',  '<30',      'M', 'Y'],
+              ['Chicago',     '[30-50)',  'M', 'Y'],
+              ['New York',  '[30-50)',  'F', 'N'],
+              ['Chicago',     '[30-50)',  'F', 'Y'],
+              ['New York',  '[30-50)',  'F', 'N'],
+              ['Chicago',     '[50-80]', 'M', 'N'],
+              ['New York',  '[50-80]', 'F', 'N'],
+              ['New York',  '[50-80]', 'M', 'N'],
+              ['Chicago',     '[50-80]', 'M', 'N'],
+              ['New York',  '[50-80]', 'F', 'N'],
+              ['Chicago',     '>80',      'F', 'Y']
+            ]
+
+SPLIT_DATA_SET_BY_CITY = [  [
+                              ["New York", "<30", "M", "Y"], 
+                              ["New York", "<30", "M", "Y"], 
+                              ["New York", "<30", "M", "Y"], 
+                              ["New York", "[30-50)", "F", "N"], 
+                              ["New York", "[30-50)", "F", "N"], 
+                              ["New York", "[50-80]", "F", "N"], 
+                              ["New York", "[50-80]", "M", "N"], 
+                              ["New York", "[50-80]", "F", "N"]], 
+                            [
+                              ["Chicago", "<30", "M", "Y"], 
+                              ["Chicago", "<30", "F", "Y"], 
+                              ["Chicago", "[30-50)", "M", "Y"], 
+                              ["Chicago", "[30-50)", "F", "Y"], 
+                              ["Chicago", "[50-80]", "M", "N"], 
+                              ["Chicago", "[50-80]", "M", "N"], 
+                              ["Chicago", ">80", "F", "Y"]]
+                          ]
+                          
+SPLIT_DATA_SET_BY_AGE = [   [
+                              ["New York", "<30", "M", "Y"], 
+                              ["Chicago", "<30", "M", "Y"], 
+                              ["Chicago", "<30", "F", "Y"], 
+                              ["New York", "<30", "M", "Y"], 
+                              ["New York", "<30", "M", "Y"]], 
+                            [
+                              ["Chicago", "[30-50)", "M", "Y"], 
+                              ["New York", "[30-50)", "F", "N"], 
+                              ["Chicago", "[30-50)", "F", "Y"], 
+                              ["New York", "[30-50)", "F", "N"]], 
+                            [
+                              ["Chicago", "[50-80]", "M", "N"], 
+                              ["New York", "[50-80]", "F", "N"], 
+                              ["New York", "[50-80]", "M", "N"], 
+                              ["Chicago", "[50-80]", "M", "N"], 
+                              ["New York", "[50-80]", "F", "N"]], 
+                            [
+                              ["Chicago", ">80", "F", "Y"]]
+                         ]
+
+  EXPECTED_RULES_STRING =  
+    "if age_range=='<30' then marketing_target='Y'\n"+
+    "elsif age_range=='[30-50)' and city=='Chicago' then marketing_target='Y'\n"+
+    "elsif age_range=='[30-50)' and city=='New York' then marketing_target='N'\n"+
+    "elsif age_range=='[50-80]' then marketing_target='N'\n"+
+    "elsif age_range=='>80' then marketing_target='Y'\n"+
+    "else raise 'There was not enough information during training to do a proper induction for this data element' end"
+    
+                  
+  DecisionTree::ID3.send(:public, *DecisionTree::ID3.protected_instance_methods)  
+  DecisionTree::ID3.send(:public, *DecisionTree::ID3.private_instance_methods)
+
+module DecisionTree
+  
+  class ID3Test < Test::Unit::TestCase
+
+    def test_log2
+      assert_equal 1.0, DecisionTree::ID3.log2(2)
+      assert_equal 0.0, DecisionTree::ID3.log2(0)
+      assert 1.585 - DecisionTree::ID3.log2(3) < 0.001
+    end
+
+    def test_sum
+      assert_equal 28, DecisionTree::ID3.sum([5, 0, 22, 1])
+      assert_equal 0, DecisionTree::ID3.sum([])
+    end
+    
+    def test_data_labels
+      id3 = DecisionTree::ID3.new(DATA_SET)
+      expected_default = [ 'ATTRIBUTE_1', 'ATTRIBUTE_2', 'ATTRIBUTE_3', 'CATEGORY' ]
+      assert_equal(expected_default, id3.data_labels)
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      assert_equal(DATA_LABELS, id3.data_labels)
+    end
+    
+    def test_domain
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      expected_domain = [["New York", "Chicago"], ["<30", "[30-50)", "[50-80]", ">80"], ["M", "F"], ["Y", "N"]]
+      assert_equal expected_domain, id3.domain(DATA_SET)
+    end
+
+    def test_grid
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      expected_grid = [[3, 5], [5, 2]]
+      domain = id3.domain(DATA_SET)
+      assert_equal expected_grid, id3.freq_grid(0, DATA_SET, domain)
+      expected_grid = [[5, 0], [2, 2], [0, 5], [1, 0]]
+      assert_equal expected_grid, id3.freq_grid(1, DATA_SET, domain)
+    end
+    
+    def test_entropy
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      expected_entropy = 0.9118
+      domain = id3.domain(DATA_SET)
+      freq_grid = id3.freq_grid(0, DATA_SET, domain)
+      assert expected_entropy - id3.entropy(freq_grid, DATA_SET.length) < 0.0001
+      expected_entropy = 0.2667
+      freq_grid = id3.freq_grid(1, DATA_SET, domain)
+      assert expected_entropy - id3.entropy(freq_grid, DATA_SET.length) < 0.0001
+      expected_entropy = 0.9688
+      freq_grid = id3.freq_grid(2, DATA_SET, domain)
+      assert expected_entropy - id3.entropy(freq_grid, DATA_SET.length) < 0.0001
+    end
+    
+    def test_min_entropy_index
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      domain = id3.domain(DATA_SET)
+      assert_equal 1, id3.min_entropy_index(DATA_SET, domain)
+      assert_equal 0, id3.min_entropy_index(DATA_SET, domain, [1])
+      assert_equal 2, id3.min_entropy_index(DATA_SET, domain, [1, 0])
+    end
+    
+    def test_split_data_examples
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      domain = id3.domain(DATA_SET)
+      res = id3.split_data_examples(DATA_SET, domain, 0)
+      assert_equal(SPLIT_DATA_SET_BY_CITY, res)
+      res = id3.split_data_examples(DATA_SET, domain, 1)
+      assert_equal(SPLIT_DATA_SET_BY_AGE, res)
+    end
+    
+    def test_most_freq
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      domain = id3.domain(DATA_SET)
+      assert_equal 'Y', id3.most_freq(DATA_SET, domain)
+      assert_equal 'Y', id3.most_freq(SPLIT_DATA_SET_BY_AGE[3], domain)
+      assert_equal 'N', id3.most_freq(SPLIT_DATA_SET_BY_AGE[2], domain)
+    end
+    
+    def test_to_s
+      assert_equal [["marketing_target='N'"]], DecisionTree::CategoryNode.new('marketing_target', 'N').get_rules
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      assert_equal EXPECTED_RULES_STRING, id3.to_s
+    end
+    
+    def test_eval
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      #if age_range='<30' then marketing_target='Y'
+      assert_equal 'Y', id3.eval(['New York', '<30', 'F'])
+      assert_equal 'Y', id3.eval(['Chicago', '<30', 'M'])
+      #if age_range='[30-50)' and city='Chicago' then marketing_target='Y'
+      assert_equal 'Y', id3.eval(['Chicago', '[30-50)', 'F'])
+      assert_equal 'Y', id3.eval(['Chicago', '[30-50)', 'M'])
+      #if age_range='[30-50)' and city='New York' then marketing_target='N'
+      assert_equal 'N', id3.eval(['New York', '[30-50)', 'F'])
+      assert_equal 'N', id3.eval(['New York', '[30-50)', 'M'])      
+      #if age_range='[50-80]' then marketing_target='N'
+      assert_equal 'N', id3.eval(['New York', '[50-80]', 'F'])
+      assert_equal 'N', id3.eval(['Chicago', '[50-80]', 'M'])      
+      #if age_range='>80' then marketing_target='Y'
+      assert_equal 'Y', id3.eval(['New York', '>80', 'M'])      
+      assert_equal 'Y', id3.eval(['Chicago', '>80', 'F'])      
+    end
+    
+    def test_rules_eval
+      id3 = DecisionTree::ID3.new(DATA_SET, DATA_LABELS)
+      #if age_range='<30' then marketing_target='Y'
+      age_range = '<30'
+      marketing_target = nil
+      eval id3.to_s
+      assert_equal 'Y', marketing_target
+      #if age_range='[30-50)' and city='New York' then marketing_target='N'
+      age_range='[30-50)' 
+      city='New York'
+      eval id3.to_s
+      assert_equal 'N', marketing_target
+    end
+  end
+
+end
+  

data/test/genetic_algorithm/chromosome_test.rb

@@ -0,0 +1,55 @@
+# 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/genetic_algorithm/genetic_algorithm'
+
+require 'test/unit'
+
+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

data/test/genetic_algorithm/genetic_algorithm_test.rb

@@ -0,0 +1,78 @@
+# 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/genetic_algorithm/genetic_algorithm'
+require 'test/unit'
+
+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