Search (7 results, page 1 of 1)

0.01385953 = product of:
  0.06929765 = sum of:
    0.06929765 = weight(_text_:system in 430) [ClassicSimilarity], result of:
      0.06929765 = score(doc=430,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.42190298 = fieldWeight in 430, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=430)
  0.2 = coord(1/5)

Abstract

Explores interface design raised by the development and evaluation of Okapi, a highly interactive information retrieval system based on a probabilistic retrieval model with relevance feedback. It uses terms frequency weighting functions to display retrieved items in a best match ranked order; it can also find additional items similar to those marked as relevant by the searcher. Compares the effectiveness of automatic and interactive query expansion in different user interface environments. focuses on the nature of interaction in information retrieval and the interrelationship between functional visibility, the user's cognitive loading and the balance of control between user and system

0.01385953 = product of:
  0.06929765 = sum of:
    0.06929765 = weight(_text_:system in 4705) [ClassicSimilarity], result of:
      0.06929765 = score(doc=4705,freq=6.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.42190298 = fieldWeight in 4705, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4705)
  0.2 = coord(1/5)

Abstract

Describes the evolution and some of the functions of the layers of complex software which lie between the basic formula at the heart of the Okapi information retrieval system and the simple interface which it presents to the user. Addresses some possible approaches to the goal of easy system configurability, a goal which can be at odds with the desire to build a fully integrated package. Considers some of the issues to be faced in moving Okapi to the WWW, client server, distributed processing environment

0.013717378 = product of:
  0.068586886 = sum of:
    0.068586886 = weight(_text_:system in 3369) [ClassicSimilarity], result of:
      0.068586886 = score(doc=3369,freq=8.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.41757566 = fieldWeight in 3369, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=3369)
  0.2 = coord(1/5)

Abstract

The ENQUIRE project forms part of a series of investigations on query expansion in the Okapi experimental text retrieval system. A configurable user interface was implemented as an evaluative tool and tested in two locations on two different databases: the library catalogue of The London Business SChool and the computing section of INSPEC. The system offered a range of possible strategies based on thesaural terms for reformulating queries. These could be initiated automatically by the system or interactively with the user. The formative phase of the evaluation established the appropriateness and usability of the interface as well as users' perceptions of the underlying functionality. The aim of the large scale field trial was to determine to what extent user would select thesaural terms suggested by the system to reformulate queries, and to evaluate the effectiveness of a new dynamic form of query expansion implemented for this project

0.009699649 = product of:
  0.048498247 = sum of:
    0.048498247 = weight(_text_:system in 5279) [ClassicSimilarity], result of:
      0.048498247 = score(doc=5279,freq=4.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.29527056 = fieldWeight in 5279, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=5279)
  0.2 = coord(1/5)

Abstract

This paper demonstrates the application of conventional database design techniques to thesaurus representation. The thesaurus is considered as a printed document, as a semantic net, and as a relational database to be used in conjunction with an intelligent information retrieval system. Some issues raised by analysis of two standard thesauri include: the prevalence of compound terms and the representation of term structure; thesaurus redundancy and the extent to which it can be eliminated in machine-readable versions; the difficulty of exploiting thesaurus knowledge originally designed for human rather than automatic interpretation; deriving 'strength of association' measures between terms in a thesaurus considered as a semantic net; facet representation and the need for variations in the data model to cater for structural differences between thesauri. A complete schema of database tables is presented, with an outline suggestion for using the stored information when matching one or more thesaurus terms with a user's query

0.008001803 = product of:
  0.040009014 = sum of:
    0.040009014 = weight(_text_:system in 180) [ClassicSimilarity], result of:
      0.040009014 = score(doc=180,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.2435858 = fieldWeight in 180, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=180)
  0.2 = coord(1/5)

Abstract

We discuss whether it is feasible to build intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. We survey some approaches to the problem reported in the literature, particularly those involving the assignement of 'link weights' in a thesaurus network, and point out some problems of both principle and practice. We then describe investigations which entailed logging the behavior of thesaurus users and testing the effect of thesaurus-based query enhancement in an IR system using term weighting, in an attempt to identify successful strategies to incorporate into automatic procedures. The results cause us to question many of the assumptions made by previous researchers in this area

0.008001803 = product of:
  0.040009014 = sum of:
    0.040009014 = weight(_text_:system in 5806) [ClassicSimilarity], result of:
      0.040009014 = score(doc=5806,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.2435858 = fieldWeight in 5806, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5806)
  0.2 = coord(1/5)

Abstract

Reports on work in progress to define an object oriented model of a probabilistic information retrieval system (OKAPI), the central component of which is the query itself. Considers how to represent queries both internally and at the user interface level, and their relationship with other components of the model. The model will form the basis of a configurable user interface, which allows controlled experiments to be undertaken, and could be adapted to the needs of different users accessing different databases. Implementation will involve the use of a high level interpreted scripting language for overall control, communicating with an internal model and an interface model, designed and developed using object oriented techniques

0.006858689 = product of:
  0.034293443 = sum of:
    0.034293443 = weight(_text_:system in 4435) [ClassicSimilarity], result of:
      0.034293443 = score(doc=4435,freq=2.0), product of:
        0.1642502 = queryWeight, product of:
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.052150324 = queryNorm
        0.20878783 = fieldWeight in 4435, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1495528 = idf(docFreq=5152, maxDocs=44218)
          0.046875 = fieldNorm(doc=4435)
  0.2 = coord(1/5)

Abstract

This study explored how the expression of search facets and relevance feedback (RF) by users was related to search success in interactive and automatic query expansion in the course of the search process. Search success was measured both in the number of relevant documents retrieved, whether identified by users or not. Research design consisted of 26 users searching for four TREC topics in Okapi IR system, half of the searchers using interactive and half automatic query expansion based on RF. The search logs were recorded, and the users filled in questionnaires for each topic concerning various features of searching. The results showed that the exhaustivity of the query was the most significant predictor of search success. Interactive expansion led to better search success than automatic expansion if all retrieved relevant items were counted, but there was no difference between the methods if only those items recognised relevant by users were observed. The analysis showed that the difference was facilitated by the liberal relevance criterion used in TREC not favouring highly relevant documents in evaluation.