Search (58 results, page 1 of 3)

0.21991533 = sum of:
  0.036688637 = product of:
    0.11006591 = sum of:
      0.11006591 = weight(_text_:objects in 2419) [ClassicSimilarity], result of:
        0.11006591 = score(doc=2419,freq=2.0), product of:
          0.31238306 = queryWeight, product of:
            5.315071 = idf(docFreq=590, maxDocs=44218)
            0.05877307 = queryNorm
          0.35234275 = fieldWeight in 2419, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.315071 = idf(docFreq=590, maxDocs=44218)
            0.046875 = fieldNorm(doc=2419)
    0.33333334 = coord(1/3)
  0.12124394 = weight(_text_:digital in 2419) [ClassicSimilarity], result of:
    0.12124394 = score(doc=2419,freq=8.0), product of:
      0.23183343 = queryWeight, product of:
        3.944552 = idf(docFreq=2326, maxDocs=44218)
        0.05877307 = queryNorm
      0.52297866 = fieldWeight in 2419, product of:
        2.828427 = tf(freq=8.0), with freq of:
          8.0 = termFreq=8.0
        3.944552 = idf(docFreq=2326, maxDocs=44218)
        0.046875 = fieldNorm(doc=2419)
  0.03809394 = weight(_text_:library in 2419) [ClassicSimilarity], result of:
    0.03809394 = score(doc=2419,freq=4.0), product of:
      0.15453665 = queryWeight, product of:
        2.6293786 = idf(docFreq=8668, maxDocs=44218)
        0.05877307 = queryNorm
      0.24650425 = fieldWeight in 2419, product of:
        2.0 = tf(freq=4.0), with freq of:
          4.0 = termFreq=4.0
        2.6293786 = idf(docFreq=8668, maxDocs=44218)
        0.046875 = fieldNorm(doc=2419)
  0.023888817 = product of:
    0.047777634 = sum of:
      0.047777634 = weight(_text_:22 in 2419) [ClassicSimilarity], result of:
        0.047777634 = score(doc=2419,freq=2.0), product of:
          0.20581327 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05877307 = queryNorm
          0.23214069 = fieldWeight in 2419, 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=2419)
    0.5 = coord(1/2)

Abstract

The digital library system Daffodil is targeted at strategic support of users during the information search process. For searching, exploring and managing digital library objects it provides user-customisable information seeking patterns over a federation of heterogeneous digital libraries. In this paper evaluation results with respect to retrieval effectiveness, efficiency and user satisfaction are presented. The analysis focuses on strategic support for the scientific work-flow. Daffodil supports the whole work-flow, from data source selection over information seeking to the representation, organisation and reuse of information. By embedding high level search functionality into the scientific work-flow, the user experiences better strategic system support due to a more systematic work process. These ideas have been implemented in Daffodil followed by a qualitative evaluation. The evaluation has been conducted with 28 participants, ranging from information seeking novices to experts. The results are promising, as they support the chosen model.

Date

16.11.2008 16:22:48

Source

Research and advanced technology for digital libraries : 8th European conference, ECDL 2004, Bath, UK, September 12-17, 2004 : proceedings. Eds.: Heery, R. u. E. Lyon

0.11554315 = product of:
  0.15405753 = sum of:
    0.030573865 = product of:
      0.091721594 = sum of:
        0.091721594 = weight(_text_:objects in 4296) [ClassicSimilarity], result of:
          0.091721594 = score(doc=4296,freq=2.0), product of:
            0.31238306 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05877307 = queryNorm
            0.29361898 = fieldWeight in 4296, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4296)
      0.33333334 = coord(1/3)
    0.1010366 = weight(_text_:digital in 4296) [ClassicSimilarity], result of:
      0.1010366 = score(doc=4296,freq=8.0), product of:
        0.23183343 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.05877307 = queryNorm
        0.4358155 = fieldWeight in 4296, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4296)
    0.022447068 = weight(_text_:library in 4296) [ClassicSimilarity], result of:
      0.022447068 = score(doc=4296,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.14525402 = fieldWeight in 4296, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4296)
  0.75 = coord(3/4)

Abstract

Daffodil is a front-end to federated, heterogeneous digital libraries targeting at strategic support of users during the information seeking process. This is done by offering a variety of functions for searching, exploring and managing digital library objects. However, the distributed search increases response time and the conceptual model of the underlying search processes is inherently weaker. This makes query formulation harder and the resulting waiting times can be frustrating. In this paper, we investigate the concept of proactive support during the user's query formulation. For improving user efficiency and satisfaction, we implemented annotations, proactive support and error markers on the query form itself. These functions decrease the probability for syntactical or semantical errors in queries. Furthermore, the user is able to make better tactical decisions and feels more confident that the system handles the query properly. Evaluations with 30 subjects showed that user satisfaction is improved, whereas no conclusive results were received for efficiency.

