Search (4 results, page 1 of 1)

  • × author_ss:"Mili, H."
  • × author_ss:"Rada, R."
  1. Rada, R.; Mili, H.: Document reuse : organizing, finding, and reorganizing content (1992) 0.00
    0.0035799001 = product of:
      0.0071598003 = sum of:
        0.0071598003 = product of:
          0.014319601 = sum of:
            0.014319601 = weight(_text_:a in 7082) [ClassicSimilarity], result of:
              0.014319601 = score(doc=7082,freq=14.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.26964417 = fieldWeight in 7082, product of:
                  3.7416575 = tf(freq=14.0), with freq of:
                    14.0 = termFreq=14.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0625 = fieldNorm(doc=7082)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Existing structures should be exploited as best as possible in the course of document reuse. Reuse may take multiple forms: rearranging a single document so as to provide different views of the same information, copying a portion of a single document to as to provide a portion of a new document, and combining portions of existing documents to constitute a new document. Algortihms are presented to do such reuse, examples are provided. For significant reuse the information in existing documents need to be abstracted so as to highlight the conceptual pattern
    Type
    a
  2. Rada, R.; Mili, H.; Bicknell, E.: Development and application of a metric on semantic nets (1989) 0.00
    0.00334869 = product of:
      0.00669738 = sum of:
        0.00669738 = product of:
          0.01339476 = sum of:
            0.01339476 = weight(_text_:a in 3917) [ClassicSimilarity], result of:
              0.01339476 = score(doc=3917,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.25222903 = fieldWeight in 3917, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.109375 = fieldNorm(doc=3917)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Type
    a
  3. Mili, H.; Rada, R.: Merging thesauri : principles and evaluation (1988) 0.00
    0.00270615 = product of:
      0.0054123 = sum of:
        0.0054123 = product of:
          0.0108246 = sum of:
            0.0108246 = weight(_text_:a in 3916) [ClassicSimilarity], result of:
              0.0108246 = score(doc=3916,freq=2.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.20383182 = fieldWeight in 3916, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.125 = fieldNorm(doc=3916)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Type
    a
  4. Rada, R.; Mili, H.; Letourneau, G.; Johnston, D.: Creating and evaluating entry terms (1988) 0.00
    0.001913537 = product of:
      0.003827074 = sum of:
        0.003827074 = product of:
          0.007654148 = sum of:
            0.007654148 = weight(_text_:a in 704) [ClassicSimilarity], result of:
              0.007654148 = score(doc=704,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.14413087 = fieldWeight in 704, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0625 = fieldNorm(doc=704)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    An indexing language is made more accessible to searchers and indexers by the presence of entry terms or near-synonyms. This paper first presents an evaluation of existing entry terms and then presents and tests a strategy for creating entry terms. The key tools in the evaluation of the entry terms are documents already indexed into the Medical Subject Headings (MeSH) and an automatic indexer ...
    Type
    a