apriori-ruby 0.0.4

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 34233d76397403835023b9acc4fbc879105ecefd
+  data.tar.gz: 8f7c58b988c48461be7021268bb5957c66dd2488
+SHA512:
+  metadata.gz: 4713c04c787db63bb82c4a61faca537b67c6f77bc2bcc6f482da3946380c70721e46f2dcbb4ead9d9cbb24e2b33abdd06262d5bd1445b90dce39d3715da2a6ff
+  data.tar.gz: 87d53ba9aef49e50e3761e28108413827442c32280a0fa03b5bf342e52113c15b437542416121488ab5066b1234a68a53f78efb3d7c50a8060bd671e319c6113

data/.gitignore

@@ -0,0 +1,34 @@
+*.gem
+*.rbc
+/.config
+/coverage/
+/InstalledFiles
+/pkg/
+/spec/reports/
+/test/tmp/
+/test/version_tmp/
+/tmp/
+
+## Specific to RubyMotion:
+.dat*
+.repl_history
+build/
+
+## Documentation cache and generated files:
+/.yardoc/
+/_yardoc/
+/doc/
+/rdoc/
+
+## Environment normalisation:
+/.bundle/
+/lib/bundler/man/
+
+# for a library or gem, you might want to ignore these files since the code is
+# intended to run in multiple environments; otherwise, check them in:
+# Gemfile.lock
+# .ruby-version
+# .ruby-gemset
+
+# unless supporting rvm < 1.11.0 or doing something fancy, ignore this:
+.rvmrc

data/.rspec

@@ -0,0 +1,4 @@
+--color
+--warnings
+--format documentation
+--require spec_helper

data/.ruby-version

@@ -0,0 +1 @@
+2.1.2

data/Gemfile

@@ -0,0 +1,4 @@
+# A sample Gemfile
+source "https://rubygems.org"
+gemspec
+gem 'factory_girl'

data/Gemfile.lock

