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)
401Chakrabarti, S. ; Dom, B. ; Kumar, S.R. ; Raghavan, P. ; Rajagopalan, S. ; Tomkins, A. ; Kleinberg, J.M. ; Gibson, D.: Neue Pfade durch den Internet-Dschungel : Die zweite Generation von Web-Suchmaschinen.
In: Spektrum der Wissenschaft. 1999, H.8, S.44-49.
Abstract: Die im WWW verfügbare Datenmenge wächst mit atemberaubender Geschwindigkeit; entsprechend schwieriger wird es, relevante Informationen zu finden. ein neues Analyseverfahren stellt nahezu automatische Abhilfe in Aussicht
Inhalt: Ausnutzen der Hyperlinks für verbesserte Such- und Findeverfahren; Darstellung des HITS-Algorithmus
Anmerkung: Vgl. auch: http://www.almaden.ibm.com/cs/k53/clever.html
Themenfeld: Suchmaschinen ; Retrievalalgorithmen
Objekt: Google ; HITS-Algorithmus
402Brin, S. ; Page, L.: ¬The anatomy of a large-scale hypertextual Web search engine.
In: Computer networks. 30(1998) no.1-7, S.107-117.
Abstract: In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://google.stanford.edu/. To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want
Anmerkung: Auch unter: http://dbpubs.stanford.edu:8090/pub/1998-8 oder: http://citeseer.nj.nec.com/brin98anatomy.html
Objekt: Google PageRank -> PageRank
404Bryan, K. ; Leise, T.: ¬The $25.000.000.000 eigenvector : the linear algebra behind Google.
In: SIAM review. 48(2006) no.3, S.569-581.
Abstract: Google's success derives in large part from its PageRank algorithm, which ranks the importance of webpages according to an eigenvector of a weighted link matrix. Analysis of the PageRank formula provides a wonderful applied topic for a linear algebra course. Instructors may assign this article as a project to more advanced students, or spend one or two lectures presenting the material with assigned homework from the exercises. This material also complements the discussion of Markov chains in matrix algebra. Maple and Mathematica files supporting this material can be found at www.rose-hulman.edu/~bryan.
Inhalt: Vgl. auch unter: http://www.rose-hulman.edu/~bryan/googleFinalVersionFixed.pdf.
405Hughes, T. ; Acharya, A.: ¬An interview with Anurag Acharya, Google Scholar lead engineer.
Abstract: When I interned at Google last summer after getting my MSI degree, I worked on projects for the Book Search and Google Scholar teams. I didn't know it at the time, but in completing my research over the course of the summer, I would become the resident expert on how universities were approaching Google Scholar as a research tool and how they were implementing Scholar on their library websites. Now working at an academic library, I seized a recent opportunity to sit down with Anurag Acharya, Google Scholar's founding engineer, to delve a little deeper into how Scholar features are developed and prioritized, what Scholar's scope and aims are, and where the product is headed. -Tracey Hughes, GIS Coordinator, Social Sciences & Humanities Library, University of California San Diego
Objekt: Google Scholar