hits 0.0.1 → 0.0.2

data/LICENSE

@@ -1,3 +1,22 @@
-== hits
+(The MIT License)
 
-Put appropriate LICENSE for your project here.
+Copyright &169;2001-2008 Integrallis Software, LLC.
+
+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

@@ -12,7 +12,7 @@ graph = Hits::Graph.new
 graph.add_edge(:bsbodden, :objo, 1.0)
 graph.add_edge(:bsbodden, :nusairat, 2.0)
 graph.add_edge(:bsbodden, :looselytyped, 3.0)
-graph.add_edge(:bsbodden, :neal4d, 1.5)
+graph.add_edge(:bsbodden, :neal4d, 8.5)
 graph.add_edge(:objo, :nusairat, 2.5)
 graph.add_edge(:objo, :bsbodden, 1.0)
 graph.add_edge(:neal4d, :bsbodden, 1.15)
@@ -20,12 +20,19 @@ graph.add_edge(:nusairat, :bsbodden, 4.5)
 
 # textual display of the graph
 puts "graph ==> #{graph}"
+puts "graph max weight ==> #{graph.max_weight}"
+puts "graph min weight ==> #{graph.min_weight}"
 
 # create a HITS for the graph
 hits = Hits::Hits.new(graph)
 
 # show the vertexes incoming and outgoing links (inlinks and outlinks)
-graph.each_vertex { |v| puts "in links for #{v} ==> #{graph.in_links(v)}, out links for #{v} ==> #{graph.out_links(v)}"}
+graph.each_vertex do |vertex| 
+  puts "=== In links for #{vertex} ==="
+  graph.in_links(vertex).each { |in_link| puts in_link }
+  puts "=== Out links for #{vertex} ==="
+  graph.out_links(vertex).each { |out_link| puts out_link }
+end
 
 # compute HITS with the default number of iterations
 hits.compute_hits
@@ -40,3 +47,8 @@ puts "=== TOP AUTHORITIES ==="
 hits.top_authority_scores.each do |authority|
   puts "authority #{authority}"
 end
+
+# print all scores
+graph.each_vertex do |vertex|
+   puts "vertex: #{vertex}, authority: #{hits.authority_scores[vertex]}, hub: #{hits.hub_scores[vertex]}"
+end

data/Rakefile

@@ -8,7 +8,7 @@ require 'spec/rake/spectask'
 
 spec = Gem::Specification.new do |s|
   s.name = 'hits'
-  s.version = '0.0.1'
+  s.version = '0.0.2'
   s.has_rdoc = true
   s.extra_rdoc_files = ['README', 'LICENSE']
   s.summary = "A poor man's implementation of Jon Kleinberg's Hyperlink-Induced Topic Search (HITS) (also known as Hubs and authorities)"

data/lib/hits/graph.rb

@@ -39,6 +39,18 @@ module Hits
     def weight=(to, from, weight)
       @edge_weights[[to, from]] = weight if @edge_weights[[to, from]]
     end
+    
+    def max_weight
+      @edge_weights.values.max
+    end
+    
+    def min_weight
+      @edge_weights.values.min
+    end
+    
+    def weights
+      @edge_weights.values
+    end
 
     def to_s
       @graph.edges.to_a.to_s

data/lib/hits/hits.rb

@@ -2,8 +2,12 @@ module Hits
 
   class Hits
     
-    def initialize(graph)
+    attr_reader :authority_scores
+    attr_reader :hub_scores
+
+    def initialize(graph, use_weights = true)
       @graph = graph
+      @use_weights = use_weights
       @hub_scores = {}
       @authority_scores = {}
       @graph.each_vertex do |vertex|
@@ -18,17 +22,38 @@ module Hits
           authority_score = @graph.in_links(vertex).inject(0.0) { |sum, vertex| sum + @hub_scores[vertex] } if @graph.in_links(vertex)
           hub_score = @graph.out_links(vertex).inject(0.0) { |sum, vertex| sum + @authority_scores[vertex] } if @graph.out_links(vertex)
           @authority_scores[vertex] = authority_score || 0.0
-          @hub_scores[vertex] = hub_score || 0.0   
+          @hub_scores[vertex] = hub_score || 0.0
         end
+        normalize_scores
       end
+      apply_weighting if @use_weights
     end
     
     def top_hub_scores(how_many=5)
-      @hub_scores.sort_by { |k,v| v }.collect { |v| v[0] }.reverse.first(how_many)
+      @hub_scores.sort_by { |k,v| v }.map { |v| v[0] }.reverse.first(how_many)
     end
     
     def top_authority_scores(how_many=5)
-      @authority_scores.sort_by { |k,v| v }.collect { |v| v[0] }.reverse.first(how_many)
+      @authority_scores.sort_by { |k,v| v }.map { |v| v[0] }.reverse.first(how_many)
+    end
+    
+    private 
+    
+    def normalize_scores
+      sum_of_squares_for_authorities = @authority_scores.inject(0.0) { |sum, element| sum + element[1]**2 }
+      sum_of_squares_for_hubs = @hub_scores.inject(0.0) { |sum, element| sum + element[1]**2 }
+      @authority_scores.each { |key, value| @authority_scores[key] = value / sum_of_squares_for_authorities }
+      @hub_scores.each { |key, value| @hub_scores[key] = value / sum_of_squares_for_hubs }
+    end
+    
+    def apply_weighting
+      sum = @graph.weights.inject(0.0) { |sum, weight| sum + weight } 
+      max = @graph.max_weight
+      min = @graph.min_weight
+      @graph.each_vertex do |vertex|
+        @authority_scores[vertex] = (@authority_scores[vertex] / sum) * (max - min) + min
+        @hub_scores[vertex] = (@hub_scores[vertex] / sum) * (max - min) + min       
+      end
     end
 
   end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: hits
 version: !ruby/object:Gem::Version 
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors: 
 - Brian Sam-Bodden
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2009-11-08 00:00:00 -07:00
+date: 2009-11-15 00:00:00 -07:00
 default_executable: 
 dependencies: []