Search (12 results, page 1 of 1)

0.01387312 = product of:
  0.064741224 = sum of:
    0.023069443 = weight(_text_:wide in 93) [ClassicSimilarity], result of:
      0.023069443 = score(doc=93,freq=2.0), product of:
        0.13464367 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.030388402 = queryNorm
        0.171337 = fieldWeight in 93, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
    0.035399403 = weight(_text_:web in 93) [ClassicSimilarity], result of:
      0.035399403 = score(doc=93,freq=16.0), product of:
        0.09917287 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.030388402 = queryNorm
        0.35694647 = fieldWeight in 93, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
    0.0062723793 = weight(_text_:information in 93) [ClassicSimilarity], result of:
      0.0062723793 = score(doc=93,freq=6.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.11757882 = fieldWeight in 93, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
  0.21428572 = coord(3/14)

Abstract

Imagine a library containing 25 billion documents but with no centralized organization and no librarians. In addition, anyone may add a document at any time without telling anyone. You may feel sure that one of the documents contained in the collection has a piece of information that is vitally important to you, and, being impatient like most of us, you'd like to find it in a matter of seconds. How would you go about doing it? Posed in this way, the problem seems impossible. Yet this description is not too different from the World Wide Web, a huge, highly-disorganized collection of documents in many different formats. Of course, we're all familiar with search engines (perhaps you found this article using one) so we know that there is a solution. This article will describe Google's PageRank algorithm and how it returns pages from the web's collection of 25 billion documents that match search criteria so well that "google" has become a widely used verb. Most search engines, including Google, continually run an army of computer programs that retrieve pages from the web, index the words in each document, and store this information in an efficient format. Each time a user asks for a web search using a search phrase, such as "search engine," the search engine determines all the pages on the web that contains the words in the search phrase. (Perhaps additional information such as the distance between the words "search" and "engine" will be noted as well.) Here is the problem: Google now claims to index 25 billion pages. Roughly 95% of the text in web pages is composed from a mere 10,000 words. This means that, for most searches, there will be a huge number of pages containing the words in the search phrase. What is needed is a means of ranking the importance of the pages that fit the search criteria so that the pages can be sorted with the most important pages at the top of the list. One way to determine the importance of pages is to use a human-generated ranking. For instance, you may have seen pages that consist mainly of a large number of links to other resources in a particular area of interest. Assuming the person maintaining this page is reliable, the pages referenced are likely to be useful. Of course, the list may quickly fall out of date, and the person maintaining the list may miss some important pages, either unintentionally or as a result of an unstated bias. Google's PageRank algorithm assesses the importance of web pages without human evaluation of the content. In fact, Google feels that the value of its service is largely in its ability to provide unbiased results to search queries; Google claims, "the heart of our software is PageRank." As we'll see, the trick is to ask the web itself to rank the importance of pages.

0.008731281 = product of:
  0.061118964 = sum of:
    0.03961407 = weight(_text_:bibliothek in 999) [ClassicSimilarity], result of:
      0.03961407 = score(doc=999,freq=2.0), product of:
        0.1247605 = queryWeight, product of:
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.030388402 = queryNorm
        0.31752092 = fieldWeight in 999, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.0546875 = fieldNorm(doc=999)
    0.021504894 = weight(_text_:retrieval in 999) [ClassicSimilarity], result of:
      0.021504894 = score(doc=999,freq=2.0), product of:
        0.091922335 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030388402 = queryNorm
        0.23394634 = fieldWeight in 999, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=999)
  0.14285715 = coord(2/14)

Abstract

Dieser Aufsatz beschäftigt sich mit Management-Aspekten der Sacherschließung in der British Library, Bibliographic Services Division, wo computergestützte, nicht völlig "automatische" Verfahren angewendet werden. In einer ausführlichen Darstellung des Arbeitsablaufes im Subject Systems Office wird der Weg eines Dokumentes durch die verschiedenen Sektionen verfolgt, und die betriebswirtschaftlichen Folgen der besonderen Rolle von PRECIS in diesem Arbeitsablauf werden erörtert. Das Mehrdateiensystem der British-Library-Datenbank wird beschrieben; es wird gezeigt, wie diese Struktur den effektiven Wiedergebrauch von Daten ermöglicht. Weiterhin wird die Verbesserung des on-line Retrieval durch den Einbau von präkoordinierten Themenangaben in den Suchablauf behandelt; abschließend wird die Rolle des Computers in der Sacherschließung einer IuD-Einrichtung wie der British Library diskutiert

