naivebayes 0.0.1

data/doc/COPYING.LESSER

@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

data/doc/ChangeLog

@@ -0,0 +1,5 @@
+=== 0.0.1 / 2013-07-07
+
+* First release.
+
+

data/doc/LICENSE

@@ -0,0 +1,8 @@
+You can redistribute it and/or modify it under either the terms of the GPL
+version 3, or LGPL version 3 (Dual License).
+
+See the file doc/COPYING or doc/COPYING.LESSER.
+
+Copyright (c) 774 All Rights Reserved.
+Web: http://id774.net
+E-Mail: 774@id774.net

data/doc/README

@@ -0,0 +1,16 @@
+naivebayes
+
+Name
+ naive bayes classifier
+
+Syntax
+ require 'naivebayes'
+
+Description
+ http://en.wikipedia.org/wiki/Naive_bayes
+
+Installation
+ $ gem install naivebayes
+
+Tutorial
+ See spec files.

data/lib/naivebayes.rb

@@ -0,0 +1,7 @@
+#!/usr/bin/env ruby
+# -*- coding: utf-8 -*-
+
+module NaiveBayes
+  VERSION = "0.0.1"
+  require File.dirname(__FILE__) +  "/naivebayes/classifier"
+end

data/lib/naivebayes/classifier.rb

@@ -0,0 +1,58 @@
+#!/usr/bin/env ruby
+# -*- coding: utf-8 -*-
+
+module NaiveBayes
+  class Classifier
+    def initialize(params)
+      @frequency_table = Hash.new
+      @word_table = Hash.new
+      @instance_count_of = Hash.new(0)
+      @total_count = 0
+      @model = params[:model]
+    end
+
+    def train(label, attributes)
+      unless @frequency_table.has_key?(label)
+        @frequency_table[label] = Hash.new(0)
+      end
+      attributes.each {|word, frequency|
+        if @model == "multinomial"
+          @frequency_table[label][word] += frequency
+        else
+          @frequency_table[label][word] += 1
+        end
+        @word_table[word] = 1
+      }
+      @instance_count_of[label] += 1
+      @total_count += 1
+    end
+
+    def classify(attributes)
+      class_prior_of = Hash.new(1)
+      likelihood_of = Hash.new(1)
+      class_posterior_of = Hash.new(1)
+      evidence = 0
+      @instance_count_of.each {|label, freq|
+        class_prior_of[label] = freq.to_f / @total_count.to_f
+      }
+      @frequency_table.each_key {|label|
+        likelihood_of[label] = 1
+        @word_table.each_key {|word|
+          laplace_word_likelihood = (@frequency_table[label][word] + 1).to_f /
+            (@instance_count_of[label] + @word_table.size()).to_f
+          if attributes.has_key?(word)
+            likelihood_of[label] *= laplace_word_likelihood
+          else
+            likelihood_of[label] *= (1 - laplace_word_likelihood)
+          end
+        }
+        class_posterior_of[label] = class_prior_of[label] * likelihood_of[label]
+        evidence += class_posterior_of[label]
+      }
+      class_posterior_of.each {|label, posterior|
+        class_posterior_of[label] = posterior / evidence
+      }
+      return class_posterior_of
+    end
+  end
+end

data/naivebayes.gemspec

@@ -0,0 +1,65 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = "naivebayes"
+  s.version = "0.0.1"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["id774"]
+  s.date = "2013-07-07"
+  s.description = "Naive Bayes classifier"
+  s.email = "idnanashi@gmail.com"
+  s.extra_rdoc_files = [
+    "README.md"
+  ]
+  s.files = [
+    "Gemfile",
+    "README.md",
+    "Rakefile",
+    "VERSION",
+    "doc/AUTHORS",
+    "doc/COPYING",
+    "doc/COPYING.LESSER",
+    "doc/ChangeLog",
+    "doc/LICENSE",
+    "doc/README",
+    "lib/naivebayes.rb",
+    "lib/naivebayes/classifier.rb",
+    "naivebayes.gemspec",
+    "script/build",
+    "spec/lib/naivebayes/classifier_spec.rb",
+    "spec/lib/naivebayes_spec.rb",
+    "spec/spec_helper.rb",
+    "vendor/.gitkeep"
+  ]
+  s.homepage = "http://github.com/id774/naivebayes"
+  s.licenses = ["GPL"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = "2.0.3"
+  s.summary = "naivebayes"
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 4
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<cucumber>, [">= 0"])
+      s.add_development_dependency(%q<bundler>, ["~> 1.3.5"])
+      s.add_development_dependency(%q<builder>, ["~> 3.1.0"])
+      s.add_development_dependency(%q<jeweler>, [">= 0"])
+    else
+      s.add_dependency(%q<cucumber>, [">= 0"])
+      s.add_dependency(%q<bundler>, ["~> 1.3.5"])
+      s.add_dependency(%q<builder>, ["~> 3.1.0"])
+      s.add_dependency(%q<jeweler>, [">= 0"])
+    end
+  else
+    s.add_dependency(%q<cucumber>, [">= 0"])
+    s.add_dependency(%q<bundler>, ["~> 1.3.5"])
+    s.add_dependency(%q<builder>, ["~> 3.1.0"])
+    s.add_dependency(%q<jeweler>, [">= 0"])
+  end
+end
+

data/script/build

@@ -0,0 +1,32 @@
+#!/bin/sh
+#
+########################################################################
+# Integration Build Script
+#
+#  Maintainer: id774 <idnanashi@gmail.com>
+#
+#  v1.2 4/17,2013
+#       Using simplecov for coverage.
+#  v1.1 3/14,2013
+#       Show ruby version.
+#  v1.0 3/16,2012
+#       First.
+########################################################################
+
+kickstart() {
+    export RACK_ROOT="."
+    export RACK_ENV="test"
+    ruby -v
+}
+
+run_tests() {
+    rake simplecov
+}
+
+main() {
+    kickstart
+    run_tests
+}
+
+set -ex
+main

