Search (74 results, page 4 of 4)

0.0061664553 = product of:
  0.024665821 = sum of:
    0.024665821 = product of:
      0.049331643 = sum of:
        0.049331643 = weight(_text_:project in 2703) [ClassicSimilarity], result of:
          0.049331643 = score(doc=2703,freq=2.0), product of:
            0.21156175 = queryWeight, product of:
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.050121464 = queryNorm
            0.23317845 = fieldWeight in 2703, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.220981 = idf(docFreq=1764, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2703)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 2322) [ClassicSimilarity], result of:
      0.022971334 = score(doc=2322,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 2322, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=2322)
  0.25 = coord(1/4)

Abstract

The introduction of computerized post-coordination has solved many of the problems of pre-coordinated subject access. However, the adoption of computerized post-coordination results in the loss of some pre-coordination benefits. Specifically, the effect of hiding terms within the context of others is lost in post-coodination which give lead status to every document term. This results in spurious matches of terms out of context. Library patrons and Internet searchers are increasingly dissatisfied with subject access performance, in part because of unmanageably large retrieval sets. The need to enhance precision and limit the size of retrieval sets motivates this work which proposes partial coordination, an approach which incorporates the advantages of computer search with the ability of pre-coordination to limit spurious partial matches and thereby enhance precision

0.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 2323) [ClassicSimilarity], result of:
      0.022971334 = score(doc=2323,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 2323, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=2323)
  0.25 = coord(1/4)

Abstract

Partial coordination is a new method for cataloging documents for subject access. It is especially designed to enhance the precision of document searches in online environments. This article reports a preliminary evaluation of partial coordination that shows promising results compared with full-text retrieval. We also report the difficulties in empirically evaluating the effectiveness of automatic full-text retrieval in contrast to mixed methods such as partial coordination which combine human cataloging with computerized retrieval. Based on our study, we propose research in this area will substantially benefit from a common framework for failure analysis and a common data set. This will allow information retrieval researchers adapting 'library style'cataloging to large electronic document collections, as well as those developing automated or mixed methods, to directly compare their proposals for indexing and retrieval. This article concludes by suggesting guidelines for constructing such as testbed

0.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 5599) [ClassicSimilarity], result of:
      0.022971334 = score(doc=5599,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 5599, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=5599)
  0.25 = coord(1/4)

Source

The LCSH century: one hundred years with the Library of Congress Subject Headings system. Ed.: A.T. Stone

0.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 5602) [ClassicSimilarity], result of:
      0.022971334 = score(doc=5602,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 5602, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=5602)
  0.25 = coord(1/4)

Source

The LCSH century: one hundred years with the Library of Congress Subject Headings system. Ed.: A.T. Stone

0.0057428335 = product of:
  0.022971334 = sum of:
    0.022971334 = weight(_text_:library in 835) [ClassicSimilarity], result of:
      0.022971334 = score(doc=835,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.17430481 = fieldWeight in 835, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.046875 = fieldNorm(doc=835)
  0.25 = coord(1/4)

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.0054143956 = product of:
  0.021657582 = sum of:
    0.021657582 = weight(_text_:library in 3966) [ClassicSimilarity], result of:
      0.021657582 = score(doc=3966,freq=4.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.16433616 = fieldWeight in 3966, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.03125 = fieldNorm(doc=3966)
  0.25 = coord(1/4)

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.

0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 3728) [ClassicSimilarity], result of:
          0.0407446 = score(doc=3728,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 3728, 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=3728)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Source

Wissensspeicher in digitalen Räumen: Nachhaltigkeit - Verfügbarkeit - semantische Interoperabilität. Proceedings der 11. Tagung der Deutschen Sektion der Internationalen Gesellschaft für Wissensorganisation, Konstanz, 20. bis 22. Februar 2008. Hrsg.: J. Sieglerschmidt u. H.P.Ohly

0.004785695 = product of:
  0.01914278 = sum of:
    0.01914278 = weight(_text_:library in 2918) [ClassicSimilarity], result of:
      0.01914278 = score(doc=2918,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14525402 = fieldWeight in 2918, 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=2918)
  0.25 = coord(1/4)

Abstract

Reports an algorithmic approach to the automatic generation of thesauri for electronic community systems. The techniques used included terms filtering, automatic indexing, and cluster analysis. The testbed for the research was the Worm Community System, which contains a comprehensive library of specialized community data and literature, currently in use by molecular biologists who study the nematode worm. The resulting worm thesaurus included 2709 researchers' names, 798 gene names, 20 experimental methods, and 4302 subject descriptors. On average, each term had about 90 weighted neighbouring terms indicating relevant concepts. The thesaurus was developed as an online search aide. Tests the worm thesaurus in an experiment with 6 worm researchers of varying degrees of expertise and background. The experiment showed that the thesaurus was an excellent 'memory jogging' device and that it supported learning and serendipitous browsing. Despite some occurrences of obvious noise, the system was useful in suggesting relevant concepts for the researchers' queries and it helped improve concept recall. With a simple browsing interface, an automatic thesaurus can become a useful tool for online search and can assist researchers in exploring and traversing a dynamic and complex electronic community system

0.004785695 = product of:
  0.01914278 = sum of:
    0.01914278 = weight(_text_:library in 834) [ClassicSimilarity], result of:
      0.01914278 = score(doc=834,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14525402 = fieldWeight in 834, 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=834)
  0.25 = coord(1/4)

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.004785695 = product of:
  0.01914278 = sum of:
    0.01914278 = weight(_text_:library in 2011) [ClassicSimilarity], result of:
      0.01914278 = score(doc=2011,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14525402 = fieldWeight in 2011, 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=2011)
  0.25 = coord(1/4)

Content

Text unter: http://www.oclc.org/content/dam/research/publications/library/2013/2013-04.pdf.

0.004737596 = product of:
  0.018950384 = sum of:
    0.018950384 = weight(_text_:library in 97) [ClassicSimilarity], result of:
      0.018950384 = score(doc=97,freq=4.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14379413 = fieldWeight in 97, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.02734375 = fieldNorm(doc=97)
  0.25 = coord(1/4)

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.

0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 374) [ClassicSimilarity], result of:
          0.033953834 = score(doc=374,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 374, 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=374)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

24. 9.2021 12:22:02

0.0038285558 = product of:
  0.015314223 = sum of:
    0.015314223 = weight(_text_:library in 1545) [ClassicSimilarity], result of:
      0.015314223 = score(doc=1545,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.11620321 = fieldWeight in 1545, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.03125 = fieldNorm(doc=1545)
  0.25 = coord(1/4)

Footnote

Rez. in: Library quarterly ( ), S.221-223 (S.P. Harter)