Search (2 results, page 1 of 1)

  • × theme_ss:"Retrievalalgorithmen"
  • × year_i:[1960 TO 1970}
  1. Goffman, W.: ¬A searching procedure for information retrieval (1964) 0.00 
    0.004121639 = product of:
  0.016486555 = sum of:
    0.016486555 = weight(_text_:information in 5281) [ClassicSimilarity], result of:
      0.016486555 = score(doc=5281,freq=6.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.2687516 = fieldWeight in 5281, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=5281)
  0.25 = coord(1/4)
    Abstract
    A search procedure for an information retrieval system is developed whereby the answer to a question is obtained by maximizing an evaluation function of the system's output in terms of the probility of relevance. Necessary and sufficient conditions are given for a set to be an answer to a query. A partition of the file is made in such way that all documents belonging to the answer are members of the same class. Hence the answer can be generated by one relevant document. In this manner a search of the total file is avoided
    Source
    Information storage and retrieval. 2(1964), S.73-78
  2. Maron, M.E.; Kuhns, I.L.: On relevance, probabilistic indexing and information retrieval (1960) 0.00 
    0.0033256328 = product of:
  0.013302531 = sum of:
    0.013302531 = weight(_text_:information in 1928) [ClassicSimilarity], result of:
      0.013302531 = score(doc=1928,freq=10.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.21684799 = fieldWeight in 1928, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1928)
  0.25 = coord(1/4)
    Abstract
    Reports on a novel technique for literature indexing and searching in a mechanized library system. The notion of relevance is taken as the key concept in the theory of information retrieval and a comparative concept of relevance is explicated in terms of the theory of probability. The resulting technique called 'Probabilistic indexing' allows a computing machine, given a request for information, to make a statistical inference and derive a number (called the 'relevance number') for each document, which is a measure of the probability that the document will satisfy the given request. The result of a search is an ordered list of those documents which satisfy the request ranked according to their probable relevance. The paper goes on to show that whereas in a conventional library system the cross-referencing ('see' and 'see also') is based soley on the 'semantic closeness' between index terms, statistical measures of closeness between index terms can be defined and computed. Thus, given an arbitrary request consisting of one (or many) index term(s), a machine can eleborate on it to increase the probability of selecting relevant documents that would not otherwise have been selected. Finally, the paper suggest an interpretation of the whole library problem as one where the request is considered as a clue on the basis of which the library system makes a concatenated statistical inference in order to provide as an output an ordered list of those documents which most probably satisfy the information needs of the user
    Footnote
    Wiederabgedruckt in: Readings in information retrieval. Ed.: K. Sparck Jones u. P. Willett. San Francisco: Morgan Kaufmann 1997. S.39-46.

Authors