Search (32 results, page 1 of 2)

0.12309804 = product of:
  0.18464705 = sum of:
    0.0986154 = weight(_text_:search in 5698) [ClassicSimilarity], result of:
      0.0986154 = score(doc=5698,freq=12.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5643796 = fieldWeight in 5698, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=5698)
    0.08603165 = product of:
      0.1720633 = sum of:
        0.1720633 = weight(_text_:engines in 5698) [ClassicSimilarity], result of:
          0.1720633 = score(doc=5698,freq=8.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.67362815 = fieldWeight in 5698, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.046875 = fieldNorm(doc=5698)
      0.5 = coord(1/2)
  0.6666667 = coord(2/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

0.051579654 = product of:
  0.07736948 = sum of:
    0.056935627 = weight(_text_:search in 131) [ClassicSimilarity], result of:
      0.056935627 = score(doc=131,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3258447 = fieldWeight in 131, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=131)
    0.020433856 = product of:
      0.040867712 = sum of:
        0.040867712 = weight(_text_:22 in 131) [ClassicSimilarity], result of:
          0.040867712 = score(doc=131,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.23214069 = fieldWeight in 131, 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=131)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

After a fundamental examination of the phenomenon of time, this paper presents the history, authority, and structure of period subdivisions and chronological terms in the three subject heading languages LCSH (Library of Congress Subject Headings), RAMEAU (Répertoire d'Autorité Matière Encyclopédique et Alphabétique Unifié), and RSWK (Regeln für den Schlagwortkatalog). Their usefulness in online searching is demonstrated using the online catalogs of the Library of Congress, the Bibliothèque nationale de France, and the Deutsche Bibliothek and is compared to the search options in selected digital encyclopedias (Encyclopaedia Britannica, Encarta, Brockhaus-Enzyklopädie). The author develops a model for common time retrieval across all three online catalogs, outlines the conditions for that model (time period code, chronological code, and chronology authority file), and proposes a search interface.

Date

10. 9.2000 17:38:22

0.05010998 = product of:
  0.07516497 = sum of:
    0.04648775 = weight(_text_:search in 3966) [ClassicSimilarity], result of:
      0.04648775 = score(doc=3966,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2660511 = fieldWeight in 3966, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=3966)
    0.028677218 = product of:
      0.057354435 = sum of:
        0.057354435 = weight(_text_:engines in 3966) [ClassicSimilarity], result of:
          0.057354435 = score(doc=3966,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.22454272 = fieldWeight in 3966, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, 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.

0.04626411 = product of:
  0.06939616 = sum of:
    0.03354964 = weight(_text_:search in 96) [ClassicSimilarity], result of:
      0.03354964 = score(doc=96,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.19200584 = fieldWeight in 96, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=96)
    0.03584652 = product of:
      0.07169304 = sum of:
        0.07169304 = weight(_text_:engines in 96) [ClassicSimilarity], result of:
          0.07169304 = score(doc=96,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.2806784 = fieldWeight in 96, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=96)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

0.04384623 = product of:
  0.065769345 = sum of:
    0.040676784 = weight(_text_:search in 97) [ClassicSimilarity], result of:
      0.040676784 = score(doc=97,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.23279473 = fieldWeight in 97, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.02734375 = fieldNorm(doc=97)
    0.025092565 = product of:
      0.05018513 = sum of:
        0.05018513 = weight(_text_:engines in 97) [ClassicSimilarity], result of:
          0.05018513 = score(doc=97,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.19647488 = fieldWeight in 97, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, 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.

0.03371857 = product of:
  0.050577857 = sum of:
    0.03354964 = weight(_text_:search in 2337) [ClassicSimilarity], result of:
      0.03354964 = score(doc=2337,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.19200584 = fieldWeight in 2337, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2337)
    0.017028214 = product of:
      0.03405643 = sum of:
        0.03405643 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
          0.03405643 = score(doc=2337,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.19345059 = fieldWeight in 2337, 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=2337)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Despite early claims to the contemporary, thesauri continue to find use as access tools for information in the full-text environment. Their mode of use is changing, but this change actually represents an expansion rather than a contrdiction of their utility. Thesauri and similar vocabulary tools can complement full-text access by aiding users in focusing their searches, by supplementing the linguistic analysis of the text search engine, and even by serving as one of the tools used by the linguistic engine for its analysis. While human indexing contunues to be used for many databases, the trend is to increase the use of machine aids for this purpose. All machine-aided indexing (MAI) systems rely on thesauri as the basis for term selection. In the 21st century, the balance of effort between human and machine will change at both input and output, but thesauri will continue to play an important role for the foreseeable future

Date

22. 9.1997 19:16:05

0.031313002 = product of:
  0.093939 = sum of:
    0.093939 = weight(_text_:search in 1401) [ClassicSimilarity], result of:
      0.093939 = score(doc=1401,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5376164 = fieldWeight in 1401, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.109375 = fieldNorm(doc=1401)
  0.33333334 = coord(1/3)

0.026839714 = product of:
  0.08051914 = sum of:
    0.08051914 = weight(_text_:search in 3807) [ClassicSimilarity], result of:
      0.08051914 = score(doc=3807,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.460814 = fieldWeight in 3807, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.09375 = fieldNorm(doc=3807)
  0.33333334 = coord(1/3)

0.025304725 = product of:
  0.075914174 = sum of:
    0.075914174 = weight(_text_:search in 5169) [ClassicSimilarity], result of:
      0.075914174 = score(doc=5169,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.43445963 = fieldWeight in 5169, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=5169)
  0.33333334 = coord(1/3)

Abstract

Open system protocols for search and retrieval have not provided explicit ways in which to implement thesaurus-aided searching. A number of different approaches within the existing protocols, as well as a proposed service, are evaluated. A general approach to implementing thesaurus-aided searching, particularly during consultation of a thesaurus, requires an entirely new service, whose main features are described

0.022141634 = product of:
  0.0664249 = sum of:
    0.0664249 = weight(_text_:search in 2007) [ClassicSimilarity], result of:
      0.0664249 = score(doc=2007,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.38015217 = fieldWeight in 2007, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2007)
  0.33333334 = coord(1/3)

Abstract

In their 2005 study, Gross and Taylor found that more than a third of records retrieved by keyword searches would be lost without subject headings. A review of the literature since then shows that numerous studies, in various disciplines, have found that a quarter to a third of records returned in a keyword search would be lost without controlled vocabulary. Other writers, though, have continued to suggest that controlled vocabulary be discontinued. Addressing criticisms of the Gross/Taylor study, this study replicates the search process in the same online catalog, but after the addition of automated enriched metadata such as tables of contents and summaries. The proportion of results that would be lost remains high.

0.019369897 = product of:
  0.058109686 = sum of:
    0.058109686 = weight(_text_:search in 2703) [ClassicSimilarity], result of:
      0.058109686 = score(doc=2703,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.33256388 = fieldWeight in 2703, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2703)
  0.33333334 = coord(1/3)

Abstract

When consumers search for health information, a major obstacle is their unfamiliarity with the medical terminology. Even though medical thesauri such as the Medical Subject Headings (MeSH) and related tools (e.g., the MeSH Browser) were created to help consumers find medical term definitions, the lack of direct and explicit integration of these help tools into a health retrieval system prevented them from effectively achieving their objectives. To explore this issue, we conducted an empirical study with two systems: One is a simple interface system supporting query-based searching; the other is an augmented system with two new components supporting MeSH term searching and MeSH tree browsing. A total of 45 subjects were recruited to participate in the study. The results indicated that the augmented system is more effective than the simple system in terms of improving user-perceived topic familiarity and question-answer performance, even though we did not find users spend more time on the augmented system. The two new MeSH help components played a critical role in participants' health information retrieval and were found to allow them to develop new search strategies. The findings of the study enhanced our understanding of consumers' search behaviors and shed light on the design of future health information retrieval systems.

0.019369897 = product of:
  0.058109686 = sum of:
    0.058109686 = weight(_text_:search in 5567) [ClassicSimilarity], result of:
      0.058109686 = score(doc=5567,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.33256388 = fieldWeight in 5567, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5567)
  0.33333334 = coord(1/3)

Abstract

Subject searching is difficult with traditional text-based online public access library catalogues (OPACs), and the next-generation discovery layers are keyword searching and result filtering tools that offer little support for subject browsing. Next-generation OPACs ignore the rich network of relations offered by controlled subject vocabulary, which can facilitate subject browsing. A new generation of OPACs could leverage existing information-organization investments and offer online searchers a novel browsing and searching environment. This is a case study of the design and development of a virtual reality subject browsing and information retrieval tool. The functional prototype shows that the Library of Congress subject headings (LCSH) can be shaped into a useful and usable tree structure serving as a visual metaphor that contains a real world collection from the domain of science and engineering. Formative tests show that users can effectively browse the LCSH tree and carve it up based on their keyword search queries. This study uses a complex information-organization structure as a defining characteristic of an OPAC that goes beyond the standard keyword search model, toward the cutting edge of online search tools.

0.018978544 = product of:
  0.056935627 = sum of:
    0.056935627 = weight(_text_:search in 3351) [ClassicSimilarity], result of:
      0.056935627 = score(doc=3351,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3258447 = fieldWeight in 3351, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=3351)
  0.33333334 = coord(1/3)

Abstract

Investigates the extent to which title keywords convey subject content and compares the relative effectiveness of searching title keywords using 2 search strategies to examine whether adjacency operators in title keyword searches are effective in improving recall and precision of online searching. Title keywords from a random sample of titles in the field of economics were searched on FirstSearch, using the WorldCat database, which is equivalent in coverage to the OCLC OLUC, with and without adjacency of the keywords specified. The LCSH of the items retrieved were compared with the sample title subject headings to determine the degree of match or relevance and the values for precision and recall were calculated. Results indicated that, when keywords were discipline specific, adjacency operators improved precision with little degradation of recall. Systems that allow positional operators or rank output by proximity of terms may increase search success

0.018505644 = product of:
  0.027758464 = sum of:
    0.013419856 = weight(_text_:search in 664) [ClassicSimilarity], result of:
      0.013419856 = score(doc=664,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.076802336 = fieldWeight in 664, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.015625 = fieldNorm(doc=664)
    0.014338609 = product of:
      0.028677218 = sum of:
        0.028677218 = weight(_text_:engines in 664) [ClassicSimilarity], result of:
          0.028677218 = score(doc=664,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.11227136 = fieldWeight in 664, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.015625 = fieldNorm(doc=664)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Footnote

Now BNI is beginning to use the new language, pointing the way for the adoption of Nuovo soggettario in Italian libraries: a difficult challenge whose success is not assured. To name only one issue: including all fields of study requires particular care in treating terms with different specialized meanings; cooperation of other libraries and institutions is foreseen. At the same time, efforts are being made to assure the system's interoperability outside the library world. It is clear that a great commitment is required. "Too complex a system!" say the naysayers. "Only at the beginning," the proponents reply. The new system goes against the mainstream, compared with the imitation of the easy way offered by search engines - but we know that they must enrich their devices to improve quality, just repeating the work on semantic and syntactic relationships that leads formal expressions to the meanings they are intended to communicate - and also compared with research to create automated devices supporting human work, for the need to simplify cataloguing. Here AI is not involved, but automation is widely used to facilitate and to support the conscious work of indexers guided by rules as clear as possible. The advantage of Nuovo soggettario is its combination of a thesaurus (a much-appreciated tool used across the world) with the equally widespread technique of subject-string construction, which is to say: the rational and predictable combination of the terms used. The appearance of this original, unparalleled working model may well be a great occasion in the international development of indexing, as, on one hand, the Nuovo soggettario uses a recognized tool (the thesaurus) and, on the other, by permitting both pre-coordination and post-coordination, it attempts to overcome the fragmentation of increasingly complex and specialized subjects into isolated, single-term descriptors. This is a serious proposition that merits consideration from both theoretical and practical points of view - and outside Italy, too."

0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 2642) [ClassicSimilarity], result of:
      0.053679425 = score(doc=2642,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 2642, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=2642)
  0.33333334 = coord(1/3)

Abstract

In online retrieval search results do not always match the intent in spite of using correct keywords (descriptors). One of the causes of this problem is found in the hierarchical structures of the thesaurus, which often contains relations between broader and narrower concepts, the opposite of which is not necessarily true. Some examples are described from 2 thesauri, MeSH and JICST. In these cases searchers need to make an effort to increase precision

0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 4549) [ClassicSimilarity], result of:
      0.053679425 = score(doc=4549,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 4549, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.03125 = fieldNorm(doc=4549)
  0.33333334 = coord(1/3)

Abstract

Purpose - This paper attempts to explain the wide dissemination of Library of Congress Subject Headings (LCSH) within digital libraries and presents some of the advantages and disadvantages of using this controlled vocabulary in digital collections. The paper also presents other classifications used in digital collections for subject access and explores ways of improving search functionality in digital collections that employ LCSH. Design/methodology/approach - Unlike traditional libraries that use Library of Congress Classification for organization and retrieval, digital libraries use metadata forms for organization and retrieval. The collections exist in cyberspace of the internet which is known for containing the universe of knowledge. The use of LCSH for information retrieval has been widely criticized for its difficulty of use and its information retrieval effectiveness in online environments. The Library of Congress (LOC) has claimed the headings were not based on comprehensive principles nor ever intended to cover the universe of knowledge. Despite these claims and criticisms, LCSH is the most popular choice for subject access in digital libraries. Findings - The number of digital collections increases every year and LCSH is still the most popular choice of controlled vocabulary for subject access. Of the numerous criticisms, difficulties of use and user unfamiliarity are the greatest disadvantages of using LCSH for subject access. Average users only have a vague notion of what they are looking for when initializing a search. More work is required in automated generation of subject headings and increased usage of LCSH in faceted search retrieval systems. This will provide users with better access to the LCSH used in the back end of information retrieval. Originality/value - The Greek researchers who developed the Dissertation DSPace system believe this type of module will eventually replace the traditional keyword-based indexing back ends employed by many information retrieval modules within current digital library systems. The system offers the type of access and interactivity that will acquaint users with how LCSH looks and is used. Faceted search and automated pattern matching using an ontology based on LCSH have the best promise of overcoming the disadvantages that have always plagued the LOC-controlled vocabulary. These retrieval techniques give LCSH an opportunity to finally achieve the optimal precision and recall it has so far failed to deliver.

0.015815454 = product of:
  0.04744636 = sum of:
    0.04744636 = weight(_text_:search in 2918) [ClassicSimilarity], result of:
      0.04744636 = score(doc=2918,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.27153727 = fieldWeight in 2918, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2918)
  0.33333334 = coord(1/3)

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.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 2640) [ClassicSimilarity], result of:
      0.0469695 = score(doc=2640,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 2640, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2640)
  0.33333334 = coord(1/3)

Abstract

For many years, searching medical and health-related topics has caused thousands of searchers to consult the well-known Medical Subject Headings (MeSH) controlled vocabulary. This plan works well for searching MEDLINE, but what about the MEDLARS databases such as TOXLIT, BIOETHICSLINE and POPLINE? Several printed vocabularies are available for searchers who wish to benefit from the consistency afforded by consulting established term lists. Occasionally, use of keywords from vocabularies other than MeSH is recommended even when information in the database is also indexed to MeSH. Search techniques available for use with several of the controlled vocabularies which are discussed vary, but built-in consistency of term use is a continuing theme from one controlled vocabulary to another

0.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 2775) [ClassicSimilarity], result of:
      0.0469695 = score(doc=2775,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 2775, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2775)
  0.33333334 = coord(1/3)

Abstract

Browse searching of online catalogs and electronic indexes is a popular means of retrieving information, but some subject heading lists are so extensive that browsing them can be difficult and time-consuming. This resaerch tested one way of presenting a browse interface to reduce the amount of scanning of subject headings required. It found that a hierarchical presentation of headings reduced the amount of scanning required by more than 50% without any reduction in the effectiveness of the search. Better browsable displays of this sort can improve the efficiency of searching but appear not to alter effectivenenss

0.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 1177) [ClassicSimilarity], result of:
      0.0469695 = score(doc=1177,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 1177, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1177)
  0.33333334 = coord(1/3)

Abstract

The Michigan State University Libraries (MSUL) digital repository contains numerous collections of openly available material. Since 2016, the digital repository has been using Faceted Application of Subject Terminology (FAST) subject headings as its primary subject vocabulary in order to streamline faceting, display, and search. The MSUL FAST use case presents some challenges that are not addressed by existing MARC-focused FAST tools. This paper will outline the MSUL digital repository team's justification for including FAST headings in the digital repository as well as workflows for adding FAST headings to Metadata Object Description Schema (MODS) metadata, their maintenance, and utilization for discovery.