Search (3 results, page 1 of 1)

Järvelin, K.; Vakkari, P.: ¬The evolution of library and information science 1965-1985 : a content analysis of journal titles (1993) 0.01

0.0058892816 = product of:
  0.023557127 = sum of:
    0.023557127 = weight(_text_:information in 4649) [ClassicSimilarity], result of:
      0.023557127 = score(doc=4649,freq=4.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.3840108 = fieldWeight in 4649, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=4649)
  0.25 = coord(1/4)

Source: Information processing and management. 29(1993) no.1, S.129-144

Järvelin, K.; Niemi, T.: Deductive information retrieval based on classifications (1993) 0.00
```
0.0035694437 = product of:
  0.014277775 = sum of:
    0.014277775 = weight(_text_:information in 2229) [ClassicSimilarity], result of:
      0.014277775 = score(doc=2229,freq=8.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.23274569 = fieldWeight in 2229, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2229)
  0.25 = coord(1/4)
```
Abstract

Modern fact databses contain abundant data classified through several classifications. Typically, users msut consult these classifications in separate manuals or files, thus making their effective use difficult. Contemporary database systems do little support deductive use of classifications. In this study we show how deductive data management techniques can be applied to the utilization of data value classifications. Computation of transitive class relationships is of primary importance here. We define a representation of classifications which supports transitive computation and present an operation-oriented deductive query language tailored for classification-based deductive information retrieval. The operations of this language are on the same abstraction level as relational algebra operations and can be integrated with these to form a powerful and flexible query language for deductive information retrieval. We define the integration of these operations and demonstrate the usefulness of the language in terms of several sample queries

Source

Journal of the American Society for Information Science. 44(1993) no.10, S.557-578

Järvelin, K.; Kristensen, J.; Niemi, T.; Sormunen, E.; Keskustalo, H.: ¬A deductive data model for query expansion (1996) 0.00

0.0017847219 = product of:
  0.0071388874 = sum of:
    0.0071388874 = weight(_text_:information in 2230) [ClassicSimilarity], result of:
      0.0071388874 = score(doc=2230,freq=2.0), product of:
        0.06134496 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.034944877 = queryNorm
        0.116372846 = fieldWeight in 2230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2230)
  0.25 = coord(1/4)

Source: Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (ACM SIGIR '96), Zürich, Switzerland, August 18-22, 1996. Eds.: H.P. Frei et al

Search (3 results, page 1 of 1)

Authors

Themes