Web networks of the science system: Weighted hubs and authorities
- 93 Downloads
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.
KeywordsWorld Wide Science System International Patent Classification Outgoing Link Incoming Link
Unable to display preview. Download preview PDF.