Search (67 results, page 1 of 4)

0.108577125 = product of:
  0.16286568 = sum of:
    0.12868872 = weight(_text_:index in 454) [ClassicSimilarity], result of:
      0.12868872 = score(doc=454,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.5793543 = fieldWeight in 454, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.09375 = fieldNorm(doc=454)
    0.034176964 = product of:
      0.06835393 = sum of:
        0.06835393 = weight(_text_:classification in 454) [ClassicSimilarity], result of:
          0.06835393 = score(doc=454,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.42223644 = fieldWeight in 454, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.09375 = fieldNorm(doc=454)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Source

Cataloging and classification quarterly. 10(1989) nos.1/2, S.81-94

Theme

Preserved Context Index System (PRECIS)

0.071409 = product of:
  0.107113495 = sum of:
    0.0928731 = weight(_text_:index in 1970) [ClassicSimilarity], result of:
      0.0928731 = score(doc=1970,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.418113 = fieldWeight in 1970, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1970)
    0.014240401 = product of:
      0.028480802 = sum of:
        0.028480802 = weight(_text_:classification in 1970) [ClassicSimilarity], result of:
          0.028480802 = score(doc=1970,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.17593184 = fieldWeight in 1970, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1970)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Authority files have played an important role in improving the quality of indexing and subject cataloging. Although authorities can significantly improve searching by increasing the number of access points, they are rarely an integral part of the information retrieval process, particularly end-users' searches. A retrieval prototype, searchFAST, was developed to test the feasibility of using an authority file as an index to bibliographic records. searchFAST uses Faceted Application of Subject Terminology (FAST) as an index to OCLC's WorldCat.org bibliographic database. The searchFAST prototype complements, rather than replaces, existing WorldCat.org access. The bibliographic file is searched indirectly; first the authority file is searched to identify appropriate subject headings, then the headings are used to retrieve the matching bibliographic records. The prototype demonstrates the effectiveness and practicality of using an authority file as an index. Searching the authority file leverages authority control work by increasing the number of access points while supporting a simple interface designed for end-users.

Source

Cataloging and classification quarterly. 52(2014) no.1, S.6-19

0.063979685 = product of:
  0.09596953 = sum of:
    0.075830564 = weight(_text_:index in 96) [ClassicSimilarity], result of:
      0.075830564 = score(doc=96,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3413878 = fieldWeight in 96, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=96)
    0.020138968 = product of:
      0.040277936 = sum of:
        0.040277936 = weight(_text_:classification in 96) [ClassicSimilarity], result of:
          0.040277936 = score(doc=96,freq=4.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.24880521 = fieldWeight in 96, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=96)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The paper looks at ways in which traditional classification and indexing tools have dealt with the relationships between constituent terms; variations in these are examined and compared with the methods used in machine searching, particularly of the Internet and World Wide Web. Apparent correspondences with features of index languages are identified, and further methods of applying classification and indexing theory to machine retrieval are proposed. There are various ways in which indexing and retrieval systems, both conventional and electronic, deal with the problem of searching for documents on a subject basis, and various approaches to the analysis and processing of a query. There appear to be three basic models; the taxonomic or structural system, in which the user is offered a map of the `universe of knowledge'; the language based system, which offers a vocabulary of the subject and a grammar for dealing with compound statements; and the mathematical model using the language of symbolic logic or the algebra of set theory

0.063336655 = product of:
  0.09500498 = sum of:
    0.07506842 = weight(_text_:index in 828) [ClassicSimilarity], result of:
      0.07506842 = score(doc=828,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.33795667 = fieldWeight in 828, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0546875 = fieldNorm(doc=828)
    0.019936562 = product of:
      0.039873123 = sum of:
        0.039873123 = weight(_text_:classification in 828) [ClassicSimilarity], result of:
          0.039873123 = score(doc=828,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.24630459 = fieldWeight in 828, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0546875 = fieldNorm(doc=828)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Source

International classification. 11(1984), S.3-8

Theme

Preserved Context Index System (PRECIS)

0.048678637 = product of:
  0.073017955 = sum of:
    0.05308139 = weight(_text_:index in 97) [ClassicSimilarity], result of:
      0.05308139 = score(doc=97,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.23897146 = fieldWeight in 97, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.02734375 = fieldNorm(doc=97)
    0.019936562 = product of:
      0.039873123 = sum of:
        0.039873123 = weight(_text_:classification in 97) [ClassicSimilarity], result of:
          0.039873123 = score(doc=97,freq=8.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.24630459 = fieldWeight in 97, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.02734375 = fieldNorm(doc=97)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the World Wide Web. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing system of Ranganathan. A prototype Software System has been designed to create a database of records specifying Web documents according to the Dublin Core and to input a faceted subject heading according to DSIS. Synonymous terms are added to the Standard terms in the heading using appropriate symbols. Once the data are entered along with a description and the URL of the web document, the record is stored in the System. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The System stores the Surrogates and keeps the faceted subject headings separately after establishing a link. The search is carried out an index entries derived from the faceted subject heading using the chain indexing technique. If a single term is Input, the System searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved Keadings is too large (running into more than a page) the user has the option of entering another search term to be searched in combination. The System searches subject headings already retrieved and looks for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL, the original document an the web can be accessed. The prototype system developed in a Windows NT environment using ASP and a web server is under rigorous testing. The database and Index management routines need further development.
An interesting but somewhat confusing article telling how the writers described web pages with Dublin Core metadata, including a faceted classification, and built a system that lets users browse the collection through the facets. They seem to want to cover too much in a short article, and unnecessary space is given over to screen shots showing how Dublin Core metadata was entered. The screen shots of the resulting browsable system are, unfortunately, not as enlightening as one would hope, and there is no discussion of how the system was actually written or the technology behind it. Still, it could be worth reading as an example of such a system and how it is treated in journals.

0.04524047 = product of:
  0.0678607 = sum of:
    0.0536203 = weight(_text_:index in 2703) [ClassicSimilarity], result of:
      0.0536203 = score(doc=2703,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.24139762 = fieldWeight in 2703, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2703)
    0.014240401 = product of:
      0.028480802 = sum of:
        0.028480802 = weight(_text_:classification in 2703) [ClassicSimilarity], result of:
          0.028480802 = score(doc=2703,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.17593184 = fieldWeight in 2703, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2703)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

This paper discusses two inter-related themes: the retrieval potential of faceted thesauri and XML representations of fundamental facets. Initial findings are discussed from the ongoing 'FACET' project, in collaboration with the National Museum of Science and Industry. The work discussed seeks to take advantage of the structure afforded by faceted systems for multi-term queries and flexible matching, focusing in this paper an the Art and Architecture Thesaurus. A multi-term matching function yields ranked results with partial matches via semantic term expansion, based an a measure of distance over the semantic index space formed by thesaurus relationships. Our intention is to drive the system from general representations and a common query structure and interface. To this end, we are developing an XML representation based an work by the Classification Research Group an fundamental facets or categories. The XML representation maps categories to particular thesauri and hierarchies. The system interface, which is configured by the mapping, incorporates a thesaurus browser with navigation history together with a term search facility and drag and drop query builder.

0.043787256 = product of:
  0.065680884 = sum of:
    0.04289624 = weight(_text_:index in 3966) [ClassicSimilarity], result of:
      0.04289624 = score(doc=3966,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.1931181 = fieldWeight in 3966, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.03125 = fieldNorm(doc=3966)
    0.022784641 = product of:
      0.045569282 = sum of:
        0.045569282 = weight(_text_:classification in 3966) [ClassicSimilarity], result of:
          0.045569282 = score(doc=3966,freq=8.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.28149095 = fieldWeight in 3966, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03125 = fieldNorm(doc=3966)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Organizing and providing access to the resources an the Internet has been a problem area in spite of the availability of sophisticated search engines and other Software tools. There have been several attempts to organize the resources an the WWW. Some of them have tried to use traditional library classification schemes such as the Library of Congress Classification, the Dewey Decimal Classification and others. However there is a need to assign proper subject headings to them and present them in a logical or hierarchical sequence to cater to the need for browsing. This paper attempts to describe an experimental system designed to organize and provide access to web documents using a faceted pre-coordinate indexing system based an the Deep Structure Indexing System (DSIS) derived from POPSI (Postulate based Permuted Subject Indexing) of Bhattacharyya, and the facet analysis and chain indexing System of Ranganathan. A prototype software system has been designed to create a database of records specifying Web documents according to the Dublin Core and input a faceted subject heading according to DSIS. Synonymous terms are added to the standard terms in the heading using appropriate symbols. Once the data are entered along with a description and URL of the Web document, the record is stored in the system. More than one faceted subject heading can be assigned to a record depending an the content of the original document. The system stores the surrogates and keeps the faceted subject headings separately after establishing a link. Search is carried out an index entries derived from the faceted subject heading using chain indexing technique. If a single term is input, the system searches for its presence in the faceted subject headings and displays the subject headings in a sorted sequence reflecting an organizing sequence. If the number of retrieved headings is too large (running into more than a page) then the user has the option of entering another search term to be searched in combination. The system searches subject headings already retrieved and look for those containing the second term. The retrieved faceted subject headings can be displayed and browsed. When the relevant subject heading is selected the system displays the records with their URLs. Using the URL the original document an the web can be accessed. The prototype system developed under Windows NT environment using ASP and web server is under rigorous testing. The database and indexes management routines need further development.

Source

Subject retrieval in a networked environment: Proceedings of the IFLA Satellite Meeting held in Dublin, OH, 14-16 August 2001 and sponsored by the IFLA Classification and Indexing Section, the IFLA Information Technology Section and OCLC. Ed.: I.C. McIlwaine

0.03714924 = product of:
  0.111447714 = sum of:
    0.111447714 = weight(_text_:index in 2230) [ClassicSimilarity], result of:
      0.111447714 = score(doc=2230,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.50173557 = fieldWeight in 2230, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=2230)
  0.33333334 = coord(1/3)

Abstract

Experimental evidence suggests that enhancing the subject content of OPAC records can improve retrieval performance. This is based on the use of natural language index terms derived from the table of contents and back-of-the-book index of documents. The research reported here investigates the alternative approach of translating these natural language terms into controlled vocabulary. Subject queries were collected by interview at the catalogue, and indexing of the queries demonstrated the impressive ability of PRECIS, and to a lesser extent LCSH, to represent users' information needs. DDC performed poorly in this respect. The assumption was made that an index language adequately specific to represent users' queries should be adequate to represent document contents. Searches were carried out on three test databases, and both natural language and PRECIS enhancement of MARC records increased the number of relevant documents found, with PRECIS showing the better performance. However, with weak stemming the advantage of PRECIS was lost. Consideration must also be given to the potential advantages of controlled vocabulary, over and above basic retrieval performance measures

0.03714924 = product of:
  0.111447714 = sum of:
    0.111447714 = weight(_text_:index in 310) [ClassicSimilarity], result of:
      0.111447714 = score(doc=310,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.50173557 = fieldWeight in 310, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=310)
  0.33333334 = coord(1/3)

Abstract

Authority files have played an important role in improving the quality of indexing and subject cataloging. Although authorities can significantly improve search by increasing the number of access points, they are rarely an integral part of the information retrieval process, particularly end-users searches. A retrieval prototype, searchFAST, was developed to test the feasibility of using an authority file as an index to bibliographic records. searchFAST uses FAST (Faceted Application of Subject Terminology) as an index to OCLC's WorldCat.org bibliographic database. The searchFAST methodology complements, rather than replaces, existing WorldCat.org access. The bibliographic file is searched indirectly; first the authority file is searched to identify appropriate subject headings, then the headings are used to retrieve the matching bibliographic records. The prototype demonstrates the effectiveness and practicality of using an authority file as an index. Searching the authority file leverages authority control work by increasing the number of access points while supporting a simple interface designed for end-users.

0.029360829 = product of:
  0.088082485 = sum of:
    0.088082485 = sum of:
      0.039873123 = weight(_text_:classification in 7238) [ClassicSimilarity], result of:
        0.039873123 = score(doc=7238,freq=2.0), product of:
          0.16188543 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05083213 = queryNorm
          0.24630459 = fieldWeight in 7238, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.0546875 = fieldNorm(doc=7238)
      0.04820936 = weight(_text_:22 in 7238) [ClassicSimilarity], result of:
        0.04820936 = score(doc=7238,freq=2.0), product of:
          0.17800546 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05083213 = queryNorm
          0.2708308 = fieldWeight in 7238, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=7238)
  0.33333334 = coord(1/3)

Date

22. 4.1997 20:43:23

Source

Cataloging and classification quarterly. 23(1996) no.2, S.5-16

0.028597495 = product of:
  0.08579248 = sum of:
    0.08579248 = weight(_text_:index in 2305) [ClassicSimilarity], result of:
      0.08579248 = score(doc=2305,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3862362 = fieldWeight in 2305, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=2305)
  0.33333334 = coord(1/3)

Abstract

A research project in progress at Middlesex Polytechnic is examining the problems of providing adequate subject access from MARC-based cataloguing systems. Various forms of printed index are being evaluated and an experimental OPAC is being designed. The PRECIS RIN file will be tested as a basis for online thesaural control and as a browsing facility

0.025166426 = product of:
  0.075499274 = sum of:
    0.075499274 = sum of:
      0.034176964 = weight(_text_:classification in 5920) [ClassicSimilarity], result of:
        0.034176964 = score(doc=5920,freq=2.0), product of:
          0.16188543 = queryWeight, product of:
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.05083213 = queryNorm
          0.21111822 = fieldWeight in 5920, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1847067 = idf(docFreq=4974, maxDocs=44218)
            0.046875 = fieldNorm(doc=5920)
      0.04132231 = weight(_text_:22 in 5920) [ClassicSimilarity], result of:
        0.04132231 = score(doc=5920,freq=2.0), product of:
          0.17800546 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05083213 = queryNorm
          0.23214069 = fieldWeight in 5920, 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=5920)
  0.33333334 = coord(1/3)

Date

27. 5.2001 16:22:21

Series

Cataloging and classification quarterly; vol.29, nos.1/2

0.02144812 = product of:
  0.06434436 = sum of:
    0.06434436 = weight(_text_:index in 835) [ClassicSimilarity], result of:
      0.06434436 = score(doc=835,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.28967714 = fieldWeight in 835, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=835)
  0.33333334 = coord(1/3)

Abstract

Although subject hierarchies are widely used to index document collections, few tools leverage their structure to facilitate collection browsing. This is mostly due to the complexity of such structures that include thousands of nodes. This paper proposes a new approach to simplify subject hierarchies based on the distribution of documents among the nodes. A random walk algorithm simulates the route of a user within the hierarchy, under the assumption that the user is attracted by the most populated nodes. Poorly visited nodes can be identified and eliminated, leaving a structure containing only the nodes that best represent the content of the collection. Experiments on a collection indexed using the Library of Congress Subject Headings (LCSH) show that, as compared to the state-of-the-art simplification method, the random walk-based approach gives access to a larger part of the collection for the same structure size, and offers more flexibility to customize the complexity of thestructure.

0.017873434 = product of:
  0.0536203 = sum of:
    0.0536203 = weight(_text_:index in 834) [ClassicSimilarity], result of:
      0.0536203 = score(doc=834,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.24139762 = fieldWeight in 834, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=834)
  0.33333334 = coord(1/3)

Abstract

The Library of Congress Subject Headings (LCSH) is a subject structure used to index large collections throughout the world. Browsing a collection through LCSH is difficult using current on-line tools in part because they are inadequately integrated with information collections. Users of these LCSH browsing tools are expected to find a promising LCSH string before using it to search for the information itself; many users do not have the patience for such a two-step process. This article proposes a method to fully integrate a specific collection in its subset of the LCSH hierarchy in order to facilitate LCSH browsing as well as information retrieval. Techniques are described to match LCSH strings assigned to the collection with an established string from the authority records, and build their specific LCSH hierarchy. The resulting subset of LCSH structure is described in terms of its size and broader/narrower term statistics, and implications for browsing and information retrieval are discussed. The results of this research have implications for institutions wishing to further capitalize on existing LCSH organization investments for the purpose of subject browsing and information retrieval.

0.016111176 = product of:
  0.048333526 = sum of:
    0.048333526 = product of:
      0.09666705 = sum of:
        0.09666705 = weight(_text_:classification in 2098) [ClassicSimilarity], result of:
          0.09666705 = score(doc=2098,freq=4.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.5971325 = fieldWeight in 2098, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.09375 = fieldNorm(doc=2098)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Classification research for knowledge representation and organization. Proc. 5th Int. Study Conf. on Classification Research, Toronto, Canada, 24.-28.6.1991. Ed. by N.J. Williamson u. M. Hudon

0.00986604 = product of:
  0.029598119 = sum of:
    0.029598119 = product of:
      0.059196237 = sum of:
        0.059196237 = weight(_text_:classification in 5609) [ClassicSimilarity], result of:
          0.059196237 = score(doc=5609,freq=6.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.3656675 = fieldWeight in 5609, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=5609)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

In 1986 Libraries Unlimited published Cochrane's book, Improving LCSH for Use in Online Catalogs; Exercises for Self-Help with a Selection of Background Readings. This was preceded in 1981 by an ERIC publication (ED 208 900) by Cochrane, with Monika Kirtland Bibliographic and Bibliometric Essay which documented critical views of LCSH and an analysis of vocabulary control in LCSH (parts of which were published in Cataloging & Classification Quarterly' 1(2/3) (1982), 71-94). Three features of LCSH will be re-examined to check on progress since the time of these earlier publications: notes, structure of relationships between headings in the list, and links between Library of Congress classification numbers and LCSH or other vocabularies

Series

Cataloging and classification quarterly; vol.29, nos.1/2

0.009493601 = product of:
  0.028480802 = sum of:
    0.028480802 = product of:
      0.056961603 = sum of:
        0.056961603 = weight(_text_:classification in 873) [ClassicSimilarity], result of:
          0.056961603 = score(doc=873,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.35186368 = fieldWeight in 873, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.078125 = fieldNorm(doc=873)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.009182736 = product of:
  0.027548207 = sum of:
    0.027548207 = product of:
      0.055096414 = sum of:
        0.055096414 = weight(_text_:22 in 3734) [ClassicSimilarity], result of:
          0.055096414 = score(doc=3734,freq=2.0), product of:
            0.17800546 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05083213 = queryNorm
            0.30952093 = fieldWeight in 3734, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3734)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Searcher. 3(1995) no.8, S.18-22

0.008055588 = product of:
  0.024166763 = sum of:
    0.024166763 = product of:
      0.048333526 = sum of:
        0.048333526 = weight(_text_:classification in 5611) [ClassicSimilarity], result of:
          0.048333526 = score(doc=5611,freq=4.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.29856625 = fieldWeight in 5611, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=5611)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

The IFLA Section on Classification and Indexing's Working Group on Principles Underlying Subject Headings Languages has identified a set of eleven principles for subject heading languages and excerpted the texts that match each principle from the instructions for each of eleven national subject indexing systems, including excerpts from the LC's Subject Cataloging Manual: Subject Headings. This study compares the IFLA principles with other texts that express the principles underlying LCSH, especially Library of Congress Subject Headings: Principles of Structure and Policies for Application, prepared by Lois Mai Chan for the Library of Congress in 1990, Chan's later book on LCSH, and earlier documents by Haykin and Cutter. The principles are further elaborated for clarity and discussed

Series

Cataloging and classification quarterly; vol.29, nos.1/2

0.008055588 = product of:
  0.024166763 = sum of:
    0.024166763 = product of:
      0.048333526 = sum of:
        0.048333526 = weight(_text_:classification in 5698) [ClassicSimilarity], result of:
          0.048333526 = score(doc=5698,freq=4.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.29856625 = fieldWeight in 5698, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=5698)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Describes the shortcomings of search engines for the WWW comparing their current capabilities to those of the first generation CD-ROM products. Some allow phrase searching and most are improving their Boolean searching. Few allow truncation, wild cards or nested logic. They are stateless, losing previous search criteria. Unlike the indexing and classification systems for today's CD-ROMs, those for Web pages are random, unstructured and of variable quality. Considers that at best Web search engines can only offer free text searching. Discusses whether automatic data classification systems such as Infoseek Ultra can overcome the haphazard nature of the Web with neural network technology, and whether Boolean search techniques may be redundant when replaced by technology such as the Euroferret search engine. However, artificial intelligence is rarely successful on huge, varied databases. Relevance ranking and automatic query expansion still use the same simple inverted indexes. Most Web search engines do nothing more than word counting. Further complications arise with foreign languages