Source

Bibliothek: Forschung und Praxis. 8(1984), S.45-57

0.0070402324 = product of:
  0.049281623 = sum of:
    0.012416091 = weight(_text_:information in 805) [ClassicSimilarity], result of:
      0.012416091 = score(doc=805,freq=2.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.23274569 = fieldWeight in 805, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=805)
    0.036865532 = weight(_text_:retrieval in 805) [ClassicSimilarity], result of:
      0.036865532 = score(doc=805,freq=2.0), product of:
        0.091922335 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030388402 = queryNorm
        0.40105087 = fieldWeight in 805, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=805)
  0.14285715 = coord(2/14)

Footnote

Zusammenfassende kompakte Darstellung des Systems PRECIS, seiner Geschichte, Eigenschaften und Möglichkeiten bis hin zum Online-Retrieval. - Als Einführung zu empfehlen

Source

Encyclopedia of library and information science. Vol.42, [=Suppl.7]

0.00586686 = product of:
  0.041068017 = sum of:
    0.010346742 = weight(_text_:information in 2564) [ClassicSimilarity], result of:
      0.010346742 = score(doc=2564,freq=2.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.19395474 = fieldWeight in 2564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=2564)
    0.030721277 = weight(_text_:retrieval in 2564) [ClassicSimilarity], result of:
      0.030721277 = score(doc=2564,freq=2.0), product of:
        0.091922335 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030388402 = queryNorm
        0.33420905 = fieldWeight in 2564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=2564)
  0.14285715 = coord(2/14)

Source

Ordering systems for global information networks. Proc. of the 3rd Int. Study Conf. on Classification Research, Bombay 1975. Ed. by A. Neelameghan

0.0038342776 = product of:
  0.026839942 = sum of:
    0.017879399 = weight(_text_:web in 6540) [ClassicSimilarity], result of:
      0.017879399 = score(doc=6540,freq=2.0), product of:
        0.09917287 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.030388402 = queryNorm
        0.18028519 = fieldWeight in 6540, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6540)
    0.008960542 = weight(_text_:information in 6540) [ClassicSimilarity], result of:
      0.008960542 = score(doc=6540,freq=6.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.16796975 = fieldWeight in 6540, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6540)
  0.14285715 = coord(2/14)

Abstract

It is a fact that those involved with the humanities use visual resources for references in their work. Yet access to visual resources is no where near as certain or assured as print material. This is equally true for resources that may be discovered at a museum, an archive, in a slide collection, or on the Web. Inception of an International Standard Object Number, similar to International Standard Bibliographic Numbers for books and International Standard Serials Numbers for periodicals will advance accurate and timely access to visual resources. Unique numbers or codes which refer not only to the object but to any digital or non digital surrogate is desired by those whose interests lie in visual resources, digital objects or metadata. This paper discusses extant paradigms (ISBN, ISSN, ISMN, and the emerging ISAN) and models a procedure for assigning ISONs to objects and their surrogates. Resources requisite to the construction of the ISON are described, and a clear outline of the necessarily cooperative work ahead are discussed if an ISON can become a standard which will help in the discovery of visual resources in an open, shared environment

Imprint

Medford, NJ : Information Today

Series

Proceedings of the American Society for Information Science; vol.36

Source

Knowledge: creation, organization and use. Proceedings of the 62nd Annual Meeting of the American Society for Information Science, 31.10.-4.11.1999. Ed.: L. Woods

0.0026332524 = product of:
  0.036865532 = sum of:
    0.036865532 = weight(_text_:retrieval in 1574) [ClassicSimilarity], result of:
      0.036865532 = score(doc=1574,freq=2.0), product of:
        0.091922335 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030388402 = queryNorm
        0.40105087 = fieldWeight in 1574, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=1574)
  0.071428575 = coord(1/14)