Source

Research and advanced technology for digital libraries : 9th European conference, ECDL 2005, Vienna, Austria, September 18-23, 2005 ; proceedings / Andreas Rauber ... (eds.)

0.07296537 = product of:
  0.14593074 = sum of:
    0.1010366 = weight(_text_:digital in 3824) [ClassicSimilarity], result of:
      0.1010366 = score(doc=3824,freq=2.0), product of:
        0.23183343 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.05877307 = queryNorm
        0.4358155 = fieldWeight in 3824, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.078125 = fieldNorm(doc=3824)
    0.044894136 = weight(_text_:library in 3824) [ClassicSimilarity], result of:
      0.044894136 = score(doc=3824,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.29050803 = fieldWeight in 3824, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.078125 = fieldNorm(doc=3824)
  0.5 = coord(2/4)

Source

Vocabulary as a central concept in digital libraries: interdisciplinary concepts, challenges, and opportunities : proceedings of the Third International Conference an Conceptions of Library and Information Science (COLIS3), Dubrovnik, Croatia, 23-26 May 1999. Ed. by T. Arpanac et al

0.06335102 = product of:
  0.12670204 = sum of:
    0.044894136 = weight(_text_:library in 7953) [ClassicSimilarity], result of:
      0.044894136 = score(doc=7953,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.29050803 = fieldWeight in 7953, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.078125 = fieldNorm(doc=7953)
    0.0818079 = product of:
      0.1636158 = sum of:
        0.1636158 = weight(_text_:project in 7953) [ClassicSimilarity], result of:
          0.1636158 = score(doc=7953,freq=4.0), product of:
            0.24808002 = queryWeight, product of:
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.05877307 = queryNorm
            0.6595283 = fieldWeight in 7953, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.078125 = fieldNorm(doc=7953)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

Describes the work carried out on the TREC-2 project following the results of the TREC-1 project. Experiments were conducted on the OKAPI experimental text information retrieval system which investigated a number of alternative probabilistic term weighting functions in place of the 'standard' Robertson Sparck Jones weighting functions used in TREC-1

Imprint

London : British Library

0.059296183 = product of:
  0.11859237 = sum of:
    0.062851794 = weight(_text_:library in 3445) [ClassicSimilarity], result of:
      0.062851794 = score(doc=3445,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.40671125 = fieldWeight in 3445, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.109375 = fieldNorm(doc=3445)
    0.055740576 = product of:
      0.11148115 = sum of:
        0.11148115 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
          0.11148115 = score(doc=3445,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.5416616 = fieldWeight in 3445, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=3445)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Date

25. 8.2005 17:42:22

Source

Library and information research news. 24(2000) no.77, S.30-34

0.051075764 = product of:
  0.10215153 = sum of:
    0.07072563 = weight(_text_:digital in 3270) [ClassicSimilarity], result of:
      0.07072563 = score(doc=3270,freq=2.0), product of:
        0.23183343 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.05877307 = queryNorm
        0.30507088 = fieldWeight in 3270, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3270)
    0.031425897 = weight(_text_:library in 3270) [ClassicSimilarity], result of:
      0.031425897 = score(doc=3270,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.20335563 = fieldWeight in 3270, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3270)
  0.5 = coord(2/4)

Abstract

When do information retrieval systems using two document clusters provide better retrieval performance than systems using no clustering? We answer this question for one set of assumptions and suggest how this may be studied with other assumptions. The "Cluster Hypothesis" asks an empirical question about the relationships between documents and user-supplied relevance judgments, while the "Cluster Performance Question" proposed here focuses an the when and why of information retrieval or digital library performance for clustered and unclustered text databases. This may be generalized to study the relative performance of m versus n clusters.

0.022680521 = product of:
  0.045361042 = sum of:
    0.031425897 = weight(_text_:library in 2509) [ClassicSimilarity], result of:
      0.031425897 = score(doc=2509,freq=8.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.20335563 = fieldWeight in 2509, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2509)
    0.013935144 = product of:
      0.027870288 = sum of:
        0.027870288 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
          0.027870288 = score(doc=2509,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.1354154 = fieldWeight in 2509, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2509)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Content

"Most Web search engines accept natural language queries, perform some kind of fuzzy matching and produce ranked output, displaying first the documents that are most likely to be relevant. On the other hand, most library online public access catalogs (OPACs) an the Web are still Boolean retrieval systems that perform exact matching, and require users to express their search requests precisely in a Boolean search language and to refine their search statements to improve the search results. It is well-documented that users have difficulty searching Boolean OPACs effectively (e.g. Borgman, 1996; Ensor, 1992; Wallace, 1993). One approach to making OPACs easier to use is to develop a natural language search interface that acts as a middleware between the user's Web browser and the OPAC system. The search interface can accept a natural language query from the user and reformulate it as a series of Boolean search statements that are then submitted to the OPAC. The records retrieved by the OPAC are ranked by the search interface before forwarding them to the user's Web browser. The user, then, does not need to interact directly with the Boolean OPAC but with the natural language search interface or search intermediary. The search interface interacts with the OPAC system an the user's behalf. The advantage of this approach is that no modification to the OPAC or library system is required. Furthermore, the search interface can access multiple OPACs, acting as a meta search engine, and integrate search results from various OPACs before sending them to the user. The search interface needs to incorporate a method for converting the user's natural language query into a series of Boolean search statements, and for ranking the OPAC records retrieved. The purpose of this study was to develop a relevancyranking algorithm for a search interface to Boolean OPAC systems. This is part of an on-going effort to develop a knowledge-based search interface to OPACs called the E-Referencer (Khoo et al., 1998, 1999; Poo et al., 2000). E-Referencer v. 2 that has been implemented applies a repertoire of initial search strategies and reformulation strategies to retrieve records from OPACs using the Z39.50 protocol, and also assists users in mapping query keywords to the Library of Congress subject headings."

Source

Electronic library. 22(2004) no.2, S.112-120

0.02024642 = product of:
  0.08098568 = sum of:
    0.08098568 = product of:
      0.16197136 = sum of:
        0.16197136 = weight(_text_:project in 6388) [ClassicSimilarity], result of:
          0.16197136 = score(doc=6388,freq=2.0), product of:
            0.24808002 = queryWeight, product of:
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.05877307 = queryNorm
            0.6528997 = fieldWeight in 6388, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.109375 = fieldNorm(doc=6388)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

0.015925879 = product of:
  0.063703515 = sum of:
    0.063703515 = product of:
      0.12740703 = sum of:
        0.12740703 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.12740703 = score(doc=402,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.61904186 = fieldWeight in 402, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=402)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Information processing and management. 22(1986) no.6, S.465-476

0.015155492 = product of:
  0.06062197 = sum of:
    0.06062197 = weight(_text_:digital in 4811) [ClassicSimilarity], result of:
      0.06062197 = score(doc=4811,freq=2.0), product of:
        0.23183343 = queryWeight, product of:
          3.944552 = idf(docFreq=2326, maxDocs=44218)
          0.05877307 = queryNorm
        0.26148933 = fieldWeight in 4811, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.944552 = idf(docFreq=2326, 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

0.013935144 = product of:
  0.055740576 = sum of:
    0.055740576 = product of:
      0.11148115 = sum of:
        0.11148115 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.11148115 = score(doc=2134,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

30. 3.2001 13:32:22

0.013468241 = product of:
  0.053872965 = sum of:
    0.053872965 = weight(_text_:library in 6430) [ClassicSimilarity], result of:
      0.053872965 = score(doc=6430,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.34860963 = fieldWeight in 6430, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.09375 = fieldNorm(doc=6430)
  0.25 = coord(1/4)

Source

Bulletin of the Library Association of China. 1998, no.61, S.103-125

0.012229546 = product of:
  0.048918184 = sum of:
    0.048918184 = product of:
      0.14675455 = sum of:
        0.14675455 = weight(_text_:objects in 6934) [ClassicSimilarity], result of:
          0.14675455 = score(doc=6934,freq=2.0), product of:
            0.31238306 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05877307 = queryNorm
            0.46979034 = fieldWeight in 6934, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0625 = fieldNorm(doc=6934)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

The equivalence of semantic networks with spreading activation and vector spaces with dot product is investigated under ranked retrieval. Semantic networks are viewed as networks of concepts organized in terms of abstraction and packaging relations. It is shown that the two models can be effectively constructed from each other. A formal method is suggested to analyze the models in terms of their relative performance in the same universe of objects

0.0119444085 = product of:
  0.047777634 = sum of:
    0.047777634 = product of:
      0.09555527 = sum of:
        0.09555527 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.09555527 = score(doc=58,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.46428138 = fieldWeight in 58, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=58)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

14. 6.2015 22:12:44

0.0119444085 = product of:
  0.047777634 = sum of:
    0.047777634 = product of:
      0.09555527 = sum of:
        0.09555527 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
          0.09555527 = score(doc=2051,freq=2.0), product of:
            0.20581327 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05877307 = queryNorm
            0.46428138 = fieldWeight in 2051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=2051)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

14. 6.2015 22:12:56

0.011223534 = product of:
  0.044894136 = sum of:
    0.044894136 = weight(_text_:library in 7818) [ClassicSimilarity], result of:
      0.044894136 = score(doc=7818,freq=2.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.29050803 = fieldWeight in 7818, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.078125 = fieldNorm(doc=7818)
  0.25 = coord(1/4)

Source

Library and information briefings. 1993, no.49, S.1-11

0.011223534 = product of:
  0.044894136 = sum of:
    0.044894136 = weight(_text_:library in 1928) [ClassicSimilarity], result of:
      0.044894136 = score(doc=1928,freq=8.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.29050803 = fieldWeight in 1928, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1928)
  0.25 = coord(1/4)

Abstract

Reports on a novel technique for literature indexing and searching in a mechanized library system. The notion of relevance is taken as the key concept in the theory of information retrieval and a comparative concept of relevance is explicated in terms of the theory of probability. The resulting technique called 'Probabilistic indexing' allows a computing machine, given a request for information, to make a statistical inference and derive a number (called the 'relevance number') for each document, which is a measure of the probability that the document will satisfy the given request. The result of a search is an ordered list of those documents which satisfy the request ranked according to their probable relevance. The paper goes on to show that whereas in a conventional library system the cross-referencing ('see' and 'see also') is based soley on the 'semantic closeness' between index terms, statistical measures of closeness between index terms can be defined and computed. Thus, given an arbitrary request consisting of one (or many) index term(s), a machine can eleborate on it to increase the probability of selecting relevant documents that would not otherwise have been selected. Finally, the paper suggest an interpretation of the whole library problem as one where the request is considered as a clue on the basis of which the library system makes a concatenated statistical inference in order to provide as an output an ordered list of those documents which most probably satisfy the information needs of the user

0.011110732 = product of:
  0.04444293 = sum of:
    0.04444293 = weight(_text_:library in 2419) [ClassicSimilarity], result of:
      0.04444293 = score(doc=2419,freq=4.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.28758827 = fieldWeight in 2419, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2419)
  0.25 = coord(1/4)

Abstract

Reports the design, building and testing of the Interactive Ranked Output Search Engine (IROSE), which includes as the main features: query reformulation, ranked output match options, field bias options, marking of must, minus, and truncated suppressed terms. Both DOS and Windows versions of IROSE were constructed and laboratory search tests were performed using 3 test collections of records with queries and relevance jedgements in the subject area of cystic fibrosis, library and information and current affairs. Concludes that there is substantial evidence of the quality of this approach to information retrieval and future tests are needed to redefine and improve the optionality and move to semi operational testing

Imprint

London : British Library Research and Development Department

0.011110732 = product of:
  0.04444293 = sum of:
    0.04444293 = weight(_text_:library in 2731) [ClassicSimilarity], result of:
      0.04444293 = score(doc=2731,freq=4.0), product of:
        0.15453665 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.05877307 = queryNorm
        0.28758827 = fieldWeight in 2731, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2731)
  0.25 = coord(1/4)

Abstract

An automatic query expansion (AQE) facility in anonline catalogue was evaluated in an operational library setting. The OKAPI experimental system had other features including: ranked output 'best match' keyword searching, automatic stemming, spelling normalisation and cross referencing as well as relevance feedback. A combination of transaction log analysis, search replays, questionnaires and interviews was used for data collection. Findings show that contrary to previous results, AQE was beneficial in a substantial number of searches. Use intentions, the effectiveness of the 'best match' search and user interaction were identified as the main factors affecting the take-up of the query expansion facility

0.010700852 = product of:
  0.042803407 = sum of:
    0.042803407 = product of:
      0.12841022 = sum of:
        0.12841022 = weight(_text_:objects in 2526) [ClassicSimilarity], result of:
          0.12841022 = score(doc=2526,freq=2.0), product of:
            0.31238306 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.05877307 = queryNorm
            0.41106653 = fieldWeight in 2526, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2526)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Abstract

The theory of rough sets was introduced in 1982. It allows the classification of objects into sets of equivalent members based on their attributes. Any combination of the same objetcts (or even their attributes) may be examined using the resultant classification. The theory has direct applications in the design and evaluation of classification schemes and the selection of discriminating attributes. Introductory papers discuss its application in the domain of medical diagnostic systems and the design of information retrieval systems accessing collections of documents. Advantages offered by the theory are: the implicit inclusion of Boolean logic; term weighting; and the ability to rank retrieved documents.