Search (6 results, page 1 of 1)

  • × author_ss:"French, J.C."
  1. French, J.C.; Powell, A.L.; Gey, F.; Perelman, N.: Exploiting manual indexing to improve collection selection and retrieval effectiveness (2002) 0.00
    0.0038297947 = product of:
      0.015319179 = sum of:
        0.015319179 = weight(_text_:information in 3896) [ClassicSimilarity], result of:
          0.015319179 = score(doc=3896,freq=2.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.27153665 = fieldWeight in 3896, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.109375 = fieldNorm(doc=3896)
      0.25 = coord(1/4)
    
    Source
    Information retrieval. 5(2002), S.323-351
  2. French, J.C.; Knight, J.C.; Powell, A.L.: Applying hypertext structures to software documentation (1997) 0.00
    0.003282681 = product of:
      0.013130724 = sum of:
        0.013130724 = weight(_text_:information in 3257) [ClassicSimilarity], result of:
          0.013130724 = score(doc=3257,freq=2.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.23274569 = fieldWeight in 3257, 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=3257)
      0.25 = coord(1/4)
    
    Source
    Information processing and management. 33(1997) no.2, S.xxx-xxx
  3. French, J.C.; Brown, D.E.; Kim, N.-H.: ¬A classification approach to Boolean query reformulation (1997) 0.00
    0.0028428852 = product of:
      0.011371541 = sum of:
        0.011371541 = weight(_text_:information in 197) [ClassicSimilarity], result of:
          0.011371541 = score(doc=197,freq=6.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.20156369 = fieldWeight in 197, 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=197)
      0.25 = coord(1/4)
    
    Abstract
    One of the difficulties in using current Boolean-based information retrieval systems is that it is hard for a user, especially a novice, to formulate an effective Boolean query. Query reformulation can be even more difficult and complex than formulation since users often have difficulty incorporating the new information gained from the previous search into the next query. In this article, query reformulation is viewed as a classification problem, that is, classifying documents as either relevant or non relevant. A new reformulation algorithm is proposed which builds a tree-structure classifier, called a query tree, at each reformulation from a set of feedback documents retrieved from the previous search. The query tree can easily be transformed into a Boolean query. The query tree is compared to two query reformulation algorithms on benchmark test sets (CACM, CISI, and Medlars). In most experiments, the query tree showed significant improvements in precision over the 2 algorithms compared in this study. We attribute this improved performance to the ability of the query tree algorithm to select good search terms and to represent the relationships among search terms into a tree structure
    Source
    Journal of the American Society for Information Science. 48(1997) no.8, S.694-706
  4. French, J.C.; Powell, A.L.; Schulman, E.: Using clustering strategies for creating authority files (2000) 0.00
    0.0028428852 = product of:
      0.011371541 = sum of:
        0.011371541 = weight(_text_:information in 4811) [ClassicSimilarity], result of:
          0.011371541 = score(doc=4811,freq=6.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.20156369 = fieldWeight in 4811, 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=4811)
      0.25 = coord(1/4)
    
    Abstract
    As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective retrieval of information. Authority work, the need to discover and reconcile variant forms of strings in bibliographical entries, will become more critical in the future. Spelling variants, misspellings, and transliteration differences will all increase the difficulty of retrieving information. We investigate a number of approximate string matching techniques that have traditionally been used to help with this problem. We then introduce the notion of approximate word matching and show how it can be used to improve detection and categorization of variant forms. We demonstrate the utility of these approaches using data from the Astrophysics Data System and show how we can reduce the human effort involved in the creation of authority files
    Source
    Journal of the American Society for Information Science. 51(2000) no.8, S.774-786
  5. Sharretts, C.W.; Shieh, J.; French, J.C.: Electronic theses and dissertations at the University of Virginia (1999) 0.00
    0.0023690711 = product of:
      0.0094762845 = sum of:
        0.0094762845 = weight(_text_:information in 6702) [ClassicSimilarity], result of:
          0.0094762845 = score(doc=6702,freq=6.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.16796975 = fieldWeight in 6702, 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=6702)
      0.25 = coord(1/4)
    
    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
  6. French, J.C.; Chapin, A.C.; Martin, W.N.: Multiple viewpoints as an approach to digital library interfaces (2004) 0.00
    0.0016413406 = product of:
      0.006565362 = sum of:
        0.006565362 = weight(_text_:information in 2881) [ClassicSimilarity], result of:
          0.006565362 = score(doc=2881,freq=2.0), product of:
            0.056416616 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.03213747 = queryNorm
            0.116372846 = fieldWeight in 2881, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046875 = fieldNorm(doc=2881)
      0.25 = coord(1/4)
    
    Source
    Journal of the American Society for Information Science and Technology. 55(2004) no.10, S.911-922