Skip to main content
SpringerLink
Log in

Web networks of the science system: Weighted hubs and authorities

  • Published:
Scientometrics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Technology Management, ARC system research GmbH, Seiberdorf, A-2444 Seibersdorf, Austria

    Marianne Hörlesberger

  2. Technology Management, ARC system research GmbH, Seibersdorf (Austria)

    Edgar Schiebel

Authors
  1. Marianne Hörlesberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edgar Schiebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hörlesberger, M., Schiebel, E. Web networks of the science system: Weighted hubs and authorities. Scientometrics 66, 263–278 (2006). https://doi.org/10.1007/s11192-006-0020-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11192-006-0020-5

Keywords

Search

Navigation