avsd 0.0.1 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: bee7f10608a60d9182ab32aee8f010312b983525
-  data.tar.gz: 698a2edb8bc3086a7683eb1973706665590353aa
+  metadata.gz: ee1b9d6846cba3cc3b0ba4d633d935888876ba8e
+  data.tar.gz: d479e01f10d5253800042af9dcc05127b8980446
 SHA512:
-  metadata.gz: 45b83e80eb117f1070a6de2c28db55b2ec474b32a35672aa75cfdea02c56f561d0abfc165d0b82ccc163cb01a9011abc6ab199a90f7f091b387ada1a36e5955d
-  data.tar.gz: bd7eebcfd5f33b9c9366b7553c82c3f07501f0583d94e2407024ba60c7957ec074f3d3ef8ed1d5939ddc1bcdebb58874405c8ea23c8fc452337c493ee845c878
+  metadata.gz: 8d5b9860bba1f1389584a58d09a36a8c1e4296496b5fc2cdb9cf6a6621588c95ccddf17bbe9da7288ae07ce47d0f9024054c840968acc3d0c1f6bf54fd7c7b07
+  data.tar.gz: e01332f6a6c3643a093f0fe687a2ac6f137fb013e9889e04f0af9e398d617aef3340ff934081ce45b19625d3ee0fec6a2abf7777cf1a0ad34d64305ef864d669

data/README.md

@@ -1,6 +1,8 @@
 # Avsd
 
-Avsd is AVSD Recommend Algorithm implimatation on Ruby gem. AVSD Recommend Algorithm recommends sets of items based on multiple exisiting sets of items.
+###THIS GEM IS UNDEREXPERIMENT
+
+Avsd is AVSD Recommend Algorithm implimatation on Ruby gem. AVSD Recommend Algorithm recommends sets of items based on multiple exisiting sets of items with a measure of creativity.
 
 ## Installation
 

data/lib/avsd.rb

@@ -92,72 +92,75 @@ class Array
     end
 end
 
-class Avsd
-	def initialize(records)
-		@labels = records.flatten.uniq
-		@co_mat = Matrix.unit(labels.length)
-		self.band_matrix records
-		self.g_short_mat
-	end
+module Avsd
+	class Avsd
+		def initialize(records)
+			@labels = records.flatten.uniq
+			@co_mat = Matrix.unit(labels.length)
+			self.band_matrix records
+			self.g_short_mat
+		end
 
-	def band label1, label2
-		@co_mat[@labels.index(label1), @labels.index(label2)] += 1
-	end
+		def band label1, label2
+			@co_mat[@labels.index(label1), @labels.index(label2)] += 1
+		end
 
-	def band_matrix records
-		@labels.each do |label_a|
-			records.each do |record|
-				if record.include? label_a
-					record.each do |label_b|
-						band(label_a, label_b)
+		def band_matrix records
+			@labels.each do |label_a|
+				records.each do |record|
+					if record.include? label_a
+						record.each do |label_b|
+							band(label_a, label_b)
+						end
 					end
 				end
 			end
+			@co_mat.mirror_diagonal.zero_diagonal
 		end
-		@co_mat.mirror_diagonal.zero_diagonal
-	end
 
-	def g_short_mat
-		@short_mat = Matrix.zero(@co_mat.column_size)
-		@short_mat = @short_mat.collect { |x| x = nil }
-		for s_id in 0..@co_mat.column_size - 1
-			q = PriorityQueue.new
-			q[s_id] = 0
-			while not q.empty?
-				f = q.delete_min
-				@short_mat[s_id, f[0]] = f[1]
-				@short_mat.inspect
-				@co_mat.row(f[0]).each_with_index do |val, i|
-					next if i == f[0] or val == 0 or @short_mat[s_id, i] != nil
-					if q[i] == nil or q[i] < f[1] + val
-						q[i] = f[1] + val
+		def g_short_mat
+			@short_mat = Matrix.zero(@co_mat.column_size)
+			@short_mat = @short_mat.collect { |x| x = nil }
+			for s_id in 0..@co_mat.column_size - 1
+				q = PriorityQueue.new
+				q[s_id] = 0
+				while not q.empty?
+					f = q.delete_min
+					@short_mat[s_id, f[0]] = f[1]
+					@short_mat.inspect
+					@co_mat.row(f[0]).each_with_index do |val, i|
+						next if i == f[0] or val == 0 or @short_mat[s_id, i] != nil
+						if q[i] == nil or q[i] < f[1] + val
+							q[i] = f[1] + val
+						end
 					end
 				end
 			end
 		end
-	end
 
-	def sample num
-		arr = Array.new(@short_mat.column_size) { |idx| idx }
-		set = arr.sample num
-		arr = []
-		set.length.times do |i|
-			for k in i + 1..set.length - 1
-				arr << [set[i], set[k]]
+		def sample num
+			arr = Array.new(@short_mat.column_size) { |idx| idx }
+			set = arr.sample num
+			arr = []
+			set.length.times do |i|
+				for k in i + 1..set.length - 1
+					arr << [set[i], set[k]]
+				end
 			end
+			sampled_labels = Hash.new
+			set.each do |id|
+				sampled_labels[@labels[id]] = id
+			end
+			vals = []
+			arr.each do |id_set|
+				vals << @short_mat[id_set[0], id_set[1]]
+			end
+			[sampled_labels, vals, vals.mean, vals.sd].inspect
 		end
-		sampled_labels = Hash.new
-		set.each do |id|
-			sampled_labels[@labels[id]] = id
-		end
-		vals = []
-		arr.each do |id_set|
-			vals << @short_mat[id_set[0], id_set[1]]
-		end
-		[sampled_labels, vals, vals.mean, vals.sd].inspect
+
+		attr_accessor :short_mat, :co_mat, :labels
 	end
 
-	attr_accessor :short_mat, :co_mat, :labels
 end
 
 

data/lib/avsd/version.rb

@@ -1,3 +1,3 @@
 module Avsd
-  VERSION = "0.0.1"
+  VERSION = "0.0.3"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: avsd
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.3
 platform: ruby
 authors:
 - Yui Kita