dynamicTree 0.1.0

Sign up to get free protection for your applications and to get access to all the features.
@@ -0,0 +1,7 @@
1
+ ---
2
+ SHA256:
3
+ metadata.gz: 32910405577d087daf85993ed3cf9de4ced00e184204a321d2acd82a65d4b9c0
4
+ data.tar.gz: 76ecf2f5ed2ddf253cdcf2780541cf8d8f70974b9453d3d8475810a6ca501d66
5
+ SHA512:
6
+ metadata.gz: 4ef72dff631a1444835d35f6af96482c2f2e5e93f039090b92e0e69f231c15f967894f925fc21f1499c3abb4134365deb1f9d8b3b8ed45116e1bffb025c53f37
7
+ data.tar.gz: e98c424638b7fa9a4ee7ee23c44a6d8967473bf9be064164c619a841803acd5850eeec894e0da6c99e70eabf37d43dab422212c13a5ade8c44a40ca6f504a116
@@ -0,0 +1,8 @@
1
+ /.bundle/
2
+ /.yardoc
3
+ /_yardoc/
4
+ /coverage/
5
+ /doc/
6
+ /pkg/
7
+ /spec/reports/
8
+ /tmp/
@@ -0,0 +1,74 @@
1
+ # Contributor Covenant Code of Conduct
2
+
3
+ ## Our Pledge
4
+
5
+ In the interest of fostering an open and welcoming environment, we as
6
+ contributors and maintainers pledge to making participation in our project and
7
+ our community a harassment-free experience for everyone, regardless of age, body
8
+ size, disability, ethnicity, gender identity and expression, level of experience,
9
+ nationality, personal appearance, race, religion, or sexual identity and
10
+ orientation.
11
+
12
+ ## Our Standards
13
+
14
+ Examples of behavior that contributes to creating a positive environment
15
+ include:
16
+
17
+ * Using welcoming and inclusive language
18
+ * Being respectful of differing viewpoints and experiences
19
+ * Gracefully accepting constructive criticism
20
+ * Focusing on what is best for the community
21
+ * Showing empathy towards other community members
22
+
23
+ Examples of unacceptable behavior by participants include:
24
+
25
+ * The use of sexualized language or imagery and unwelcome sexual attention or
26
+ advances
27
+ * Trolling, insulting/derogatory comments, and personal or political attacks
28
+ * Public or private harassment
29
+ * Publishing others' private information, such as a physical or electronic
30
+ address, without explicit permission
31
+ * Other conduct which could reasonably be considered inappropriate in a
32
+ professional setting
33
+
34
+ ## Our Responsibilities
35
+
36
+ Project maintainers are responsible for clarifying the standards of acceptable
37
+ behavior and are expected to take appropriate and fair corrective action in
38
+ response to any instances of unacceptable behavior.
39
+
40
+ Project maintainers have the right and responsibility to remove, edit, or
41
+ reject comments, commits, code, wiki edits, issues, and other contributions
42
+ that are not aligned to this Code of Conduct, or to ban temporarily or
43
+ permanently any contributor for other behaviors that they deem inappropriate,
44
+ threatening, offensive, or harmful.
45
+
46
+ ## Scope
47
+
48
+ This Code of Conduct applies both within project spaces and in public spaces
49
+ when an individual is representing the project or its community. Examples of
50
+ representing a project or community include using an official project e-mail
51
+ address, posting via an official social media account, or acting as an appointed
52
+ representative at an online or offline event. Representation of a project may be
53
+ further defined and clarified by project maintainers.
54
+
55
+ ## Enforcement
56
+
57
+ Instances of abusive, harassing, or otherwise unacceptable behavior may be
58
+ reported by contacting the project team at gitea@fake.local. All
59
+ complaints will be reviewed and investigated and will result in a response that
60
+ is deemed necessary and appropriate to the circumstances. The project team is
61
+ obligated to maintain confidentiality with regard to the reporter of an incident.
62
+ Further details of specific enforcement policies may be posted separately.
63
+
64
+ Project maintainers who do not follow or enforce the Code of Conduct in good
65
+ faith may face temporary or permanent repercussions as determined by other
66
+ members of the project's leadership.
67
+
68
+ ## Attribution
69
+
70
+ This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
71
+ available at [https://contributor-covenant.org/version/1/4][version]
72
+
73
+ [homepage]: https://contributor-covenant.org
74
+ [version]: https://contributor-covenant.org/version/1/4/
data/Gemfile ADDED
@@ -0,0 +1,6 @@
1
+ source "https://rubygems.org"
2
+
3
+ # Specify your gem's dependencies in dynamicTree.gemspec
4
+ gemspec
5
+
6
+ gem "rake", "~> 12.0"
@@ -0,0 +1,21 @@
1
+ The MIT License (MIT)
2
+
3
+ Copyright (c) 2020 Gitea
4
+
5
+ Permission is hereby granted, free of charge, to any person obtaining a copy
6
+ of this software and associated documentation files (the "Software"), to deal
7
+ in the Software without restriction, including without limitation the rights
8
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
+ copies of the Software, and to permit persons to whom the Software is
10
+ furnished to do so, subject to the following conditions:
11
+
12
+ The above copyright notice and this permission notice shall be included in
13
+ all copies or substantial portions of the Software.
14
+
15
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
21
+ THE SOFTWARE.
@@ -0,0 +1,44 @@
1
+ # DynamicTree
2
+
3
+ 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/dynamicTree`. To experiment with that code, run `bin/console` for an interactive prompt.
4
+
5
+ TODO: Delete this and the text above, and describe your gem
6
+
7
+ ## Installation
8
+
9
+ Add this line to your application's Gemfile:
10
+
11
+ ```ruby
12
+ gem 'dynamicTree'
13
+ ```
14
+
15
+ And then execute:
16
+
17
+ $ bundle install
18
+
19
+ Or install it yourself as:
20
+
21
+ $ gem install dynamicTree
22
+
23
+ ## Usage
24
+
25
+ TODO: Write usage instructions here
26
+
27
+ ## Development
28
+
29
+ After checking out the repo, run `bin/setup` to install dependencies. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
30
+
31
+ 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 tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
32
+
33
+ ## Contributing
34
+
35
+ Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/dynamicTree. 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]/dynamicTree/blob/master/CODE_OF_CONDUCT.md).
36
+
37
+
38
+ ## License
39
+
40
+ The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
41
+
42
+ ## Code of Conduct
43
+
44
+ Everyone interacting in the DynamicTree project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/dynamicTree/blob/master/CODE_OF_CONDUCT.md).
@@ -0,0 +1,2 @@
1
+ require "bundler/gem_tasks"
2
+ task :default => :spec
@@ -0,0 +1,14 @@
1
+ #!/usr/bin/env ruby
2
+
3
+ require "bundler/setup"
4
+ require "dynamicTree"
5
+
6
+ # You can add fixtures and/or initialization code here to make experimenting
7
+ # with your gem easier. You can also use a different console, if you like.
8
+
9
+ # (If you use this, don't forget to add pry to your Gemfile!)
10
+ # require "pry"
11
+ # Pry.start
12
+
13
+ require "irb"
14
+ IRB.start(__FILE__)
@@ -0,0 +1,8 @@
1
+ #!/usr/bin/env bash
2
+ set -euo pipefail
3
+ IFS=$'\n\t'
4
+ set -vx
5
+
6
+ bundle install
7
+
8
+ # Do any other automated setup that you need to do here
@@ -0,0 +1,24 @@
1
+ require_relative 'lib/dynamicTree/version'
2
+
3
+ Gem::Specification.new do |spec|
4
+ spec.name = "dynamicTree"
5
+ spec.version = DynamicTree::VERSION
6
+ spec.authors = ["Gitea"]
7
+ spec.email = ["lwflouisa@riseup.net"]
8
+
9
+ spec.summary = %q{A dynamic decision tree for measuring biometrics from data files.}
10
+ spec.description = %q{Ive been consistently dissappointed with how limited normal decision trees, and how it's not really possible use both normal decision trees, and multi-factor trees in the same algorithm. Enter Dynamic Tree, which allows you to run a multi factor test and a single factor test for each individual factor in the same movement.}
11
+ spec.homepage = "https://lwflouisa.github.io/WeaverBlog"
12
+ spec.license = "MIT"
13
+ spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
14
+
15
+ # Specify which files should be added to the gem when it is released.
16
+ # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
17
+ spec.files = Dir.chdir(File.expand_path('..', __FILE__)) do
18
+ `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
19
+ end
20
+
21
+ spec.bindir = "exe"
22
+ spec.executables = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
23
+ spec.require_paths = ["lib"]
24
+ end
@@ -0,0 +1,220 @@
1
+ require "dynamicTree/version"
2
+
3
+ module DynamicTree
4
+ class Error < StandardError; end
5
+
6
+ # Train on one example set for eight factors.
7
+ class Sprout
8
+
9
+ # These are the different sets of training examples. In this algorithm, each attribute has different training examples.
10
+ def self.name_examples
11
+ input = File.read("data/number/input.txt").strip.to_i
12
+
13
+ counter = File.readlines("data/biometrics/names/names.txt").size.to_i
14
+ safety_reset = counter - 1
15
+
16
+ # Safety Reset
17
+ if input > safety_reset
18
+ input = 0
19
+ end
20
+
21
+ training_examples = File.readlines("data/biometrics/names/names.txt")
22
+
23
+ current_biometric = training_examples[input]
24
+
25
+ puts current_biometric
26
+ end
27
+
28
+ def self.id_examples
29
+ input = File.read("data/number/input.txt").strip.to_i
30
+
31
+ counter = File.readlines("data/biometrics/id_numbers/id_numbers.txt").size.to_i
32
+ safety_reset = counter - 1
33
+
34
+ # Safety Reset
35
+ if input > safety_reset
36
+ input = 0
37
+ end
38
+
39
+ training_examples = File.readlines("data/biometrics/id_numbers/id_numbers.txt")
40
+
41
+ current_biometric = training_examples[input]
42
+
43
+ puts current_biometric
44
+ end
45
+
46
+ def self.age_examples
47
+ input = File.read("data/number/input.txt").strip.to_i
48
+
49
+ counter = File.readlines("data/biometrics/ages/ages.txt").size.to_i
50
+ safety_reset = counter - 1
51
+
52
+ # Safety Reset
53
+ if input > safety_reset
54
+ input = 0
55
+ end
56
+
57
+ training_examples = File.readlines("data/biometrics/ages/ages.txt")
58
+
59
+ current_biometric = training_examples[input]
60
+
61
+ puts current_biometric
62
+ end
63
+
64
+ def self.height_examples
65
+ input = File.read("data/number/input.txt").strip.to_i
66
+
67
+ counter = File.readlines("data/biometrics/heights/heights.txt").size.to_i
68
+ safety_reset = counter - 1
69
+
70
+ # Safety Reset
71
+ if input > safety_reset
72
+ input = 0
73
+ end
74
+
75
+ training_examples = File.readlines("data/biometrics/heights/heights.txt")
76
+
77
+ current_biometric = training_examples[input]
78
+
79
+ puts current_biometric
80
+ end
81
+
82
+ def self.weight_examples
83
+ input = File.read("data/number/input.txt").strip.to_i
84
+
85
+ counter = File.readlines("data/biometrics/weights/weights.txt").size.to_i
86
+ safety_reset = counter - 1
87
+
88
+ # Safety Reset
89
+ if input > safety_reset
90
+ input = 0
91
+ end
92
+
93
+ training_examples = File.readlines("data/biometrics/weights/weights.txt")
94
+
95
+ current_biometric = training_examples[input]
96
+
97
+ puts current_biometric
98
+ end
99
+
100
+ def self.hair_color_examples
101
+ input = File.read("data/number/input.txt").strip.to_i
102
+
103
+ counter = File.readlines("data/biometrics/hair_colors/hair_colors.txt").size.to_i
104
+ safety_reset = counter - 1
105
+
106
+ # Safety Reset
107
+ if input > safety_reset
108
+ input = 0
109
+ end
110
+
111
+ training_examples = File.readlines("data/biometrics/hair_colors/hair_colors.txt")
112
+
113
+ current_biometric = training_examples[input]
114
+
115
+ puts current_biometric
116
+ end
117
+
118
+ def self.eye_color_examples
119
+ input = File.read("data/number/input.txt").strip.to_i
120
+
121
+ counter = File.readlines("data/biometrics/eye_colors/eye_colors.txt").size.to_i
122
+ safety_reset = counter - 1
123
+
124
+ # Safety Reset
125
+ if input > safety_reset
126
+ input = 0
127
+ end
128
+
129
+ training_examples = File.readlines("data/biometrics/eye_colors/eye_colors.txt")
130
+
131
+ current_biometric = training_examples[input]
132
+
133
+ puts current_biometric
134
+ end
135
+
136
+ def self.skin_tone_examples
137
+ input = File.read("data/number/input.txt").strip.to_i
138
+
139
+ counter = File.readlines("data/biometrics/skin_tones/skin_tones.txt").size.to_i
140
+ safety_reset = counter - 1
141
+
142
+ # Safety Reset
143
+ if input > safety_reset
144
+ input = 0
145
+ end
146
+
147
+ training_examples = File.readlines("data/biometrics/skin_tones/skin_tones.txt")
148
+
149
+ current_biometric = training_examples[input]
150
+
151
+ puts current_biometric
152
+ end
153
+
154
+ def self.relationship_examples
155
+ input = File.read("data/number/input.txt").strip.to_i
156
+
157
+ counter = File.readlines("data/biometrics/relationships/relationships.txt").size.to_i
158
+ safety_reset = counter - 1
159
+
160
+ # Safety Reset
161
+ if input > safety_reset
162
+ input = 0
163
+ end
164
+
165
+ training_examples = File.readlines("data/biometrics/relationships/relationships.txt")
166
+
167
+ current_biometric = training_examples[input]
168
+
169
+ puts current_biometric
170
+ end
171
+
172
+ # Decision tree that uses one biometric in isolation.
173
+ def self.attribute_trigger
174
+ input = File.read("data/number/input.txt").strip.to_i
175
+
176
+ # Safety Reset
177
+ if input > 8
178
+ input = 0
179
+ end
180
+
181
+ attributes = [
182
+ "Name", "ID", "Age",
183
+ "Height", "Weight", "Hair Color",
184
+ "Eye Color", "Skin Tone", "Relationship",
185
+ ]
186
+
187
+ set_attribute = attributes[input]
188
+
189
+ print "#{set_attribute}: "
190
+
191
+ if set_attribute == "Name"; DynamicTree::Sprout.name_examples
192
+ elsif set_attribute == "ID"; DynamicTree::Sprout.id_examples
193
+ elsif set_attribute == "Age"; DynamicTree::Sprout.age_examples
194
+ elsif set_attribute == "Height"; DynamicTree::Sprout.height_examples
195
+ elsif set_attribute == "Weight"; DynamicTree::Sprout.weight_examples
196
+ elsif set_attribute == "Hair Color"; DynamicTree::Sprout.hair_color_examples
197
+ elsif set_attribute == "Eye Color"; DynamicTree::Sprout.eye_color_examples
198
+ elsif set_attribute == "Skin Tone"; DynamicTree::Sprout.skin_tone_examples
199
+ elsif set_attribute == "Relationship"; DynamicTree::Sprout.relationship_examples
200
+ end
201
+ end
202
+
203
+ # Decision tree that uses one biometric in isolation.
204
+ def self.initialize_tree
205
+ puts "__Profile__"
206
+ DynamicTree::Sprout.name_examples
207
+ DynamicTree::Sprout.id_examples
208
+ DynamicTree::Sprout.age_examples
209
+ DynamicTree::Sprout.height_examples
210
+ DynamicTree::Sprout.weight_examples
211
+ DynamicTree::Sprout.hair_color_examples
212
+ DynamicTree::Sprout.eye_color_examples
213
+ DynamicTree::Sprout.skin_tone_examples
214
+ DynamicTree::Sprout.relationship_examples
215
+
216
+ DynamicTree::Sprout.attribute_trigger
217
+ end
218
+
219
+ end
220
+ end
@@ -0,0 +1,3 @@
1
+ module DynamicTree
2
+ VERSION = "0.1.0"
3
+ end
metadata ADDED
@@ -0,0 +1,57 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: dynamicTree
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.1.0
5
+ platform: ruby
6
+ authors:
7
+ - Gitea
8
+ autorequire:
9
+ bindir: exe
10
+ cert_chain: []
11
+ date: 2020-10-05 00:00:00.000000000 Z
12
+ dependencies: []
13
+ description: Ive been consistently dissappointed with how limited normal decision
14
+ trees, and how it's not really possible use both normal decision trees, and multi-factor
15
+ trees in the same algorithm. Enter Dynamic Tree, which allows you to run a multi
16
+ factor test and a single factor test for each individual factor in the same movement.
17
+ email:
18
+ - lwflouisa@riseup.net
19
+ executables: []
20
+ extensions: []
21
+ extra_rdoc_files: []
22
+ files:
23
+ - ".gitignore"
24
+ - CODE_OF_CONDUCT.md
25
+ - Gemfile
26
+ - LICENSE.txt
27
+ - README.md
28
+ - Rakefile
29
+ - bin/console
30
+ - bin/setup
31
+ - dynamicTree.gemspec
32
+ - lib/dynamicTree.rb
33
+ - lib/dynamicTree/version.rb
34
+ homepage: https://lwflouisa.github.io/WeaverBlog
35
+ licenses:
36
+ - MIT
37
+ metadata: {}
38
+ post_install_message:
39
+ rdoc_options: []
40
+ require_paths:
41
+ - lib
42
+ required_ruby_version: !ruby/object:Gem::Requirement
43
+ requirements:
44
+ - - ">="
45
+ - !ruby/object:Gem::Version
46
+ version: 2.3.0
47
+ required_rubygems_version: !ruby/object:Gem::Requirement
48
+ requirements:
49
+ - - ">="
50
+ - !ruby/object:Gem::Version
51
+ version: '0'
52
+ requirements: []
53
+ rubygems_version: 3.1.2
54
+ signing_key:
55
+ specification_version: 4
56
+ summary: A dynamic decision tree for measuring biometrics from data files.
57
+ test_files: []