Search (9 results, page 1 of 1)

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

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

Abstract

To make better use of knowledge organization systems (KOS) for query expansion, we have developed a pattern-based technique for composition ontology mapping in a specific domain. The technique was tested in a two-step mapping. The user's free-text queries were first mapped to Getty's Art & Architecture Thesaurus (AAT) terms. The AAT-based queries were then mapped to a search engine's indexing vocabulary (ARTstor terms). The result indicated that our technique has improved the mapping success rate from 40% to 70%. We discuss also how the technique may be applied to other KOS mapping and how it may be implemented in practical systems.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.038350433 = product of:
  0.1150513 = sum of:
    0.1150513 = weight(_text_:search in 6687) [ClassicSimilarity], result of:
      0.1150513 = score(doc=6687,freq=12.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.65844285 = fieldWeight in 6687, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6687)
  0.33333334 = coord(1/3)

Abstract

MedLine Search Assistant is a new interface for MEDLINE searching. The interface is designed to (1) visualize boolean query building process, (2) extract descriptors (MeSH terms) automatically from the retrieved documents and list them in the order of their occurrence frequencies, (3) guide the user's query modification process through the display of the number of hits, and (4) allow the user to "pick-and-choose" from a list of related MeSH terms to construct search queries. MedLine Search Assistant improves both search precision and recall by helping the user convert a free text search to a controlled vocabulary-based search in a visual environment

0.023594987 = product of:
  0.070784956 = sum of:
    0.070784956 = product of:
      0.14156991 = sum of:
        0.14156991 = weight(_text_:22 in 1339) [ClassicSimilarity], result of:
          0.14156991 = score(doc=1339,freq=6.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.804159 = fieldWeight in 1339, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=1339)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 2.2003 17:25:39
22. 2.2003 18:16:22

0.022141634 = product of:
  0.0664249 = sum of:
    0.0664249 = weight(_text_:search in 4350) [ClassicSimilarity], result of:
      0.0664249 = score(doc=4350,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.38015217 = fieldWeight in 4350, 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=4350)
  0.33333334 = coord(1/3)

Abstract

Reports progress and future plans for a project to study the interactions of users with information retrieval interfaces. Tests are run with professional data base searchers and with end users who are members of a profession but have little or no searching experience. Interfaces tested include a command language search system used to search DIALOG bibliographic data bases, a non-procedural system that produces DIALOG commands, and several full text systems, including one using hypertext. The intent is to determine which kinds of users perform best with each type of interface. The project is being conducted jointly bay the University of Toronto and the University of Maryland

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

Abstract

Compares 3 different map displays generated from the same set of documents by either a self-organizing algorithm or human subjects. Aims to: evaluate usefulness of map displays for information seeking and observe how people search and browse on them and to compare their structural and visual features. 68 subjects were randomly assigned to 3 selected map displays. They were asked to perform simple retrieval tasks, and their performances were analyzed. Both the organization and the visual appearance of displays had significant effects on subjects' searching and browsing on the map displays

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

Abstract

Purpose - The purpose of this paper is to describe a new approach to a well-known problem for digital libraries, how to search across multiple unrelated libraries with a single query. Design/methodology/approach - The approach involves creating new Dewey Decimal Classification terms and numbers from existing Dublin Core records. In total, 263,550 records were harvested from three digital libraries. Weighted key terms were extracted from the title, description and subject fields of each record. Ranked DDC classes were automatically generated from these key terms by considering DDC hierarchies via a series of filtering and aggregation stages. A mean reciprocal ranking evaluation compared a sample of 49 generated classes against DDC classes created by a trained librarian for the same records. Findings - The best results combined weighted key terms from the title, description and subject fields. Performance declines with increased specificity of DDC level. The results compare favorably with similar studies. Research limitations/implications - The metadata harvest required manual intervention and the evaluation was resource intensive. Future research will look at evaluation methodologies that take account of issues of consistency and ecological validity. Practical implications - The method does not require training data and is easily scalable. The pipeline can be customized for individual use cases, for example, recall or precision enhancing. Social implications - The approach can provide centralized access to information from multiple domains currently provided by individual digital libraries. Originality/value - The approach addresses metadata normalization in the context of web resources. The automatic classification approach accounts for matches within hierarchies, aggregating lower level matches to broader parents and thus approximates the practices of a human cataloger.

0.007946501 = product of:
  0.0238395 = sum of:
    0.0238395 = product of:
      0.047679 = sum of:
        0.047679 = weight(_text_:22 in 2635) [ClassicSimilarity], result of:
          0.047679 = score(doc=2635,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.2708308 = fieldWeight in 2635, 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=2635)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas

0.006421742 = product of:
  0.019265225 = sum of:
    0.019265225 = product of:
      0.03853045 = sum of:
        0.03853045 = weight(_text_:22 in 2654) [ClassicSimilarity], result of:
          0.03853045 = score(doc=2654,freq=4.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.21886435 = fieldWeight in 2654, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2654)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

In order to transfer the Chinese Classified Thesaurus (CCT) into a machine-processable format and provide CCT-based Web services, a pilot study has been conducted in which a variety of selected CCT classes and mapped thesaurus entries are encoded with SKOS. OWL and RDFS are also used to encode the same contents for the purposes of feasibility and cost-benefit comparison. CCT is a collected effort led by the National Library of China. It is an integration of the national standards Chinese Library Classification (CLC) 4th edition and Chinese Thesaurus (CT). As a manually created mapping product, CCT provides for each of the classes the corresponding thesaurus terms, and vice versa. The coverage of CCT includes four major clusters: philosophy, social sciences and humanities, natural sciences and technologies, and general works. There are 22 main-classes, 52,992 sub-classes and divisions, 110,837 preferred thesaurus terms, 35,690 entry terms (non-preferred terms), and 59,738 pre-coordinated headings (Chinese Classified Thesaurus, 2005) Major challenges of encoding this large vocabulary comes from its integrated structure. CCT is a result of the combination of two structures (illustrated in Figure 1): a thesaurus that uses ISO-2788 standardized structure and a classification scheme that is basically enumerative, but provides some flexibility for several kinds of synthetic mechanisms Other challenges include the complex relationships caused by differences of granularities of two original schemes and their presentation with various levels of SKOS elements; as well as the diverse coordination of entries due to the use of auxiliary tables and pre-coordinated headings derived from combining classes, subdivisions, and thesaurus terms, which do not correspond to existing unique identifiers. The poster reports the progress, shares the sample SKOS entries, and summarizes problems identified during the SKOS encoding process. Although OWL Lite and OWL Full provide richer expressiveness, the cost-benefit issues and the final purposes of encoding CCT raise questions of using such approaches.

Source

Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas