Search (5 results, page 1 of 1)

  • × author_ss:"Swanson, D.R."
  • × type_ss:"a"
  1. Swanson, D.R.: Online search for logically-related noninteractive medical literatures : a systematic trial-and-error strategy (1989) 0.08
    0.083683304 = product of:
      0.2510499 = sum of:
        0.2510499 = weight(_text_:systematic in 202) [ClassicSimilarity], result of:
          0.2510499 = score(doc=202,freq=2.0), product of:
            0.28397155 = queryWeight, product of:
              5.715473 = idf(docFreq=395, maxDocs=44218)
              0.049684696 = queryNorm
            0.88406706 = fieldWeight in 202, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.715473 = idf(docFreq=395, maxDocs=44218)
              0.109375 = fieldNorm(doc=202)
      0.33333334 = coord(1/3)
    
  2. Swanson, D.R.; Smalheiser, N.R.; Torvik, V.I.: Ranking indirect connections in literature-based discovery : the role of Medical Subject Headings (2006) 0.03
    0.029886894 = product of:
      0.08966068 = sum of:
        0.08966068 = weight(_text_:systematic in 6003) [ClassicSimilarity], result of:
          0.08966068 = score(doc=6003,freq=2.0), product of:
            0.28397155 = queryWeight, product of:
              5.715473 = idf(docFreq=395, maxDocs=44218)
              0.049684696 = queryNorm
            0.31573826 = fieldWeight in 6003, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.715473 = idf(docFreq=395, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6003)
      0.33333334 = coord(1/3)
    
    Abstract
    Arrowsmith, a computer-assisted process for literature-based discovery, takes as input two disjoint sets of records (A, C) from the Medline database. lt produces a list of title words and phrases, B, that are common to A and C, and displays the title context in which each B-term occurs within A and within C. Subject experts then can try to find A-B and B-C title-pairs that together may suggest novel and plausible indirect A-C relationships (via B-terms) that are of particular interest in the absence of any known direct A-C relationship. The list of B-terms typically is so large that it is difficult to find the relatively few that contribute to scientifically interesting connections. The purpose of the present article is to propose and test several techniques for improving the quality of the B-Iist. These techniques exploit the Medical Subject Headings (MeSH) that are assigned to each input record. A MesH-based concept of literature cohesiveness is defined and plays a key rote. The proposed techniques are tested an a published example of indirect connections between migraine and magnesium deficiency. The tests demonstrate how the earlier results can be replicated with a more efficient and more systematic computer-aided process.
  3. Swanson, D.R.: Some unexplained aspects of the Cranfield tests of indexing performance factors (1971) 0.02
    0.02144916 = product of:
      0.064347476 = sum of:
        0.064347476 = product of:
          0.12869495 = sum of:
            0.12869495 = weight(_text_:indexing in 2337) [ClassicSimilarity], result of:
              0.12869495 = score(doc=2337,freq=2.0), product of:
                0.19018644 = queryWeight, product of:
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.049684696 = queryNorm
                0.6766778 = fieldWeight in 2337, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.125 = fieldNorm(doc=2337)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  4. Bookstein, A.; Swanson, D.R.: Probabilistic models for automatic indexing (1974) 0.02
    0.02144916 = product of:
      0.064347476 = sum of:
        0.064347476 = product of:
          0.12869495 = sum of:
            0.12869495 = weight(_text_:indexing in 5466) [ClassicSimilarity], result of:
              0.12869495 = score(doc=5466,freq=2.0), product of:
                0.19018644 = queryWeight, product of:
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.049684696 = queryNorm
                0.6766778 = fieldWeight in 5466, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.125 = fieldNorm(doc=5466)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  5. Bookstein, A.; Swanson, D.R.: ¬A decision theoretic foundation for indexing (1975) 0.02
    0.016253578 = product of:
      0.04876073 = sum of:
        0.04876073 = product of:
          0.09752146 = sum of:
            0.09752146 = weight(_text_:indexing in 76) [ClassicSimilarity], result of:
              0.09752146 = score(doc=76,freq=6.0), product of:
                0.19018644 = queryWeight, product of:
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.049684696 = queryNorm
                0.5127677 = fieldWeight in 76, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.8278677 = idf(docFreq=2614, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=76)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    The indexing of a document is among the most crucial steps in preparing that document for retrieval. The adequacy of the indexing determines the ability of the system to respond to patron requests. This paper discusses this process, and document retrieval in general, on the basis of formal decision theory. The basic theoretical approach taken is illustrated by means of a model of word occurrences in documents in the context of a model information system; both models are fully defined in this paper. Through the main purpose of this papers is to provide insights into a very complex process, formulae are developed that may prove to be of value for an automated operating system. The paper concludes with an interpretation of recall and precision curves as seen from the point of view of decision theory