SelfModifiedDecisionTree 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c7fb850d256fb116437ab023bfde0bc87f0c9d0c2e757cc13f1719590ad7bd8e
+  data.tar.gz: 49a3b8e1208132a2aa06c4c69eeec04952fd00106ffd3a6f9468f59a701a118e
+SHA512:
+  metadata.gz: 84a3d84eec538a8b3e5c0638c80e5f5be620a025c2b046b92cc5e13c566a3e35ae40fcce1c0df83cbe50b1496490ce6962707d008712df9a335daaa0b3e2e1e1
+  data.tar.gz: 0ad4e36517845354d4ad5e078242b4e198d2906998839d47a44d21f7fb082e5c8d41ee7bad9a91615513284a77311b899b24302f4fb508aaac103fc828d478ad

data/.rubocop.yml

@@ -0,0 +1,13 @@
+AllCops:
+  TargetRubyVersion: 2.6
+
+Style/StringLiterals:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Style/StringLiteralsInInterpolation:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Layout/LineLength:
+  Max: 120

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2025-08-08
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at TODO: Write your email address. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2025 TODO: Write your name
+
+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,39 @@
+# SelfModifiedDecisionTree
+
+TODO: Delete this and the text below, and describe your gem
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/SelfModifiedDecisionTree`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+## Installation
+
+TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG` with your gem name right after releasing it to RubyGems.org. Please do not do it earlier due to security reasons. Alternatively, replace this section with instructions to install your gem from git if you don't plan to release to RubyGems.org.
+
+Install the gem and add to the application's Gemfile by executing:
+
+    $ bundle add UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+    $ gem install UPDATE_WITH_YOUR_GEM_NAME_PRIOR_TO_RELEASE_TO_RUBYGEMS_ORG
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/SelfModifiedDecisionTree. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/SelfModifiedDecisionTree/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the SelfModifiedDecisionTree project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/SelfModifiedDecisionTree/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,16 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/test_*.rb"]
+end
+
+require "rubocop/rake_task"
+
+RuboCop::RakeTask.new
+
+task default: %i[test rubocop]

data/SelfModifiedDecisionTree.gemspec

@@ -0,0 +1,35 @@
+# frozen_string_literal: true
+
+require_relative "lib/SelfModifiedDecisionTree/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "SelfModifiedDecisionTree"
+  spec.version = SelfModifiedDecisionTree::VERSION
+  spec.authors = ["LWFlouisa"]
+  spec.email = ["lwflouisa@gmail.com"]
+
+  spec.summary = "This gem aims to remove vulnerable functionalities like data marshalling to prevent certain types of attacks."
+  spec.description = "Marshalled data can be deserialized by malicious users in order to compromise the integrity of AI algorithms. Here my theory is removing marshall reduces the attack surface."
+  #spec.homepage = "TODO: Put your gem's website or public repo URL here."
+  spec.license = "MIT"
+  spec.required_ruby_version = ">= 3.2.3"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (File.expand_path(f) == __FILE__) ||
+        f.start_with?(*%w[bin/ test/ spec/ features/ .git .circleci appveyor Gemfile])
+    end
+  end
+
+  spec.bindir = "exe"
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+end

data/lib/SelfModifiedDecisionTree/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module SelfModifiedDecisionTree
+  VERSION = "0.1.0"
+end

data/lib/SelfModifiedDecisionTree.rb

