Search (29 results, page 2 of 2)

  • × author_ss:"Rada, R."
  1. Rada, R.: Connecting and evaluating thesauri : issues and cases (1987) 0.00
    0.0027618767 = product of:
      0.00828563 = sum of:
        0.00828563 = product of:
          0.01657126 = sum of:
            0.01657126 = weight(_text_:of in 823) [ClassicSimilarity], result of:
              0.01657126 = score(doc=823,freq=8.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.24188137 = fieldWeight in 823, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=823)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Connecting and evaluating thesauri is an important task for the systematic development of better information retrieval systems. Connecting thesauri includes not only determining when terms in different thesauri are the same but also determining what kinds of relationships can be transferred from one thesaurus to another. This paper first presents issues in connecting and evaluating thesauri. Various experiments in connecting a particular thesaurus, the Medical Subject Headings, with other medical thesauri are described. In these experiments, similar terms in two thesauri are recognized and then differences in two thesauri are exploited to create more powerful thesauri. Part of the evaluation requires the thesaurus to support automatic indexing and retrieving of documents
  2. Rada, R.; Mili, H.; Bicknell, E.: Development and application of a metric on semantic nets (1989) 0.00
    0.0027618767 = product of:
      0.00828563 = sum of:
        0.00828563 = product of:
          0.01657126 = sum of:
            0.01657126 = weight(_text_:of in 3917) [ClassicSimilarity], result of:
              0.01657126 = score(doc=3917,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.24188137 = fieldWeight in 3917, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.109375 = fieldNorm(doc=3917)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  3. McMath, C.F.; Tamaru, R.S.; Rada, R.: ¬A graphical thesaurus-based information retrieval system (1989) 0.00
    0.0027618767 = product of:
      0.00828563 = sum of:
        0.00828563 = product of:
          0.01657126 = sum of:
            0.01657126 = weight(_text_:of in 4819) [ClassicSimilarity], result of:
              0.01657126 = score(doc=4819,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.24188137 = fieldWeight in 4819, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.109375 = fieldNorm(doc=4819)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Source
    International journal of man-machine studies. 31(1989), S.121-147
  4. Rada, R.; Murphy, C.: Searching verses browsing in hypertext (1992) 0.00
    0.0027335489 = product of:
      0.008200646 = sum of:
        0.008200646 = product of:
          0.016401293 = sum of:
            0.016401293 = weight(_text_:of in 3317) [ClassicSimilarity], result of:
              0.016401293 = score(doc=3317,freq=6.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.23940048 = fieldWeight in 3317, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3317)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Attemps to elaborate the relationships among tasks, user types, and tools for hypertext. A computer system was built for automatically converting books into hypertext and one book converts into Emaccs-Info, Guide, HyperTies, and a variant of SuperBook, called MaxiBook. Compares the performance of 3 classes of users - expers, novices and trainees - with different tasks on these different delivery vehicles, the tasks involving one search question and one browse question
  5. Chen, C.; Rada, R.: ¬A conceptual model for supporting collaborative authoring and use (1994) 0.00
    0.0023918552 = product of:
      0.0071755657 = sum of:
        0.0071755657 = product of:
          0.014351131 = sum of:
            0.014351131 = weight(_text_:of in 7554) [ClassicSimilarity], result of:
              0.014351131 = score(doc=7554,freq=6.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.20947541 = fieldWeight in 7554, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=7554)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    This paper discusses some problems encountered in hypermedia-based collaboration and reuse, and presents a conceptual framework to resolve these problems. Three suggestions are made based on the discussion: (1) extra organizational structures are necessary in shared hypermedia to support collaborative interactions; (2) an abstract schema is a key to capture the dynamic nature of the shared hypermedia; (3) an integration of the schema evolution approach and the workflow approach is recommended for an open system hypermedia teamwork support. The whole authoring environment is divided into several component spaces with particular respect to the Dexter Hypertext Reference Model. Not only can this separation reduce the overall complexitiy of working within such an environment, but it also conforms more closely with human cognitive needs in collaborative authoring and reuse activities
  6. Rada, R.; Liu, Z.; Zheng, M.: Connecting educational information spaces (1997) 0.00
    0.0023918552 = product of:
      0.0071755657 = sum of:
        0.0071755657 = product of:
          0.014351131 = sum of:
            0.014351131 = weight(_text_:of in 313) [ClassicSimilarity], result of:
              0.014351131 = score(doc=313,freq=6.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.20947541 = fieldWeight in 313, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=313)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Online textbooks can be connected to other sources of information to improve their educational value. We describe 2 case studies. One used in a medical textbook and connected to medical journal abstracts via a thesaurus. The textbook, journal abstracts, and thesaurus were stored on a CD-ROM. The other case study shows a textbook on the WWW that is connected to various other sources of information. About half the book references are to web sites, and the textbook is part of an online course that is connected to an online catalog and other courses. Such linkages among information spaces should help students navigate the information relevant to their studies
  7. You, G.-N:; Rada, R.: ¬A systematic approach to outline manipulation (1994) 0.00
    0.0023673228 = product of:
      0.0071019684 = sum of:
        0.0071019684 = product of:
          0.014203937 = sum of:
            0.014203937 = weight(_text_:of in 2010) [ClassicSimilarity], result of:
              0.014203937 = score(doc=2010,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.20732689 = fieldWeight in 2010, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.09375 = fieldNorm(doc=2010)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Outlines (Tables of contents) reflect a conceptual model and can serve as a cognitive aid in reading and writing hypertext
  8. Rada, R.; Barlow, J.; Potharst, J.; Zanstra, P.; Bijstra, D.: Document ranking using an enriched thesaurus (1991) 0.00
    0.0020501618 = product of:
      0.006150485 = sum of:
        0.006150485 = product of:
          0.01230097 = sum of:
            0.01230097 = weight(_text_:of in 6626) [ClassicSimilarity], result of:
              0.01230097 = score(doc=6626,freq=6.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.17955035 = fieldWeight in 6626, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.046875 = fieldNorm(doc=6626)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    A thesaurus may be viewed as a graph, and document retrieval algorithms can exploit this graph when both the documents and the query are represented by thesaurus terms. These retrieval algorithms measure the distance between the query and documents by using the path lengths in the graph. Previous work witj such strategies has shown that the hierarchical relations in the thesaurus are useful but the non-hierarchical are not. This paper shows that when the query explicitly mentions a particular non-hierarchical relation, the retrieval algorithm benefits from the presence of such relations in the thesaurus. Our algorithms were applied to the Excerpta Medica bibliographic citation database whose citations are indexed with terms from the EMTREE thesaurus. We also created an enriched EMTREE by systematically adding non-hierarchical relations from a medical knowledge base. Our algorithms used at one time EMTREE and, at another time, the enriched EMTREE in the course of ranking documents from Excerpta Medica against queries. When, and only when, the query specifically mentioned a particular non-hierarchical relation type, did EMTREE enriched with that relation type lead to a ranking that better corresponded to an expert's ranking
    Source
    Journal of documentation. 47(1991) no.3, S.240-253
  9. Rada, R.: Hypertext: from text to expertext (1991) 0.00
    0.001972769 = product of:
      0.0059183068 = sum of:
        0.0059183068 = product of:
          0.0118366135 = sum of:
            0.0118366135 = weight(_text_:of in 6273) [ClassicSimilarity], result of:
              0.0118366135 = score(doc=6273,freq=2.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.17277241 = fieldWeight in 6273, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.078125 = fieldNorm(doc=6273)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Footnote
    Rez. in: Journal of documentation 48(1992) S.98-99 (P. Brown); Knowledge organization 20(1993) no.2, S.106-107 (dt.), no.3, S.172-173 (engl.) (R. Kuhlen)