Literatur zur Informationserschließung

Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.

© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 28. April 2022)

Suchergebnisse

• 1
  Quirin, A. ; Cordón, O. ; Santamaría, J. ; Vargas-Quesada, B. ; Moya-Anegón, F.: ¬A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time.
  In: Information processing and management. 44(2008) no.4, S.1611-1623.
  
  Abstract: In the last few years, there is an increasing interest to generate visual representations of very large scientific domains. A methodology based on the combined use of ISI-JCR category cocitation and social networks analysis through the use of the Pathfinder algorithm has demonstrated its ability to achieve high quality, schematic visualizations for these kinds of domains. Now, the next step would be to generate these scientograms in an on-line fashion. To do so, there is a need to significantly decrease the run time of the latter pruning technique when working with category cocitation matrices of a large dimension like the ones handled in these large domains (Pathfinder has a time complexity order of O(n4), with n being the number of categories in the cocitation matrix, i.e., the number of nodes in the network). Although a previous improvement called Binary Pathfinder has already been proposed to speed up the original algorithm, its significant time complexity reduction is not enough for that aim. In this paper, we make use of a different shortest path computation from classical approaches in computer science graph theory to propose a new variant of the Pathfinder algorithm which allows us to reduce its time complexity in one order of magnitude, O(n3), and thus to significantly decrease the run time of the implementation when applied to large scientific domains considering the parameter q = n - 1. Besides, the new algorithm has a much simpler structure than the Binary Pathfinder as well as it saves a significant amount of memory with respect to the original Pathfinder by reducing the space complexity to the need of just storing two matrices. An experimental comparison will be developed using large networks from real-world domains to show the good performance of the new proposal.
  
  Themenfeld: Visualisierung
  Objekt: Pathfinder
  
  
• 2
  Kuri, J.: Gemischtwarenladen : Kostenlose Dienste über Portal Sites.
  In: c't. 1999, H.4, S.122-125.
  
  Abstract: Wem es im Internet zu bunt wird oder wer sich angesichts der Informationsflut nicht zurechtfindet, dem versprechen Portal Sites Abhilfe. Ganz uneigennützig ist das natürlich nicht - die Anbieter möchten möglichst viele Web-Surfer auf ihre Seiten locken. Dafür bieten sie neben Suchmaschinen auch unzählige kostenlose Zusatzdienste an
  
  Themenfeld: Suchmaschinen
  Objekt: AOL ; AltaVista ; Excite ; GeoCities ; Go ; Lycos ; Netcenter ; Microsoft Network ; Pathfinder ; Snap
  Hilfsmittel: Yahoo
  
  
• 3
  Green, E. ; Head, A.J.: Web-based catalogs : is their design language anything to talk about?.
  In: Online. 22(1998) no.4, S.98-105.
  
  Abstract: Stanford University's Socrates II and University of California at Berkeley's Pathfinder are 2 USA World Wide Web based online publication access catalogues under development. They differ in their design language (how an interface functionally and visually communicates to the users). Evaluates each system's interface design and their ability to communicate functionality to users: analyzes design in terms of: colour, buttons, metaphors, layout, and basic and advanced search modes. Concludes that the design languages of both systems have the right directive and have the potential to evolve
  
  Themenfeld: OPAC ; Internet
  Objekt: Socrates ; Pathfinder
  Land/Ort: Berkeley ; Stanford ; USA