0.0014632504 = product of:
  0.020485504 = sum of:
    0.020485504 = weight(_text_:information in 3176) [ClassicSimilarity], result of:
      0.020485504 = score(doc=3176,freq=4.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.3840108 = fieldWeight in 3176, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=3176)
  0.071428575 = coord(1/14)

Source

The interchange of bibliographic information in machine readable form. Ed.: R.E. Coward u. M. Yelland

0.0011824849 = product of:
  0.016554788 = sum of:
    0.016554788 = weight(_text_:information in 1353) [ClassicSimilarity], result of:
      0.016554788 = score(doc=1353,freq=2.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.3103276 = fieldWeight in 1353, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=1353)
  0.071428575 = coord(1/14)

0.0011824849 = product of:
  0.016554788 = sum of:
    0.016554788 = weight(_text_:information in 4972) [ClassicSimilarity], result of:
      0.016554788 = score(doc=4972,freq=2.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.3103276 = fieldWeight in 4972, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=4972)
  0.071428575 = coord(1/14)

Source

Information scientist. 3(1969) no.3, S.95-115

0.0010971886 = product of:
  0.0153606385 = sum of:
    0.0153606385 = weight(_text_:retrieval in 1519) [ClassicSimilarity], result of:
      0.0153606385 = score(doc=1519,freq=2.0), product of:
        0.091922335 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030388402 = queryNorm
        0.16710453 = fieldWeight in 1519, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1519)
  0.071428575 = coord(1/14)

Abstract

In traditional classification schemes, the universe of knowledge is brokeii down into self- contained disciplines which are further analysed to the point at which a particular concept is located. This leads to problems of: (a) currency: keeping the scheme in line with new discoveries. (b) hospitality: allowing room for insertion of new subjects (c) cross-classification: a concept may be considered in such a way that it fits as logically into one discipline as another. Machine retrieval is also hampered by the fact that any individual concept is notated differently, depending on where in the scheme it appears. The approach now considered is from an organized universe of concepts, every concept being set down only once in an appropriate vocabulary, where it acquires the notation which identifies it wherever it is used. It has been found that all the concepts present in any compound subject can be handled as though they belong to one of two basic concept types, being either Entities or Attributes. In classing, these concepts are identified, and notation is selected from appropriate schedules. Subjects are then built according to formal rules, the final class number incorporating operators which convey the fundamental relationships between concepts. From this viewpoint, the Rules and Operators of the proposed system can be seen as the grammar of an IR language, and the schedules of Entities and Attributes as its vocabulary.

8.868637E-4 = product of:
  0.012416091 = sum of:
    0.012416091 = weight(_text_:information in 1286) [ClassicSimilarity], result of:
      0.012416091 = score(doc=1286,freq=2.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.23274569 = fieldWeight in 1286, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=1286)
  0.071428575 = coord(1/14)

Source

Classification and information control. Papers representing the work of the Classification Research Group during 1960-1968

7.680465E-4 = product of:
  0.01075265 = sum of:
    0.01075265 = weight(_text_:information in 985) [ClassicSimilarity], result of:
      0.01075265 = score(doc=985,freq=6.0), product of:
        0.05334617 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030388402 = queryNorm
        0.20156369 = fieldWeight in 985, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=985)
  0.071428575 = coord(1/14)

Abstract

Derek Austin's PRECIS, or PREserved Context Index System, was one of the most sophisticated indexing systems ever developed for text. Austin noted that there are many ways that the meaning of index entries may be misread and misunderstood, if the original context from which the concept came was not present. Drawing on a good understanding of linguistics, Austin and his colleagues developed a highly rigorous, yet not impossibly difficult, set of principles to use in indexing with the help of PRECIS. The system was particularly valuable for generating multiple word orderings of entries that still retained their proper contextual meaning. Much of the need for this feature was obviated by the development of powerful full text searching in information systems, however, and PRECIS receded from view in information science. The final sections of the article that address the details of coding and indexing management are deleted from the text below.

Source

Encyclopedia of library and information sciences. 3rd ed. Ed.: M.J. Bates