ScalableHitsPrestige

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

nz.ac.waikato.mcennis.rat.graph.algorithm.prestige
Class ScalableHitsPrestige

java.lang.Object
  nz.ac.waikato.mcennis.rat.graph.model.ModelShell
      nz.ac.waikato.mcennis.rat.graph.algorithm.prestige.ScalableHitsPrestige

All Implemented Interfaces:: java.io.Serializable, Component, Algorithm, Model

public class ScalableHitsPrestige
extends ModelShell
implements Algorithm
extends ModelShell
implements Algorithm

Class Implementing the HITS algoerithm by a variation of the power metric as defined in Kleinberg99.

Kleinberg, J. 1999. "Authoritative sources in a hyperlinked environment." Journal of the ACM. 46(5):604--32.

See Also:: Serialized Form

Field Summary

Fields inherited from class nz.ac.waikato.mcennis.rat.graph.model.ModelShell
`listener`

Constructor Summary
`ScalableHitsPrestige()` Creates a new instance of HITSPrestige

Method Summary
`protected double`	`error(cern.colt.matrix.DoubleMatrix1D newVector, cern.colt.matrix.DoubleMatrix1D oldVector)`
`void`	`execute(Graph g)` Implements the following algorithm: `Iterate(G,k) G: a collection of n linked pages k: a natural number Let z denote the vector (1, 1, 1, .`
`InputDescriptor[]`	`getInputType()` The input type describes all the different kinds of graph objects that are utilized (and hence required) by this object.
`OutputDescriptor[]`	`getOutputType()` The output type describes all the different kinds of graph objects that are created during the execution of this algorithm.
`Parameter[]`	`getParameter()` List of all parameters this component accepts.
`Parameter`	`getParameter(java.lang.String param)` Returns the specific parameter identified by its key-name.
`SettableParameter[]`	`getSettableParameter()` Returns settable (i.e.
`SettableParameter`	`getSettableParameter(java.lang.String param)` Return the settable parameter namede by this key-name.
`void`	`init(java.util.Properties map)` Parameters to be initialized: 'name' - name of this instance of the algorithm.

Methods inherited from class nz.ac.waikato.mcennis.rat.graph.model.ModelShell
`addListener, fireChange`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Methods inherited from interface nz.ac.waikato.mcennis.rat.graph.model.Model
`addListener`

Constructor Detail

ScalableHitsPrestige

public ScalableHitsPrestige()

Creates a new instance of HITSPrestige

Method Detail

execute

public void execute(Graph g)

Implements the following algorithm:


 Iterate(G,k)
  G: a collection of n linked pages
  k: a natural number
  Let z denote the vector (1, 1, 1, . . . , 1) Rn .
  Set x 0 : z.
  Set y 0 : z.
  For i    1, 2, . . . , k
     Apply the operation to (x i 1 , y i 1 ), obtaining new x-weights x i .
     Apply the operation to (x i , y i 1 ), obtaining new y-weights y i .
     Normalize x i , obtaining x i .
     Normalize y i , obtaining y i .
  End
 Return (x k , y k ).

Specified by:: execute in interface Algorithm

Parameters:: g - graph to be modified