data/spec/lib/naivebayes/classifier_spec.rb

@@ -0,0 +1,161 @@
+#!/usr/bin/env ruby
+# -*- coding: utf-8 -*-
+
+require File.dirname(__FILE__) + '/../../spec_helper'
+
+def train_by_2
+  @classifier.train("positive", {"aaa" => 0, "bbb" => 1})
+  @classifier.train("negative", {"ccc" => 2, "ddd" => 3})
+end
+
+def train_by_3
+  @classifier.train("positive", {"aaa" => 2, "bbb" => 1})
+  @classifier.train("negative", {"ccc" => 2, "ddd" => 2})
+  @classifier.train("neutral",  {"eee" => 3, "fff" => 3})
+end
+
+describe NaiveBayes::Classifier, 'ナイーブベイズ' do
+  context '多変数ベルヌーイモデルにおいて' do
+    describe '2 つの教師データで positive が期待される値を与えると' do
+      it 'positive が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "berounoulli")
+        train_by_2
+        expect = {
+          "positive" => 0.8767123287671234,
+          "negative" => 0.12328767123287669
+        }
+        result = @classifier.classify({"aaa" => 1, "bbb" => 1})
+        result.should == expect
+      end
+    end
+    describe '2 つの教師データで negative が期待される値を与えると' do
+      it 'negative が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "berounoulli")
+        train_by_2
+        expect = {
+          "positive" => 0.12328767123287668,
+          "negative" => 0.8767123287671234
+        }
+        result = @classifier.classify({"ccc" => 3, "ddd" => 3})
+        result.should == expect
+      end
+    end
+  end
+end
+
+describe NaiveBayes::Classifier, 'ナイーブベイズ' do
+  context '多項分布モデルにおいて' do
+    describe '2 つの教師データで positive が期待される値を与えると' do
+      it 'positive が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "multinomial")
+        train_by_2
+        expect = {
+          "positive" => 0.9411764705882353,
+          "negative" => 0.05882352941176469
+        }
+        result = @classifier.classify({"aaa" => 1, "bbb" => 1})
+        result.should == expect
+      end
+    end
+    describe '2 つの教師データで negative が期待される値を与えると' do
+      it 'negative が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "multinomial")
+        train_by_2
+        expect = {
+          "positive" => 0.0588235294117647,
+          "negative" => 0.9411764705882353
+        }
+        result = @classifier.classify({"ccc" => 3, "ddd" => 3})
+        result.should == expect
+      end
+    end
+  end
+end
+
+describe NaiveBayes::Classifier, 'ナイーブベイズ' do
+  context '多変数ベルヌーイモデルにおいて' do
+    describe '3 つの教師データで positive が期待される値を与えると' do
+      it 'positive が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "berounoulli")
+        train_by_3
+        expect = {
+          "positive" => 0.7422680412371133,
+          "negative" => 0.12886597938144329,
+          "neutral"  => 0.12886597938144329
+        }
+        result = @classifier.classify({"aaa" => 1, "bbb" => 1})
+        result.should == expect
+      end
+    end
+    describe '3 つの教師データで negative が期待される値を与えると' do
+      it 'negative が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "berounoulli")
+        train_by_3
+        expect = {
+          "positive" => 0.12886597938144329,
+          "negative" => 0.7422680412371133,
+          "neutral"  => 0.12886597938144329
+        }
+        result = @classifier.classify({"ccc" => 3, "ddd" => 2})
+        result.should == expect
+      end
+    end
+    describe '3 つの教師データで neutral が期待される値を与えると' do
+      it 'neutral が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "berounoulli")
+        train_by_3
+        expect = {
+          "positive" => 0.2272727272727273,
+          "negative" => 0.22727272727272724,
+          "neutral"  => 0.5454545454545455
+        }
+        result = @classifier.classify({"aaa" => 1, "ddd" => 2, "eee" => 3, "fff" => 1})
+        result.should == expect
+      end
+    end
+  end
+end
+
+describe NaiveBayes::Classifier, 'ナイーブベイズ' do
+  context '多項分布モデルにおいて' do
+    describe '3 つの教師データで positive が期待される値を与えると' do
+      it 'positive が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "multinomial")
+        train_by_3
+        expect = {
+          "positive" => 0.896265560165975,
+          "negative" => 0.06639004149377592,
+          "neutral"  => 0.03734439834024896
+        }
+        result = @classifier.classify({"aaa" => 1, "bbb" => 1})
+        result.should == expect
+      end
+    end
+    describe '3 つの教師データで negative が期待される値を与えると' do
+      it 'negative が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "multinomial")
+        train_by_3
+        expect = {
+          "positive" => 0.05665722379603399,
+          "negative" => 0.9178470254957508,
+          "neutral"  => 0.0254957507082153
+        }
+        result = @classifier.classify({"ccc" => 3, "ddd" => 2})
+        result.should == expect
+      end
+    end
+    describe '3 つの教師データで neutral が期待される値を与えると' do
+      it 'neutral が返る' do
+        @classifier = NaiveBayes::Classifier.new(:model => "multinomial")
+        train_by_3
+        expect = {
+          "positive" => 0.12195121951219513,
+          "negative" => 0.09756097560975606,
+          "neutral"  => 0.7804878048780488
+        }
+        result = @classifier.classify({"aaa" => 1, "ddd" => 2, "eee" => 3, "fff" => 1})
+        result.should == expect
+      end
+    end
+  end
+end