In the first read-in, the submitted file is validated against the NWB format. Once it is validated, the number of nodes (n) in the network is passed on. This is used to initialize the matrices that will be used for the HITS computation. An Adjacency matrix (n x n), Authority matrix (n x 1), Hub matrix (n x 1) are initialized with default values (0 for adjacency, 1 for authority and hub matrices).
In the second read-in, the adjacency matrix is populated with either the default edge weight (1.0) or the value from the file. When the network is directed, the matrix element corresponding to *_\[ALGDOC:source node, target node\]_* is populated. In case of an undirected network, the matrix elements corresponding to *_\[ALGDOC:node1, node2\]_* and *_\[ALGDOC:node2, node1\]_* are populated with the same edge weight. Wiki Markup
Next transpose of the adjacency matrix is created. Now the Authority and Hub matrices are updated in the following manner,
- Kleinberg, Jon. Authoritative sources in a hyperlinked environment. In Journal of ACM, pages 604-632, September, 1999. Link
- Chakrabarti, Soumen., Dom, Byron., Ravi Kumar, S., Raghavan, Prabhakar., Rajagopalan, Sridhar., Tomkins, Andrew., Gibson, David., Kleinberg, Jon. Mining the Web's Link Structure. In Computer, pages 60-67, August, 1999. Link
- Bharat, Krishna., Henzinger, Monika R. Improved algorithms for topic distillation in a hyperlinked environment. At Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pages 104-111, 1998. Link
- Dean, Jeffrey., Henzinger, Monika. Finding Related Pages in the World Wide Web. At Conference, pages 389-401, 1999. Link