ruby-svd 0.5.0 → 0.5.1

data/README.markdown

@@ -0,0 +1,36 @@
+Ruby SVD
+========
+Singular Value Decomposition for Ruby with no dependency on GSL or LAPACK.
+
+About
+-----
+Ruby SVD provides an interface to the Numerical Recipies C implementation of an SVD matrix decomposer. It also includes an extension to the native Ruby Matrix class with a simple LSA
+method (decomposes the matrix, transposes matrix V, diagonalises the S array into a matrix, then removes all but the two leading terms in S to compress the original matrix to two dimensions).
+
+Sample Usage
+------------
+```ruby
+require 'ruby-svd'
+
+tdm = SVDMatrix.new(4, 2)
+tdm.set_row(0, [1,0])
+tdm.set_row(1, [1,0])
+tdm.set_row(2, [0,1])
+tdm.set_row(3, [0,1])
+
+puts "== Term document matrix:"
+p tdm
+
+puts "\n== Decomposing matrix:"
+lsa = LSA.new(tdm)
+p lsa
+
+puts "\n== Classifying new column vector: [1, 0.5, 0, 0.5]"
+puts "Format is [column, similarity]"
+ranks = lsa.classify_vector([1,0.5,0,0.5])
+p ranks
+
+sorted_ranks = ranks.sort_by(&:last).reverse
+puts "\n== Vector most similar to column #{sorted_ranks.first[0]}"
+p tdm.column(sorted_ranks.first[0])
+```

data/lib/lsa.rb

@@ -7,6 +7,10 @@ class LSA
     @u, @s, @v = matrix.decompose(2)
   end
   
+  def inspect
+    "U:\n#{@u.inspect}\n\nS:\n#{@s.inspect}\n\nV:\n#{@v.inspect}"
+  end
+  
   # Return a distance (cosine similarity) between a new vector,
   # and all the clusters (columns) used in the original matrix.
   # Returns a sorted list of indexes and distances,

data/lib/svd_matrix.rb

@@ -7,6 +7,7 @@ class SVDMatrix < Matrix
   # Create a new SVD Matrix with m rows, n columns
   def initialize(m, n)
     @rows = Array.new(m)
+    @column_size = n
     m.times {|i| @rows[i] = Array.new(n)}
   end
   
@@ -22,7 +23,7 @@ class SVDMatrix < Matrix
   
   # Nicely formatted inspect string for the matrix
   def inspect
-    @rows.collect {|row| "#{row.inspect}\n"}
+    @rows.collect {|row| row.inspect}.join("\n")
   end
 
   # Perform SVD and decompose the matrix into three matrices:

metadata

@@ -1,12 +1,8 @@
 --- !ruby/object:Gem::Specification 
 name: ruby-svd
 version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 5
-  - 0
-  version: 0.5.0
+  prerelease: 
+  version: 0.5.1
 platform: ruby
 authors: 
 - Will Cannings
@@ -14,7 +10,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-09-30 00:00:00 +10:00
+date: 2011-05-30 00:00:00 +10:00
 default_executable: 
 dependencies: []
 
@@ -26,7 +22,7 @@ extensions:
 - ext/extconf.rb
 extra_rdoc_files: 
 - LICENSE
-- README
+- README.markdown
 files: 
 - ext/extconf.rb
 - ext/nrutil.h
@@ -36,14 +32,14 @@ files:
 - lib/ruby-svd.rb
 - lib/svd_matrix.rb
 - LICENSE
-- README
+- README.markdown
 has_rdoc: true
 homepage: http://github.com/willcannings/ruby-svd
 licenses: []
 
 post_install_message: 
-rdoc_options: 
-- --charset=UTF-8
+rdoc_options: []
+
 require_paths: 
 - lib
 - ext
@@ -52,21 +48,17 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      segments: 
-      - 0
       version: "0"
 required_rubygems_version: !ruby/object:Gem::Requirement 
   none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
-      segments: 
-      - 0
       version: "0"
 requirements: []
 
 rubyforge_project: 
-rubygems_version: 1.3.7
+rubygems_version: 1.6.2
 signing_key: 
 specification_version: 3
 summary: SVD for Ruby

data/README

@@ -1,6 +0,0 @@
-Singular Value Decomposition for Ruby with no dependency on GSL or LAPACK. Uses a C extension
-to the Numerical Recipies C implementation of an SVD matrix decomposer. Also includes an
-extension to the native Ruby Matrix class with a simple LSA method (decomposes the matrix,
-transposes matrix V, diagonalises the S array into a matrix, then removes all but the two
-leading terms in S to compress the original matrix to two dimensions).
-