February 2006 , Volume 66 , Issue 2, pp 263-278
Web networks of the science system: Weighted hubs and authorities
Purchase on Springer.com
$39.95 / ?4.95 / ￡29.95 *
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Summary
Visualization with the algorithm of BibTechMon provides the out-degree as well as the in-degree. The analysis shows that both frequency and co-occurrences of objects (nodes in the network) support the idea of Kleinberg's algorithm. The analysis of the algorithm shows clearly that strongly linked scores lead the iteration to a convergence and give the highest weights. Therefore BibTechMon visualizes the results well.
