Search (11 results, page 1 of 1)

0.065327495 = product of:
  0.09799124 = sum of:
    0.022522911 = weight(_text_:im in 5825) [ClassicSimilarity], result of:
      0.022522911 = score(doc=5825,freq=2.0), product of:
        0.1442303 = queryWeight, product of:
          2.8267863 = idf(docFreq=7115, maxDocs=44218)
          0.051022716 = queryNorm
        0.15615936 = fieldWeight in 5825, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.8267863 = idf(docFreq=7115, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5825)
    0.07546833 = product of:
      0.11320249 = sum of:
        0.04496643 = weight(_text_:online in 5825) [ClassicSimilarity], result of:
          0.04496643 = score(doc=5825,freq=6.0), product of:
            0.1548489 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.051022716 = queryNorm
            0.29038906 = fieldWeight in 5825, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5825)
        0.06823606 = weight(_text_:retrieval in 5825) [ClassicSimilarity], result of:
          0.06823606 = score(doc=5825,freq=14.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.442117 = fieldWeight in 5825, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5825)
      0.6666667 = coord(2/3)
  0.6666667 = coord(2/3)

Abstract

The study of faceted classification systems has primarily been directed towards application for precombined catalogues or bibliographies, not so much for use in post coordinated retrieval systems. Argues that faceted classification systems in some respects are superior to other techniques of on-line retrieval as far as facet and concept analysis is combined with an expressive notational system in order to guide a form of retrieval which will use Boolean operators (for combining the facets regardless of one special citation order) and truncation for retrieving hierarchically different sets of documents. This point of view is demonstrated by 2 examples. The 1st one uses a short classification system derived from B. Buchanan and the 2nd is built upon the classification system used by Library and Information Science Abstracts (LISA). Further discussion is concerned with some possible consequences which could be derived from a retrieval with PRECIS strings
"Online retrieval" conjures up a very different mental image now than in 1991, the year this article was written, and the year Tim Berners-Lee first revealed the new hypertext system he called the World Wide Web. Gödert shows that truncation and Boolean logic, combined with notation from a faceted classification system, will be a powerful way of searching for information. It undoubtedly is, but no system built now would require a user searching for material on "nervous systems of bone fish" to enter "Fdd$ and Leaa$". This is worth reading for someone interested in seeing how searching and facets can go together, but the web has made this article quite out of date.

Theme

Klassifikationssysteme im Online-Retrieval

0.027413448 = product of:
  0.08224034 = sum of:
    0.08224034 = product of:
      0.123360515 = sum of:
        0.081883274 = weight(_text_:retrieval in 987) [ClassicSimilarity], result of:
          0.081883274 = score(doc=987,freq=14.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.5305404 = fieldWeight in 987, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=987)
        0.04147724 = weight(_text_:22 in 987) [ClassicSimilarity], result of:
          0.04147724 = score(doc=987,freq=2.0), product of:
            0.17867287 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051022716 = queryNorm
            0.23214069 = fieldWeight in 987, 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=987)
      0.6666667 = coord(2/3)
  0.33333334 = coord(1/3)

Content

Introduction: envisioning semantic information spacesIndexing and knowledge organization -- Semantic technologies for knowledge representation -- Information retrieval and knowledge exploration -- Approaches to handle heterogeneity -- Problems with establishing semantic interoperability -- Formalization in indexing languages -- Typification of semantic relations -- Inferences in retrieval processes -- Semantic interoperability and inferences -- Remaining research questions.

Date

23. 7.2017 13:49:22

LCSH

Information retrieval

RSWK

Information Retrieval

Subject

Information retrieval
Information Retrieval