@@ -0,0 +1,406 @@
+# frozen_string_literal: true
+
+require_relative "SelfModifiedDecisionTree/version"
+
+#################################################################################################################
+#                                             Modified Naive Bayes                                              #
+#################################################################################################################
+# This is a modified form of naive bayes that eliminates marshall loading and unloading to prevent specific     #
+# types of deserialization based attacks.                                                                       #
+#################################################################################################################
+class RevisedBayes
+  
+  def initialize(*klasses)
+    @features_count = {}
+
+    @klass_count = {}
+
+    @klasses = klasses
+    
+    klasses.each do |klass|
+      @features_count[klass] = Hash.new(0.0)
+
+      @klass_count[klass] = 0.0
+    end
+  end
+  
+  def train(klass, *features)
+    features.uniq.each do |feature|
+
+      @features_count[klass][feature] += 1
+
+    end
+
+    @klass_count[klass] += 1
+  end
+  
+  #P(Class | Item) = P(Item | Class) * P(Class)
+  def classify(*features)
+    scores = {}
+
+    @klasses.each do |klass|
+      scores[klass] = (prob_of_item_given_a_class(features, klass) * prob_of_class(klass))
+    end
+
+    scores.sort {|a,b| b[1] <=> a[1]}[0]
+  end
+  
+  private
+    
+  # P(Item | Class)
+  def prob_of_item_given_a_class(features, klass)
+    a = features.inject(1.0) do |sum, feature|
+      prob = prob_of_feature_given_a_class(feature, klass)
+      sum *= prob
+    end
+  end
+  
+  # P(Feature | Class)
+  def prob_of_feature_given_a_class(feature, klass) # The brackets are for assigning arguments for local variables. Ex. get_animal(dog, cat)
+
+    return assumed_probability if @features_count[klass][feature] == 0
+    @features_count[klass][feature] / @klass_count[klass]
+  end
+  
+  # P(Class)
+  def prob_of_class(klass)
+    @klass_count[klass] / total_items
+  end
+  
+  def total_items
+    @klass_count.inject(0) do |sum, klass|
+      sum += klass[1]
+    end
+  end
+  
+  # If we have only trained a little bit a class may not have had a feature yet
+  # give it a probability of 0 may not be true so we produce a assumed probability
+  # which gets smaller more we train
+  def assumed_probability
+    0.5 / (total_items/2)
+  end
+  
+end
+#################################################################################################################
+#                                               Modified ID3                                                    #
+#################################################################################################################
+# This is a modified version of ID3 that eliminates marshall saving and unloading given that deserialized user  #
+# input can be quite dangerous.                                                                                 #
+#################################################################################################################
+class Array
+  def classification; collect { |v| v.last }; end
+
+  # calculate information entropy
+  def entropy
+    return 0 if empty?
+
+    info = {}
+    total = 0
+    each {|i| info[i] = !info[i] ? 1 : (info[i] + 1); total += 1}
+
+    result = 0
+    info.each do |symbol, count|
+      result += -count.to_f/total*Math.log(count.to_f/total)/Math.log(2.0) if (count > 0)
+    end
+    result
+  end
+end
+
+module DecisionTree
+  Node = Struct.new(:attribute, :threshold, :gain)
+
+  class ID3Tree
+    def initialize(attributes, data, default, type)
+      @used, @tree, @type = {}, {}, type
+      @data, @attributes, @default = data, attributes, default
+    end
+
+    def train(data=@data, attributes=@attributes, default=@default)
+      attributes = attributes.map {|e| e.to_s}
+      initialize(attributes, data, default, @type)
+
+      # Remove samples with same attributes leaving most common classification
+      data2 = data.inject({}) {|hash, d| hash[d.slice(0..-2)] ||= Hash.new(0); hash[d.slice(0..-2)][d.last] += 1; hash }.map{|key,val| key + [val.sort_by{ |k, v| v }.last.first]}
+
+      @tree = id3_train(data2, attributes, default)
+    end
+
+    def type(attribute)
+      @type.is_a?(Hash) ? @type[attribute.to_sym] : @type
+    end
+
+    def fitness_for(attribute)
+      case type(attribute)
+        when :discrete; fitness = proc{|a,b,c| id3_discrete(a,b,c)}
+        when :continuous; fitness = proc{|a,b,c| id3_continuous(a,b,c)}
+      end
+    end
+
+    def id3_train(data, attributes, default, used={})
+      return default if data.empty?
+
+      # return classification if all examples have the same classification
+      return data.first.last if data.classification.uniq.size == 1
+
+      # Choose best attribute:
+      # 1. enumerate all attributes
+      # 2. Pick best attribute
+      # 3. If attributes all score the same, then pick a random one to avoid infinite recursion.
+      performance = attributes.collect { |attribute| fitness_for(attribute).call(data, attributes, attribute) }
+      max = performance.max { |a,b| a[0] <=> b[0] }
+      min = performance.min { |a,b| a[0] <=> b[0] }
+      max = performance.shuffle.first if max[0] == min[0]
+      best = Node.new(attributes[performance.index(max)], max[1], max[0])
+      best.threshold = nil if @type == :discrete
+      @used.has_key?(best.attribute) ? @used[best.attribute] += [best.threshold] : @used[best.attribute] = [best.threshold]
+      tree, l = {best => {}}, ['>=', '<']
+
+      fitness = fitness_for(best.attribute)
+      case type(best.attribute)
+        when :continuous
+          data.partition { |d| d[attributes.index(best.attribute)] >= best.threshold }.each_with_index  { |examples, i|
+            tree[best][String.new(l[i])] = id3_train(examples, attributes, (data.classification.mode rescue 0), &fitness)
+          }
+        when :discrete
+          values = data.collect { |d| d[attributes.index(best.attribute)] }.uniq.sort
+          partitions = values.collect { |val| data.select { |d| d[attributes.index(best.attribute)] == val } }
+          partitions.each_with_index  { |examples, i|
+            tree[best][values[i]] = id3_train(examples, attributes-[values[i]], (data.classification.mode rescue 0), &fitness)
+          }
+        end
+
+      tree
+    end
+
+    # ID3 for binary classification of continuous variables (e.g. healthy / sick based on temperature thresholds)
+    def id3_continuous(data, attributes, attribute)
+      values, thresholds = data.collect { |d| d[attributes.index(attribute)] }.uniq.sort, []
+      return [-1, -1] if values.size == 1
+      values.each_index { |i| thresholds.push((values[i]+(values[i+1].nil? ? values[i] : values[i+1])).to_f / 2) }
+      thresholds.pop
+      #thresholds -= used[attribute] if used.has_key? attribute
+
+      gain = thresholds.collect { |threshold|
+        sp = data.partition { |d| d[attributes.index(attribute)] >= threshold }
+        pos = (sp[0].size).to_f / data.size
+        neg = (sp[1].size).to_f / data.size
+
+        [data.classification.entropy - pos*sp[0].classification.entropy - neg*sp[1].classification.entropy, threshold]
+      }.max { |a,b| a[0] <=> b[0] }
+
+      return [-1, -1] if gain.size == 0
+      gain
+    end
+
+    # ID3 for discrete label cases
+    def id3_discrete(data, attributes, attribute)
+      values = data.collect { |d| d[attributes.index(attribute)] }.uniq.sort
+      partitions = values.collect { |val| data.select { |d| d[attributes.index(attribute)] == val } }
+      remainder = partitions.collect {|p| (p.size.to_f / data.size) * p.classification.entropy}.inject(0) {|i,s| s+=i }
+
+      [data.classification.entropy - remainder, attributes.index(attribute)]
+    end
+
+    def predict(test)
+      descend(@tree, test)
+    end
+
+    def graph(filename, file_type = "png")
+      require 'graphr'
+      dgp = DotGraphPrinter.new(build_tree)
+      dgp.write_to_file("#{filename}.#{file_type}", file_type)
+    end
+
+    def ruleset
+      rs = Ruleset.new(@attributes, @data, @default, @type)
+      rs.rules = build_rules
+      rs
+    end
+
+    def build_rules(tree=@tree)
+      attr = tree.to_a.first
+      cases = attr[1].to_a
+      rules = []
+      cases.each do |c,child|
+        if child.is_a?(Hash) then
+          build_rules(child).each do |r|
+            r2 = r.clone
+            r2.premises.unshift([attr.first, c])
+            rules << r2
+          end
+        else
+          rules << Rule.new(@attributes, [[attr.first, c]], child)
+        end
+      end
+      rules
+    end
+
+  private
+    def descend(tree, test)
+      attr = tree.to_a.first
+      return @default if !attr
+      if type(attr.first.attribute) == :continuous
+        return attr[1]['>='] if !attr[1]['>='].is_a?(Hash) and test[@attributes.index(attr.first.attribute)] >= attr.first.threshold
+        return attr[1]['<'] if !attr[1]['<'].is_a?(Hash) and test[@attributes.index(attr.first.attribute)] < attr.first.threshold
+        return descend(attr[1]['>='],test) if test[@attributes.index(attr.first.attribute)] >= attr.first.threshold
+        return descend(attr[1]['<'],test) if test[@attributes.index(attr.first.attribute)] < attr.first.threshold
+      else
+        return attr[1][test[@attributes.index(attr[0].attribute)]] if !attr[1][test[@attributes.index(attr[0].attribute)]].is_a?(Hash)
+        return descend(attr[1][test[@attributes.index(attr[0].attribute)]],test)
+      end
+    end
+
+    def build_tree(tree = @tree)
+      return [] unless tree.is_a?(Hash)
+      return [["Always", @default]] if tree.empty?
+
+      attr = tree.to_a.first
+
+      links = attr[1].keys.collect do |key|
+        parent_text = "#{attr[0].attribute}\n(#{attr[0].object_id})"
+        if attr[1][key].is_a?(Hash) then
+          child = attr[1][key].to_a.first[0]
+          child_text = "#{child.attribute}\n(#{child.object_id})"
+        else
+          child = attr[1][key]
+          child_text = "#{child}\n(#{child.to_s.clone.object_id})"
+        end
+        label_text = "#{key} #{type(attr[0].attribute) == :continuous ? attr[0].threshold : ""}"
+
+        [parent_text, child_text, label_text]
+      end
+      attr[1].keys.each { |key| links += build_tree(attr[1][key]) }
+
+      return links
+    end
+  end
+
+  class Rule
+    attr_accessor :premises
+    attr_accessor :conclusion
+    attr_accessor :attributes
+
+    def initialize(attributes,premises=[],conclusion=nil)
+      @attributes, @premises, @conclusion = attributes, premises, conclusion
+    end
+
+    def to_s
+      str = ''
+      @premises.each do |p|
+        str += "#{p.first.attribute} #{p.last} #{p.first.threshold}" if p.first.threshold
+        str += "#{p.first.attribute} = #{p.last}" if !p.first.threshold
+        str += "\n"
+      end
+      str += "=> #{@conclusion} (#{accuracy})"
+    end
+
+    def predict(test)
+      verifies = true;
+      @premises.each do |p|
+        if p.first.threshold then # Continuous
+          if !(p.last == '>=' && test[@attributes.index(p.first.attribute)] >= p.first.threshold) && !(p.last == '<' && test[@attributes.index(p.first.attribute)] < p.first.threshold) then
+            verifies = false; break
+          end
+        else # Discrete
+          if test[@attributes.index(p.first.attribute)] != p.last then
+            verifies = false; break
+          end
+        end
+      end
+      return @conclusion if verifies
+      return nil
+    end
+
+    def get_accuracy(data)
+      correct = 0; total = 0
+      data.each do |d|
+        prediction = predict(d)
+        correct += 1 if d.last == prediction
+        total += 1 if !prediction.nil?
+      end
+      (correct.to_f + 1) / (total.to_f + 2)
+    end
+
+    def accuracy(data=nil)
+      data.nil? ? @accuracy : @accuracy = get_accuracy(data)
+    end
+  end
+
+  class Ruleset
+    attr_accessor :rules
+
+    def initialize(attributes, data, default, type)
+      @attributes, @default, @type = attributes, default, type
+      mixed_data = data.sort_by {rand}
+      cut = (mixed_data.size.to_f * 0.67).to_i
+      @train_data = mixed_data.slice(0..cut-1)
+      @prune_data = mixed_data.slice(cut..-1)
+    end
+
+    def train(train_data=@train_data, attributes=@attributes, default=@default)
+      dec_tree = DecisionTree::ID3Tree.new(attributes, train_data, default, @type)
+      dec_tree.train
+      @rules = dec_tree.build_rules
+      @rules.each { |r| r.accuracy(train_data) } # Calculate accuracy
+      prune
+    end
+
+    def prune(data=@prune_data)
+      @rules.each do |r|
+        (1..r.premises.size).each do
+          acc1 = r.accuracy(data)
+          p = r.premises.pop
+          if acc1 > r.get_accuracy(data) then
+            r.premises.push(p); break
+          end
+        end
+      end
+      @rules = @rules.sort_by{|r| -r.accuracy(data)}
+    end
+
+    def to_s
+      str = ''; @rules.each { |rule| str += "#{rule}\n\n" }
+      str
+    end
+
+    def predict(test)
+      @rules.each do |r|
+        prediction = r.predict(test)
+        return prediction, r.accuracy unless prediction.nil?
+      end
+      return @default, 0.0
+    end
+  end
+
+  class Bagging
+    attr_accessor :classifiers
+    def initialize(attributes, data, default, type)
+      @classifiers, @type = [], type
+      @data, @attributes, @default = data, attributes, default
+    end
+
+    def train(data=@data, attributes=@attributes, default=@default)
+      @classifiers = []
+      10.times { @classifiers << Ruleset.new(attributes, data, default, @type) }
+      @classifiers.each do |c|
+        c.train(data, attributes, default)
+      end
+    end
+
+    def predict(test)
+      predictions = Hash.new(0)
+      @classifiers.each do |c|
+        p, accuracy = c.predict(test)
+        predictions[p] += accuracy unless p.nil?
+      end
+      return @default, 0.0 if predictions.empty?
+      winner = predictions.sort_by {|k,v| -v}.first
+      return winner[0], winner[1].to_f / @classifiers.size.to_f
+    end
+  end
+end
+
+#module SelfModifiedDecisionTree
+#  class Error < StandardError; end
+#  # Your code goes here...
+#end

data/sig/SelfModifiedDecisionTree.rbs

@@ -0,0 +1,4 @@
+module SelfModifiedDecisionTree
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,56 @@
+--- !ruby/object:Gem::Specification
+name: SelfModifiedDecisionTree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- LWFlouisa
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2025-08-09 00:00:00.000000000 Z
+dependencies: []
+description: Marshalled data can be deserialized by malicious users in order to compromise
+  the integrity of AI algorithms. Here my theory is removing marshall reduces the
+  attack surface.
+email:
+- lwflouisa@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".rubocop.yml"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- LICENSE.txt
+- README.md
+- Rakefile
+- SelfModifiedDecisionTree.gemspec
+- lib/SelfModifiedDecisionTree.rb
+- lib/SelfModifiedDecisionTree/version.rb
+- sig/SelfModifiedDecisionTree.rbs
+homepage:
+licenses:
+- MIT
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 3.2.3
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.20
+signing_key:
+specification_version: 4
+summary: This gem aims to remove vulnerable functionalities like data marshalling
+  to prevent certain types of attacks.
+test_files: []