Search (7 results, page 1 of 1)

0.023416823 = product of:
  0.035125233 = sum of:
    0.01235367 = weight(_text_:information in 2687) [ClassicSimilarity], result of:
      0.01235367 = score(doc=2687,freq=2.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.13576832 = fieldWeight in 2687, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2687)
    0.022771563 = product of:
      0.045543127 = sum of:
        0.045543127 = weight(_text_:management in 2687) [ClassicSimilarity], result of:
          0.045543127 = score(doc=2687,freq=2.0), product of:
            0.17470726 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0518325 = queryNorm
            0.2606825 = fieldWeight in 2687, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2687)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Source

Information processing and management. 51(2015) no.1, S.179-193

0.007590521 = product of:
  0.022771563 = sum of:
    0.022771563 = product of:
      0.045543127 = sum of:
        0.045543127 = weight(_text_:management in 5181) [ClassicSimilarity], result of:
          0.045543127 = score(doc=5181,freq=2.0), product of:
            0.17470726 = queryWeight, product of:
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0518325 = queryNorm
            0.2606825 = fieldWeight in 5181, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3706124 = idf(docFreq=4130, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5181)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

New review of document and text management. 1995, no.1, S.63-83

0.0065770587 = product of:
  0.019731175 = sum of:
    0.019731175 = weight(_text_:information in 1338) [ClassicSimilarity], result of:
      0.019731175 = score(doc=1338,freq=10.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.21684799 = fieldWeight in 1338, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
  0.33333334 = coord(1/3)

Abstract

A user's query is considered to be an imprecise description of their information need. Automatic query expansion is the process of reformulating the original query with the goal of improving retrieval effectiveness. Many successful query expansion techniques model syntagmatic associations that infer two terms co-occur more often than by chance in natural language. However, structural linguistics relies on both syntagmatic and paradigmatic associations to deduce the meaning of a word. Given the success of dependency-based approaches to query expansion and the reliance on word meanings in the query formulation process, we argue that modeling both syntagmatic and paradigmatic information in the query expansion process improves retrieval effectiveness. This article develops and evaluates a new query expansion technique that is based on a formal, corpus-based model of word meaning that models syntagmatic and paradigmatic associations. We demonstrate that when sufficient statistical information exists, as in the case of longer queries, including paradigmatic information alone provides significant improvements in retrieval effectiveness across a wide variety of data sets. More generally, when our new query expansion approach is applied to large-scale web retrieval it demonstrates significant improvements in retrieval effectiveness over a strong baseline system, based on a commercial search engine.

Source

Journal of the Association for Information Science and Technology. 65(2014) no.8, S.1577-1596

0.0058827 = product of:
  0.017648099 = sum of:
    0.017648099 = weight(_text_:information in 591) [ClassicSimilarity], result of:
      0.017648099 = score(doc=591,freq=8.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.19395474 = fieldWeight in 591, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=591)
  0.33333334 = coord(1/3)

Abstract

In contemporary query languages, the user is responsible for navigation among semantically related data. Because of the huge amount of data and the complex structural relationships among data in modern applications, it is unrealistic to suppose that the user could know completely the content and structure of the available information. There are several query languages whose purpose is to facilitate navigation in unknown structures of databases. However, the background assumption of these languages is that the user knows how data are related to each other semantically in the structure at hand. So far only little attention has been paid to how unknown semantic associations among available data can be discovered. We address this problem in this article. A semantic association between two entities can be constructed if a sequence of relationships expressed explicitly in a database can be found that connects these entities to each other. This sequence may contain several other entities through which the original entities are connected to each other indirectly. We introduce an expressive and declarative query language for discovering semantic associations. Our query language is able, for example, to discover semantic associations between entities for which only some of the characteristics are known. Further, it integrates the manipulation of semantic associations with the manipulation of documents that may contain information on entities in semantic associations.

Content

Part II: Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1686-1700.

Source

Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1559-1568

0.0050945682 = product of:
  0.015283704 = sum of:
    0.015283704 = weight(_text_:information in 580) [ClassicSimilarity], result of:
      0.015283704 = score(doc=580,freq=6.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.16796975 = fieldWeight in 580, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=580)
  0.33333334 = coord(1/3)

Abstract

In our query language introduced in Part I (Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1559-1568) the user can formulate queries to find out (possibly complex) semantic relationships among entities. In this article we demonstrate the usage of our query language and discuss the new applications that it supports. We categorize several query types and give sample queries. The query types are categorized based on whether the entities specified in a query are known or unknown to the user in advance, and whether text information in documents is utilized. Natural language is used to represent the results of queries in order to facilitate correct interpretation by the user. We discuss briefly the issues related to the prototype implementation of the query language and show that an independent operation like Rho (Sheth et al., 2005; Anyanwu & Sheth, 2002, 2003), which presupposes entities of interest to be known in advance, is exceedingly inefficient in emulating the behavior of our query language. The discussion also covers potential problems, and challenges for future work.

Source

Journal of the American Society for Information Science and Technology. 58(2007) no.11, S.1686-1700

0.004159697 = product of:
  0.01247909 = sum of:
    0.01247909 = weight(_text_:information in 3223) [ClassicSimilarity], result of:
      0.01247909 = score(doc=3223,freq=4.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.13714671 = fieldWeight in 3223, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3223)
  0.33333334 = coord(1/3)

Source

Journal of the Association for Information Science and Technology. 67(2016) no.12, S.2928-2946

0.00294135 = product of:
  0.0088240495 = sum of:
    0.0088240495 = weight(_text_:information in 566) [ClassicSimilarity], result of:
      0.0088240495 = score(doc=566,freq=2.0), product of:
        0.09099081 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0518325 = queryNorm
        0.09697737 = fieldWeight in 566, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=566)
  0.33333334 = coord(1/3)

Source

Wa(h)re Information: 29. Österreichischer Bibliothekartag Bregenz, 19.-23.9.2006. Hrsg.: Harald Weigel