Search (6 results, page 1 of 1)

0.031622212 = product of:
  0.15811105 = sum of:
    0.15811105 = weight(_text_:views in 1937) [ClassicSimilarity], result of:
      0.15811105 = score(doc=1937,freq=4.0), product of:
        0.2920221 = queryWeight, product of:
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.050563898 = queryNorm
        0.5414352 = fieldWeight in 1937, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.046875 = fieldNorm(doc=1937)
  0.2 = coord(1/5)

Abstract

Demonstrates that a mode of interaction, analogous to the optomechanical principles applied in the Peek-a-Boo system, can be applied in computerized retrieval systems to enhance the quality of human-computer interaction radically and increase effectiveness. The MenUSE (Menu based User Search Engine) software has evolved from constructing explicit Boolean combinations of concepts automatically to using an implicit Boolean searching approach, similar to Peek-a-Boo. Thesauri and classification schemes, together with other searchable values, provide the user with views of a database and a means for the recognition and selection of concepts and other parameters by the end user. The resulting filtering model has been implemented for searching the European Parliament's EPOQUE database and for INSPEC. This second application provides illustrations of the technique for this paper

0.031622212 = product of:
  0.15811105 = sum of:
    0.15811105 = weight(_text_:views in 2735) [ClassicSimilarity], result of:
      0.15811105 = score(doc=2735,freq=4.0), product of:
        0.2920221 = queryWeight, product of:
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.050563898 = queryNorm
        0.5414352 = fieldWeight in 2735, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.046875 = fieldNorm(doc=2735)
  0.2 = coord(1/5)

Abstract

An approach to accessing databases, which makes extensive use of structured thesaurus views for presenting and searching a large bibliographic database through progressive refinement, is being investigated in a research project which is seeking to apply usability criteria as the determinant for interface design. It aims to investigate measurements of retrieval performance in an application of graphical user interface techniques using multi-windowed layered attribute value aggregation, including those provided by a structured thesaurus, to access bibliographic databases. This paper reports on the progress made in the first year of the project of the application of usability methodologies, the revision of a preliminray design and the resulting prototype development. Implications for more widespread applications are discussed

0.022360278 = product of:
  0.11180139 = sum of:
    0.11180139 = weight(_text_:views in 4429) [ClassicSimilarity], result of:
      0.11180139 = score(doc=4429,freq=2.0), product of:
        0.2920221 = queryWeight, product of:
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.050563898 = queryNorm
        0.3828525 = fieldWeight in 4429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.046875 = fieldNorm(doc=4429)
  0.2 = coord(1/5)

Abstract

The application of classification schemes and thesauri to improve online information retrieval can be traced back to the beginnings of online searching itself, but the true potential for using knowledge structures in the user interface has yet to be realized. View-based searching seeks to exploit the classified arrangements in thesauri and existing classification schemes to improve the performance of such systems. HIBROWSE for EMBASE is a system which demonstrates the power of applying an approach to information retrieval which is strongly related to faceted classification. It does this by employing a point a click user interface with mutually constraining views utilising knowledge structure hierarchies for both query specification and the presentation of results. The relevance of this approach to library OPACs is discussed in the context of the digital library, concluding that out legacy of research in classification and indexing is more relevant than ever in the design of systems to cope with the problems of information access

0.018633565 = product of:
  0.09316782 = sum of:
    0.09316782 = weight(_text_:views in 73) [ClassicSimilarity], result of:
      0.09316782 = score(doc=73,freq=2.0), product of:
        0.2920221 = queryWeight, product of:
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.050563898 = queryNorm
        0.31904373 = fieldWeight in 73, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.0390625 = fieldNorm(doc=73)
  0.2 = coord(1/5)

Abstract

This paper examines issues relating to the use of the Dewey Decimal Classification (DDC) in a future development of view-based searching to Online Public Access Catalogues (OPAC). View-based searching systems, exercising the principles of fully faceted classification techniques for both bibliographic and corporate database retrieval applications, are now being applied to utilise Dewey concept hierarchies in a University OPAC. Issues of efficiency and effectiveness in the evolving organisation and classification of information within libraries are examined to explain why fully faceted classification schemes have yet to realise their full potential in libraries. The key to their application in OPACs lies in the use of faceted classification as pre-coordinated indexing and abandoning the single dimension relative ordering of books on shelves. The need to maintain a single relative physical position on a bookshelf is the major source of complexity in classification. Extensive latent benefits will be realised when systematic subject arrangements, providing alternative views onto OPACs, are coupled to view-based browser and search techniques. Time and effort will be saved, and effectiveness increased, as rapid access is provided to the most appropriate information to satisfy the needs of the user. A future for Dewey Classification divorced from its decimal notation is anticipated

0.0149068525 = product of:
  0.07453426 = sum of:
    0.07453426 = weight(_text_:views in 6486) [ClassicSimilarity], result of:
      0.07453426 = score(doc=6486,freq=2.0), product of:
        0.2920221 = queryWeight, product of:
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.050563898 = queryNorm
        0.255235 = fieldWeight in 6486, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.7753086 = idf(docFreq=372, maxDocs=44218)
          0.03125 = fieldNorm(doc=6486)
  0.2 = coord(1/5)

Abstract

The scatter of items dealing with similar concepts through the physical library is a consequence of a classification process that produces a single notation to enable relative location. Compromises must be made to place an item where it is most appropriate for a given user community. No such compromise is needed with a digital library where the item can be considered to occupy a very large number of relative locations, as befits the needs of the user. Interfaces to these digital libraries can reuse the knowledge structures of their physical counterparts yet still address the problem of scatter. View-based searching is an approach that takes advantage of the knowledge structures but addresses the problem of scatter by applying a facetted approach to information retrieval. This paper describes the most recent developments in the implementation of a view-based searching system for a University Library OPAC. The user interface exploits the knowledge structures in the Dewey Decimal Classification Scheme (DDC) in navigable views with implicit Boolean searching. DDC classifies multifaceted items by building a single relative code from components. These codes may already have been combined in the schedules or be built according to well-documented instructions. Rules can be applied to decode these numbers to provide codes for each additional facet. To enhance the retrieval power of the view-based searching system, multiple facet codes are being extracted through decomposition from single Dewey Class Codes. This paper presents the results of applying automatic decomposition in respect of Geographic Area and the creation of a view (by Geographic Area) for the full collection of over 250,000 library items. This is the first step in demonstrating how the problem of scatter of subject matter across the disciplines of the Dewey Decimal Classification and the physical library collection can be addressed through the use of facets and view-based searching

0.0068507106 = product of:
  0.034253553 = sum of:
    0.034253553 = weight(_text_:22 in 6980) [ClassicSimilarity], result of:
      0.034253553 = score(doc=6980,freq=2.0), product of:
        0.17706616 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.050563898 = queryNorm
        0.19345059 = fieldWeight in 6980, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6980)
  0.2 = coord(1/5)

Source

Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon