Search (4 results, page 1 of 1)

0.043236785 = product of:
  0.12971035 = sum of:
    0.07864773 = weight(_text_:computer in 666) [ClassicSimilarity], result of:
      0.07864773 = score(doc=666,freq=2.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.48452407 = fieldWeight in 666, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.09375 = fieldNorm(doc=666)
    0.05106262 = product of:
      0.10212524 = sum of:
        0.10212524 = weight(_text_:22 in 666) [ClassicSimilarity], result of:
          0.10212524 = score(doc=666,freq=4.0), product of:
            0.1555381 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.044416238 = queryNorm
            0.6565931 = fieldWeight in 666, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=666)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Date

22. 2.2003 17:25:39
22. 2.2003 18:15:14

Series

Lecture notes in computer science; 2539

0.02692407 = product of:
  0.080772206 = sum of:
    0.062718846 = weight(_text_:web in 2239) [ClassicSimilarity], result of:
      0.062718846 = score(doc=2239,freq=8.0), product of:
        0.14495286 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.044416238 = queryNorm
        0.43268442 = fieldWeight in 2239, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2239)
    0.01805336 = product of:
      0.03610672 = sum of:
        0.03610672 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
          0.03610672 = score(doc=2239,freq=2.0), product of:
            0.1555381 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.044416238 = queryNorm
            0.23214069 = fieldWeight in 2239, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=2239)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR taskdiscovery of ranking functions for Web search-and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is weIl known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs an GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations an the design of fitness functions for genetic-based information retrieval experiments.

Date

31. 5.2004 19:22:06

0.01932706 = product of:
  0.05798118 = sum of:
    0.020906283 = weight(_text_:web in 4299) [ClassicSimilarity], result of:
      0.020906283 = score(doc=4299,freq=2.0), product of:
        0.14495286 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.044416238 = queryNorm
        0.14422815 = fieldWeight in 4299, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=4299)
    0.037074894 = weight(_text_:computer in 4299) [ClassicSimilarity], result of:
      0.037074894 = score(doc=4299,freq=4.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.22840683 = fieldWeight in 4299, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.03125 = fieldNorm(doc=4299)
  0.33333334 = coord(2/6)

Abstract

The emergence of digital libraries (DLs), at the interface of library and information science with computer and communication technologies, helped to expand significantly the literature in all of these areas during the late 1990s. The pace of development is reflected by the number of special issues of major journals in information science and computer science, and the increasing number of workshops and conferences an digital libraries. For example, starting in 1995, the Communications of the ACM has devoted three special issues to the topic (Fox, Akscyn, Furuta, & Leggett, 1995; Fox & Marchionini, 1998, 2001). The Journal of the American Society for Information Science devoted two issues to digital libraries (H. Chen, 2000; Fox & Lunin, 1993); Information Processing & Management and the Journal of Visual Communication and Image Representation each had one special issue (Chen & Fox, 1996; Marchionini & Fox, 1999). The domain of digital libraries, though still evolving, has matured over the last decade, as demonstrated by coverage through D-Lib (http://www.dlib.org), the International Journal an Digital Libraries (http://link.springer.de/link/service/journals/00799), and two overview works (W Y Arms, 2000; Lesk, 1997; both of which have also served as textbooks). Sun Microsystems published a small book to guide those planning a digital library (Noerr, 2000), and IBM has been developing commercial products for digital libraries since 1994 (IBM, 2000). A number of Web sites have extensive sets of pointers to information an DLs (D-Lib Forum, 2001; Fox, 1998a; Habing, 1998; Hein, 2000; Schwartz, 2001a, 2001b). Further, the field has attracted the attention of diverse academics, research groups, and practitionersmany of whom have attended tutorials, workshops, or conferences, e.g., the Joint Conference an Digital Libraries, which is a sequel to a separate series run by ACM and IEEE-CS. Therefore, it is timely that ARIST publishes this first review focusing specifically an digital libraries. There has been no ARIST chapter to date directly dealing with the area of DLs, though some related domains have been covered-particularly: information retrieval, user interfaces (Marchionini & Komlodi, 1998), social informatics of DLs (Bishop & Star, 1996), and scholarly communication (see Borgman and Furner's chapter in this volume). This chapter provides an overview of the diverse aspects and dimensions of DL research, practice, and literature, identifying trends and delineating research directions.

0.009633917 = product of:
  0.057803504 = sum of:
    0.057803504 = weight(_text_:wide in 4779) [ClassicSimilarity], result of:
      0.057803504 = score(doc=4779,freq=2.0), product of:
        0.19679762 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.044416238 = queryNorm
        0.29372054 = fieldWeight in 4779, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=4779)
  0.16666667 = coord(1/6)

Abstract

NDLTD, the Networked Digital Library of Theses and Dissertations, supports and encourages the production and archiving of electronic theses and dissertations (ETDs). While many current NDLTD member institutions and consortia have individual collections accessible online, there has until recently been no single mechanism to aggregate all ETDs to provide NDLTD-wide services (e.g. searching). With the emergence of the Open Archives Initiative (OAI), that has changed. The OAI's Protocol for Metadata Harvesting is a robust interoperability solution that defines a standard method of exchanging metadata. While working with the OAI to develop and test the metadata harvesting standard, we have set up and actively maintain a central NDLTD metadata collection and multiple user portals. We discuss in this article our experiences in building this distributed digital library based upon the work of the OAI.