0.021702915 = product of:
  0.06510875 = sum of:
    0.06510875 = product of:
      0.09766311 = sum of:
        0.04405792 = weight(_text_:online in 5830) [ClassicSimilarity], result of:
          0.04405792 = score(doc=5830,freq=4.0), product of:
            0.1548489 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.051022716 = queryNorm
            0.284522 = fieldWeight in 5830, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.046875 = fieldNorm(doc=5830)
        0.05360519 = weight(_text_:retrieval in 5830) [ClassicSimilarity], result of:
          0.05360519 = score(doc=5830,freq=6.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.34732026 = fieldWeight in 5830, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=5830)
      0.6666667 = coord(2/3)
  0.33333334 = coord(1/3)

Abstract

Experiences with retrieval in OPACs suggest that there are major problems for the users of such systems, such as choosing the 'correct' subject access vocabulary, narrowing or broadening the set of items retrieved regarding the search interest. Such problems relate to two facts: (1) that in the early OPACs subject access has not been considered seriously enough and (2) that the complexity of the topic has not been really recognized. Using a typology of users' questions it is demonstrated which requirements musts be met by a successful online subject access. Improvements of subject access tools are primarily aimed at, pinpointing the interplay between the different subcomponents of any subject facility: a) the features of the indexing languages used; b) the indexing principles used; c) the design and structuring of the database; and d) the possibilities of the technical retrieval facility, the search mode, and query languages. The contribution summarizes the manifold interactions between the four subcomponents listed. Any successful retrieval will heavily depend on the design of these components considering their interactions.

0.018400777 = product of:
  0.05520233 = sum of:
    0.05520233 = product of:
      0.082803495 = sum of:
        0.0415382 = weight(_text_:online in 5140) [ClassicSimilarity], result of:
          0.0415382 = score(doc=5140,freq=2.0), product of:
            0.1548489 = queryWeight, product of:
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.051022716 = queryNorm
            0.2682499 = fieldWeight in 5140, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.0349014 = idf(docFreq=5778, maxDocs=44218)
              0.0625 = fieldNorm(doc=5140)
        0.041265294 = weight(_text_:retrieval in 5140) [ClassicSimilarity], result of:
          0.041265294 = score(doc=5140,freq=2.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.26736724 = fieldWeight in 5140, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=5140)
      0.6666667 = coord(2/3)
  0.33333334 = coord(1/3)

Abstract

The research, investigating experiences of users with subject searching of on-line public access catalogues (OPACs), stresses that there is an interaction between: features of the indexing languages used; indexing principles used; design and structure of the data base; and the possiblities of the technical retrieval faculty, search mode and query language used

0.010252445 = product of:
  0.030757334 = sum of:
    0.030757334 = product of:
      0.092272 = sum of:
        0.092272 = weight(_text_:retrieval in 1510) [ClassicSimilarity], result of:
          0.092272 = score(doc=1510,freq=10.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.59785134 = fieldWeight in 1510, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=1510)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Starting from an unsolved problem of information retrieval this paper presents an ontology-based model for indexing and retrieval. The model combines the methods and experiences of cognitive-to-interpret indexing languages with the strengths and possibilities of formal knowledge representation. The core component of the model uses inferences along the paths of typed relations between the entities of a knowledge representation for enabling the determination of hit quantities in the context of retrieval processes. The entities are arranged in aspect-oriented facets to ensure a consistent hierarchical structure. The possible consequences for indexing and retrieval are discussed.

0.008023808 = product of:
  0.024071421 = sum of:
    0.024071421 = product of:
      0.07221426 = sum of:
        0.07221426 = weight(_text_:retrieval in 2777) [ClassicSimilarity], result of:
          0.07221426 = score(doc=2777,freq=8.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.46789268 = fieldWeight in 2777, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2777)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

The presented ontology-based model for indexing and retrieval combines the methods and experiences of traditional indexing languages with their cognitively interpreted entities and relationships with the strengths and possibilities of formal knowledge representation. The core component of the model uses inferences along the paths of typed relations between the entities of a knowledge representation for enabling the determination of result sets in the context of retrieval processes. A proposal for a general, but condensed, inventory of typed relations is given. The entities are arranged in aspect-oriented facets to ensure a consistent hierarchical structure. The possible consequences for indexing and retrieval are discussed.

