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: 04. Juni 2021)
1141Notess, G.R.: ¬The InfoSeek databases.
In: Database. 18(1995) no.4, S.85-87.
Abstract: InfoSeek is a new full text search service that enabling searching of the WWW pages, USENET News, over 50 computer magazoines, newspaper newswires and press releases, company profiles, movie reviews, and technical support databases. It is aiming the Internet and computer user market, combining computer news and business databases with an easy interface and competitive pricing. Describes the databases offered, and pricing structure. The WWW Pages Database is the most heavily used database
1142Raeder, A.: Cataloguing the Web.
In: Searcher. 3(1995) no.7, S.12-19.
Abstract: Lists and describes sites that attempt to aid Internet searchers by helping them locate sites, files or information. Gives an overview of the methods used. Covers the following sides: Aliweb, ArchiPlex Archie Gateway, CUI W3, Clearing House for Subject Oriented Internet Resource Guide, InfoSeek, JumpStation, Lawrence Livermore National Laboratories List of Lists, Lycos WWW Search Engine, Mother of all BBSs, NIKOS, Plant Earth Home Page, Standford Newnews Filtering Service, WWW Home Page Harvest Browser, WWW virtual Library, WWW Wanderer Index, WWW Worm, Web Crawler, Whole Internet Catalog, and Yahoo Index to the Internet
Objekt: Aliweb ; ArchiPlex ; CUI W3 ; InfoSeek ; JumpStation ; Lycos ; WWW Worm ; WebCrawler ; Yahoo
1143Lester, D.: Yahoo! : Profile of a Web database.
In: Database. 18(1995) no.6, S.46-50.
Abstract: Yahoo is a search engine to the WWW. Originally developed by students at Stanford University in Palo Alto, it became a commercial system in 1994. The access method used for browsing Yahoo is a hierarchical structure or outline. Entries are collected by browsing the WWW and from the contributions of others. Assesses why it has grown so quickly and its strengths. The service aims to generate income through advertising
1144Pasicznyuk, R.W.: Searching for the information on the Net : new wine into new wine skins.
In: Colorado libraries. 21(1995) no.3, S.36-38.
Abstract: Provides a glossary of Internet search terms. Outlines a number of network retrieval tools and directories: Netscape's Internet search page, W3 search engines, Lycos, WebCrawler, InfoSeek, Yahoo, and CERN's Net Directory. Gices an example of how the Internet can be used to answer a reference query and the types of materials that can be retrieved
Themenfeld: Suchmaschinen ; Informationsdienstleistungen
Objekt: Lycos ; WebCrawler ; InfoSeek ; Yahoo
1145Stanley, T.: Searching the World Wide Web with Lycos and InfoSeek.
In: New review of information networking. 1995, no.1, S.191-202.
Abstract: Evaluates the use of Lycos and InfoSeek search tools for information discovery of the WWW. Compares the services offered focusing on: search interfaces and languages, collection size and content, quality and indexing issues and the increasing move towards commercialisation of tools on the WWW which are used for organising and cataloguing resources
Objekt: Lycos ; InfoSeek
1148Notess, G.R.: Searching the World-Wide Web : Lycos, WebCrawler and more.
In: Online. 19(1995) no.4, S.48-53.
Abstract: Reviews the keyword indexes available for searching the WWW. Discusses: Lycos, WebCrawler, WWW Worm, Harvest Broker, and CUI. Yahoo is available for keyword searching of subject listings. The CUSI (Configurable Unified Search Engine) is a front end that provides 1 form for searching a number of indexes. A commercial service, InfoSeek, is being developed to search indexes
Objekt: Lycos ; WebCrawler ; WWW Worm ; Harvest Broker ; CUI ; CUSI ; InfoSeek ; Yahoo
1149McMurdo, G.: How the Internet was indexed.
In: Journal of information science. 21(1995) no.6, S.479-489.
Abstract: The scope and characteristics of what may be considered the first three generations of automated Internet indexing systems are identified and described as to their methods of compiling their datasets, their search interfaces and the associated etymological metaphors and mythologies. These three are suggested to be: firstly, the Archie system for single keyword and regular expression searches of the file lists of anonymous ftp sites: secondly, the Veronica system for Boolean keyword in title searches of the world's gopher servers; thirdly, a range of software techniques jnown as robots and search engines, which compile searchable databases of information accessible via the WWW, such as the currently popular Lycos project at Carnegie Mellon University. The present dominance of WWW client software as the preferred interface to Internet information has led to provision of methods of also using the first two systems by this single interface, and these are also noted
Themenfeld: Internet ; Suchmaschinen
Objekt: Archie ; Veronica ; Lycos
1150Courtois, M.P. ; Baer, W.M. ; Stark, M.: Cool tools for searching the Web : a performance evaluation.
In: Online. 19(1995) no.6, S.14-33.
Abstract: Darstellung zu den Hilfsmitteln für die inhaltliche Suche nach Angeboten im Internet
Objekt: CUI W3 ; Harvest ; Lycos ; OpenText ; WebCrawler ; WWW Worm ; Yahoo
1151Bryan, 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.
1152Hughes, 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
1153Milonas, E.: ¬The use of facets in Web search engines.
In: Paradigms and conceptual systems in knowledge organization: Proceedings of the Eleventh International ISKO conference, Rome, 23-26 February 2010, ed. Claudio Gnoli, Indeks, Frankfurt M. Würzburg : Ergon Verlag, S.349-355.
(Advances in knowledge organization; vol.12)
Abstract: The World Wide Web consists of a plethora of information that a Web searcher can retrieve via Web search engines such as Google. These Web search engines display an insurmountable amount of information in a seemingly unorganized linear format. Recently, some Web search engines have incorporated facets or terms alongside the linear display allowing the searcher the ability to narrow search results. The goal of this study is to examine the use of facets in these Web search engines.
Themenfeld: Suchmaschinen ; Universale Facettenklassifikationen
1154Li, L. ; Shang, Y. ; Zhang, W.: Improvement of HITS-based algorithms on Web documents.
In: WWW '02: Proceedings of the 11th International Conference on World Wide Web, May 7-11, 2002, Honolulu, Hawaii, USA. New York : ACM, S.527-535.
Abstract: In this paper, we present two ways to improve the precision of HITS-based algorithms onWeb documents. First, by analyzing the limitations of current HITS-based algorithms, we propose a new weighted HITS-based method that assigns appropriate weights to in-links of root documents. Then, we combine content analysis with HITS-based algorithms and study the effects of four representative relevance scoring methods, VSM, Okapi, TLS, and CDR, using a set of broad topic queries. Our experimental results show that our weighted HITS-based method performs significantly better than Bharat's improved HITS algorithm. When we combine our weighted HITS-based method or Bharat's HITS algorithm with any of the four relevance scoring methods, the combined methods are only marginally better than our weighted HITS-based method. Between the four relevance scoring methods, there is no significant quality difference when they are combined with a HITS-based algorithm.
Inhalt: Vgl.: http%3A%2F%2Fdelab.csd.auth.gr%2F~dimitris%2Fcourses%2Fir_spring06%2Fpage_rank_computing%2Fp527-li.pdf. Vgl. auch: http://www2002.org/CDROM/refereed/643/.