@@ -0,0 +1,46 @@
+PATH
+  remote: .
+  specs:
+    apriori (0.0.1)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    activesupport (4.1.5)
+      i18n (~> 0.6, >= 0.6.9)
+      json (~> 1.7, >= 1.7.7)
+      minitest (~> 5.1)
+      thread_safe (~> 0.1)
+      tzinfo (~> 1.1)
+    diff-lcs (1.2.5)
+    factory_girl (4.4.0)
+      activesupport (>= 3.0.0)
+    i18n (0.6.11)
+    json (1.8.1)
+    minitest (5.4.0)
+    rake (10.3.2)
+    rspec (3.0.0)
+      rspec-core (~> 3.0.0)
+      rspec-expectations (~> 3.0.0)
+      rspec-mocks (~> 3.0.0)
+    rspec-core (3.0.4)
+      rspec-support (~> 3.0.0)
+    rspec-expectations (3.0.4)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.0.0)
+    rspec-mocks (3.0.4)
+      rspec-support (~> 3.0.0)
+    rspec-support (3.0.4)
+    thread_safe (0.3.4)
+    tzinfo (1.2.2)
+      thread_safe (~> 0.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  apriori!
+  bundler (~> 1.7)
+  factory_girl
+  rake (~> 10.0)
+  rspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Bryan Mulvihill
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,16 @@
+Apriori Algorithm
+===========
+http://en.wikipedia.org/wiki/Apriori_algorithm
+
+Implementation Project for CS 634 - Data Mining
+
+**Project is still in progress**  
+Requirements: Ruby 2.1.X  
+Installation
+```bash
+gem install apriori-ruby
+```
+Or add to Gemfile
+```ruby
+gem 'apriori-ruby'
+```

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/apriori.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'apriori/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "apriori-ruby"
+  spec.version       = Apriori::VERSION
+  spec.authors       = ["Bryan Mulvihill"]
+  spec.email         = ["mulvihill.bryan@gmail.com"]
+  spec.summary       = %q{Ruby implementation of Apriori Algorithm}
+  spec.homepage      = "https://github.com/bmulvihill/apriori"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency 'rspec'
+end

data/lib/apriori/algorithm.rb

@@ -0,0 +1,16 @@
+module Apriori
+  class Algorithm
+    attr_accessor :min_support, :min_confidence, :item_set
+
+    def initialize(item_set)
+      @item_set = item_set
+    end
+
+    def mine(min_support=0, min_confidence=0)
+      @min_support, @min_confidence = min_support, min_confidence
+      item_set.create_frequent_item_sets(min_support)
+      item_set.create_association_rules(min_confidence)
+    end
+
+  end
+end

data/lib/apriori/item_set.rb

@@ -0,0 +1,71 @@
+module Apriori
+  class ItemSet
+    attr_reader :data_set, :item_set, :candidates, :iteration, :min_support, :min_confidence
+
+    def initialize(data_set)
+      @data_set = data_set
+    end
+
+    def frequent_item_sets
+      @frequent_item_sets ||= []
+    end
+
+    def create_frequent_item_sets min_support
+      @min_support = min_support
+      @iteration = 0
+      @candidates = convert_initial_data_set
+      while candidates.any?
+        @iteration += 1
+        @candidates = list.make_candidates
+        frequent_item_sets << list unless iteration == 1
+      end
+      frequent_item_sets
+    end
+
+    def create_association_rules min_confidence
+      rules ={}
+      frequent_item_sets.each do |freq_lists|
+        freq_lists.sets.each do |set|
+          List.create_subsets(set).each do |combo|
+            rule_name = "#{combo.join(',')}=>#{(set.flatten - combo.flatten).join(',')}"
+            rules[rule_name] = confidence(combo.flatten, (set.flatten - combo.flatten))
+          end
+        end
+      end
+      rules.select{|k,v| v >= min_confidence}
+    end
+
+    def support item
+      (count_frequency(item).to_f / data_set.size) * 100
+    end
+
+    def confidence set1, set2
+      (support(set1 + set2) / support(set1)) * 100
+    end
+
+    def count_frequency set
+      data_set.map do |transaction, items|
+        contains_all?(items, set)
+      end.reject {|item| item == false }.size
+    end
+
+    def contains_all? set, subset
+      set.to_set.superset? subset.to_set
+    end
+
+    private
+
+    def list
+      @list ||= {}
+      @list[iteration] ||= List.new(reject_candidates, iteration)
+    end
+
+    def reject_candidates
+      candidates.reject{|item| support(item) < min_support}
+    end
+
+    def convert_initial_data_set
+      @data_set.values.flatten.uniq.map{|item| [item]}
+    end
+  end
+end

data/lib/apriori/list.rb

@@ -0,0 +1,33 @@
+module Apriori
+  class List
+    attr_reader :sets, :iteration
+
+    def initialize sets, iteration
+      @sets = sets
+      @iteration = iteration
+    end
+    
+    def self.create_subsets set
+      (1).upto(set.size - 1).flat_map { |n| set.combination(n).to_a }
+    end
+
+    def make_candidates
+      if iteration <= 2
+        sets.flatten.combination(iteration).to_a
+      else
+        self_join prune
+      end
+    end
+
+    private
+
+    def self_join set
+      set.map{|a1| set.select{|a2| a1[0...-1] == a2[0...-1]}.flatten.uniq}.uniq
+    end
+
+    def prune
+      sets.reject{|a1| sets.select{|a2| a1[0...-1] == a2[0...-1]}.size == 1}
+    end
+
+  end
+end

data/lib/apriori/version.rb

@@ -0,0 +1,3 @@
+module Apriori
+  VERSION = "0.0.4"
+end

data/lib/apriori.rb

@@ -0,0 +1,5 @@
+require 'apriori/algorithm.rb'
+require 'apriori/item_set.rb'
+require 'apriori/list.rb'
+require 'set'
+require 'apriori/version.rb'

data/spec/factories/apriori/apriori.rb

@@ -0,0 +1,18 @@
+FactoryGirl.define do
+  factory :algorithm, class: Apriori::Algorithm do
+    initialize_with {new(FactoryGirl.build(:item_set))}
+  end
+
+  factory :item_set, class: Apriori::ItemSet do
+    initialize_with {new(FactoryGirl.build(:sample_data))}
+  end
+
+  factory :sample_data, class: Hash do
+    t1 ['Mango', 'Onion', 'Nintendo', 'Keychain', 'Eggs', 'Yoyo']
+    t2 ['Doll', 'Onion', 'Nintendo', 'Keychain', 'Eggs', 'Yoyo']
+    t3 ['Mango', 'Apple', 'Keychain', 'Eggs']
+    t4 ['Mango', 'Umbrella', 'Corn', 'Keychain', 'Yoyo']
+    t5 ['Corn', 'Onion', 'Onion', 'Keychain', 'Icecream', 'Eggs']
+    initialize_with { attributes }
+  end
+end

data/spec/lib/apriori/algorithm_spec.rb

@@ -0,0 +1,12 @@
+describe Apriori::Algorithm do
+  before do
+    @apriori = FactoryGirl.build(:algorithm)
+  end
+
+  context '#mine' do
+    it 'returns all association rules meeting the minimum support and confidence' do
+      @apriori.mine(50)
+    end
+  end
+
+end

data/spec/lib/apriori/item_set_spec.rb

@@ -0,0 +1,50 @@
+describe Apriori::ItemSet do
+  before do
+    data = FactoryGirl.build(:sample_data)
+    @item_set = Apriori::ItemSet.new(data)
+  end
+
+  context '#confidence' do
+    it 'will return a rule with support and confidence' do
+      set1 = ['Eggs']
+      set2 = ['Onion', 'Keychain']
+      expect(@item_set.confidence(set1, set2)).to eql(75.0)
+    end
+  end
+
+  context '#support' do
+    it 'will return the support of an item' do
+      item = ['Mango']
+      expect(@item_set.support(item)).to eql((3.to_f/5) * 100)
+    end
+  end
+
+  context '#create_association_rules' do
+    it 'creates association rules for all combinations' do
+      @set = Apriori::ItemSet.new({:t1 => ['1','2','3'], :t2 => ['1','2','4'], :t3 => ['1','4','5']})
+      @set.create_frequent_item_sets(60)
+      expect(@set.create_association_rules(60)).to eql({"1=>2"=>66.66666666666666, "2=>1"=>100.0, "1=>4"=>66.66666666666666, "4=>1"=>100.0})
+    end
+  end
+
+  context '#count_frequency' do
+    it 'will return the frequency of an item in the data set' do
+    item = ['Mango']
+    expect(@item_set.count_frequency(item)).to eql(3)
+    end
+  end
+
+  context '#contains_all?' do
+    it 'will return true if one array contains all elements of sub set' do
+      set = [1,2,3]
+      subset = [2,1]
+      expect(@item_set.contains_all?(set, subset)).to be true
+    end
+
+    it 'will return false if one array does not contain all the elements of a sub set' do
+      set = [1,2,3,4]
+      subset = [2,1,5]
+      expect(@item_set.contains_all?(set, subset)).to be false
+    end
+  end
+end

data/spec/lib/apriori/list_spec.rb

@@ -0,0 +1,33 @@
+describe Apriori::List do
+  context '#make_candidates' do
+    it 'will return all combinations for first two iterations' do
+      array =['Hi1','Hi2','Hi3']
+      @list = Apriori::List.new(array,2)
+      expect(@list.make_candidates).to eql([['Hi1','Hi2'],['Hi1','Hi3'],['Hi2','Hi3']])
+    end
+
+    it 'will return the self join after the first two iterations' do
+      array = [['Hi1','Hi2'], ['Hi1','Hi3'], ['Blah1', 'Blah2'], ['Blah1', 'Blah3']]
+      @list = Apriori::List.new(array,3)
+      expect(@list.make_candidates).to eql([['Hi1','Hi2','Hi3'],['Blah1','Blah2','Blah3']])
+    end
+
+    it 'will prune elements' do
+      array = [['Hi1','Hi2'], ['Hi1','Hi3'], ['Blah1', 'Blah2'], ['Blah1', 'Blah3'], ['Blarg1', 'Blarg2']]
+      @list = Apriori::List.new(array,3)
+      expect(@list.make_candidates).to eql([['Hi1','Hi2','Hi3'],['Blah1','Blah2','Blah3']])
+    end
+  end
+
+  context '#self.create_subsets' do
+    it 'returns nothing if the subset size is 1' do
+      array = [[1],[2],[3]]
+      expect(Apriori::List.create_subsets([1])).to eql([])
+    end
+
+    it 'returns all possible subsets of an array' do
+      array = [[1,2,3]]
+      expect(Apriori::List.create_subsets([1,2,3])).to eql([[1],[2],[3],[1,2],[1,3],[2,3]])
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,7 @@
+require 'factory_girl'
+require 'apriori'
+
+RSpec.configure do |config|
+  config.include FactoryGirl::Syntax::Methods
+  FactoryGirl.find_definitions
+end

metadata

@@ -0,0 +1,110 @@
+--- !ruby/object:Gem::Specification
+name: apriori-ruby
+version: !ruby/object:Gem::Version
+  version: 0.0.4
+platform: ruby
+authors:
+- Bryan Mulvihill
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-09-21 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: 
+email:
+- mulvihill.bryan@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".ruby-version"
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- apriori.gemspec
+- lib/apriori.rb
+- lib/apriori/algorithm.rb
+- lib/apriori/item_set.rb
+- lib/apriori/list.rb
+- lib/apriori/version.rb
+- spec/factories/apriori/apriori.rb
+- spec/lib/apriori/algorithm_spec.rb
+- spec/lib/apriori/item_set_spec.rb
+- spec/lib/apriori/list_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/bmulvihill/apriori
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Ruby implementation of Apriori Algorithm
+test_files:
+- spec/factories/apriori/apriori.rb
+- spec/lib/apriori/algorithm_spec.rb
+- spec/lib/apriori/item_set_spec.rb
+- spec/lib/apriori/list_spec.rb
+- spec/spec_helper.rb