0.00794151 = product of:
  0.023824528 = sum of:
    0.023824528 = product of:
      0.07147358 = sum of:
        0.07147358 = weight(_text_:retrieval in 3362) [ClassicSimilarity], result of:
          0.07147358 = score(doc=3362,freq=6.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.46309367 = fieldWeight in 3362, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=3362)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

This paper presents a new approach to understanding how indexing strategies, models for interoperability and retrieval paradigms interact in information systems and how this can be used to support the design and implementation of components of a semantic navigation for information retrieval systems.

0.005673688 = product of:
  0.017021064 = sum of:
    0.017021064 = product of:
      0.05106319 = sum of:
        0.05106319 = weight(_text_:retrieval in 3413) [ClassicSimilarity], result of:
          0.05106319 = score(doc=3413,freq=4.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.33085006 = fieldWeight in 3413, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3413)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

A survey is given, how modifications in the field of the information processing and technology have influenced the concepts for teaching and studying the subjects of knowledge organization and information retrieval in German universities for library and information science. The discussion will distinguish between fields of modifications and fields of stability. The fields of the modifications are characterised by procedures and applications in libraries. The fields of stability are characterised by theory and methods

0.005673688 = product of:
  0.017021064 = sum of:
    0.017021064 = product of:
      0.05106319 = sum of:
        0.05106319 = weight(_text_:retrieval in 1565) [ClassicSimilarity], result of:
          0.05106319 = score(doc=1565,freq=4.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.33085006 = fieldWeight in 1565, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1565)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Faceted arrangement of entities and typed relations for representing different associations between the entities are established tools in knowledge representation. In this paper, a proposal is being discussed combining both tools to draw inferences along relational paths. This approach may yield new benefit for information retrieval processes, especially when modeled for heterogeneous environments in the Semantic Web. Faceted arrangement can be used as a selection tool for the semantic knowledge modeled within the knowledge representation. Typed relations between the entities of different facets can be used as restrictions for selecting them across the facets.

0.005673688 = product of:
  0.017021064 = sum of:
    0.017021064 = product of:
      0.05106319 = sum of:
        0.05106319 = weight(_text_:retrieval in 3816) [ClassicSimilarity], result of:
          0.05106319 = score(doc=3816,freq=4.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.33085006 = fieldWeight in 3816, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3816)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

Faceted arrangement of entities and typed relations for representing different associations between the entities are established tools in knowledge representation. In this paper, a proposal is being discussed combining both tools to draw inferences along relational paths. This approach may yield new benefit for information retrieval processes, especially when modeled for heterogeneous environments in the Semantic Web. Faceted arrangement can be used as a selection tool for the semantic knowledge modeled within the knowledge representation. Typed relations between the entities of different facets can be used as restrictions for selecting them across the facets.

0.004585033 = product of:
  0.013755098 = sum of:
    0.013755098 = product of:
      0.041265294 = sum of:
        0.041265294 = weight(_text_:retrieval in 466) [ClassicSimilarity], result of:
          0.041265294 = score(doc=466,freq=2.0), product of:
            0.15433937 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.051022716 = queryNorm
            0.26736724 = fieldWeight in 466, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=466)
      0.33333334 = coord(1/3)
  0.33333334 = coord(1/3)

Abstract

We present an approach for detecting multiword phrases in mathematical text corpora. The method used is based on characteristic features of mathematical terminology. It makes use of a software tool named Lingo which allows to identify words by means of previously defined dictionaries for specific word classes as adjectives, personal names or nouns. The detection of multiword groups is done algorithmically. Possible advantages of the method for indexing and information retrieval and conclusions for applying dictionary-based methods of automatic indexing instead of stemming procedures are discussed.