Search (27 results, page 1 of 2)

  • × author_ss:"Savoy, J."
  1. Savoy, J.; Ndarugendamwo, M.; Vrajitoru, D.: Report on the TREC-4 experiment : combining probabilistic and vector-space schemes (1996) 0.03 
    0.033194643 = product of:
  0.13277857 = sum of:
    0.13277857 = weight(_text_:standards in 7574) [ClassicSimilarity], result of:
      0.13277857 = score(doc=7574,freq=2.0), product of:
        0.22470023 = queryWeight, product of:
          4.4569545 = idf(docFreq=1393, maxDocs=44218)
          0.050415643 = queryNorm
        0.59091425 = fieldWeight in 7574, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4569545 = idf(docFreq=1393, maxDocs=44218)
          0.09375 = fieldNorm(doc=7574)
  0.25 = coord(1/4)
    Imprint
    Gaithersburgh, MD : National Institute of Standards and Technology
  2. Savoy, J.; Calvé, A. le; Vrajitoru, D.: Report on the TREC5 experiment : data fusion and collection fusion (1997) 0.03 
    0.033194643 = product of:
  0.13277857 = sum of:
    0.13277857 = weight(_text_:standards in 3108) [ClassicSimilarity], result of:
      0.13277857 = score(doc=3108,freq=2.0), product of:
        0.22470023 = queryWeight, product of:
          4.4569545 = idf(docFreq=1393, maxDocs=44218)
          0.050415643 = queryNorm
        0.59091425 = fieldWeight in 3108, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4569545 = idf(docFreq=1393, maxDocs=44218)
          0.09375 = fieldNorm(doc=3108)
  0.25 = coord(1/4)
    Imprint
    Gaithersburgh, MD : National Institute of Standards and Technology
  3. Savoy, J.: Ranking schemes in hybrid Boolean systems : a new approach (1997) 0.02 
    0.017903835 = product of:
  0.03580767 = sum of:
    0.014565565 = weight(_text_:information in 393) [ClassicSimilarity], result of:
      0.014565565 = score(doc=393,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 393, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=393)
    0.021242103 = product of:
      0.042484205 = sum of:
        0.042484205 = weight(_text_:organization in 393) [ClassicSimilarity], result of:
          0.042484205 = score(doc=393,freq=2.0), product of:
            0.17974974 = queryWeight, product of:
              3.5653565 = idf(docFreq=3399, maxDocs=44218)
              0.050415643 = queryNorm
            0.23635197 = fieldWeight in 393, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5653565 = idf(docFreq=3399, maxDocs=44218)
              0.046875 = fieldNorm(doc=393)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    In most commercial online systems, the retrieval system is based on the Boolean model and its inverted file organization. Since the investment in these systems is so great and changing them could be economically unfeasible, this article suggests a new ranking scheme especially adapted for hypertext environments in order to produce more effective retrieval results and yet maintain the effectiveness of the investment made to date in the Boolean model. To select the retrieved documents, the suggested ranking strategy uses multiple sources of document content evidence. The proposed scheme integrates both the information provided by the index and query terms, and the inherent relationships between documents such as bibliographic references or hypertext links. We will demonstrate that our scheme represents an integration of both subject and citation indexing, and results in a significant imporvement over classical ranking schemes uses in hybrid Boolean systems, while preserving its efficiency. Moreover, through knowing the nearest neighbor and the hypertext links which constitute additional sources of evidence, our strategy will take them into account in order to further improve retrieval effectiveness and to provide 'good' starting points for browsing in a hypertext or hypermedia environement
    Source
    Journal of the American Society for Information Science. 48(1997) no.3, S.235-253
  4. Savoy, J.: Estimating the probability of an authorship attribution (2016) 0.01 
    0.0128297005 = product of:
  0.025659401 = sum of:
    0.008582841 = weight(_text_:information in 2937) [ClassicSimilarity], result of:
      0.008582841 = score(doc=2937,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.09697737 = fieldWeight in 2937, 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=2937)
    0.01707656 = product of:
      0.03415312 = sum of:
        0.03415312 = weight(_text_:22 in 2937) [ClassicSimilarity], result of:
          0.03415312 = score(doc=2937,freq=2.0), product of:
            0.17654699 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050415643 = queryNorm
            0.19345059 = fieldWeight in 2937, 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=2937)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Date
    7. 5.2016 21:22:27
    Source
    Journal of the Association for Information Science and Technology. 67(2016) no.6, S.1462-1472
  5. Savoy, J.: Stemming of French words based on grammatical categories (1993) 0.01 
    0.006866273 = product of:
  0.027465092 = sum of:
    0.027465092 = weight(_text_:information in 4650) [ClassicSimilarity], result of:
      0.027465092 = score(doc=4650,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.3103276 = fieldWeight in 4650, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=4650)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 44(1993) no.1, S.1-9
  6. Savoy, J.: Bayesian inference networks and spreading activation in hypertext systems (1992) 0.01 
    0.006866273 = product of:
  0.027465092 = sum of:
    0.027465092 = weight(_text_:information in 192) [ClassicSimilarity], result of:
      0.027465092 = score(doc=192,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.3103276 = fieldWeight in 192, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.125 = fieldNorm(doc=192)
  0.25 = coord(1/4)
    Source
    Information processing and management. 28(1992), S.389-405
  7. Savoy, J.: ¬An extended vector-processing scheme for searching information in hypertext systems (1996) 0.01 
    0.0064371303 = product of:
  0.025748521 = sum of:
    0.025748521 = weight(_text_:information in 4036) [ClassicSimilarity], result of:
      0.025748521 = score(doc=4036,freq=18.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.2909321 = fieldWeight in 4036, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4036)
  0.25 = coord(1/4)
    Abstract
    When searching information in a hypertext is limited to navigation, it is not an easy task, especially when the number of nodes and/or links becomes very large. A query based access mechanism must therefore be provided to complement the navigational tools inherent in hypertext systems. Most mechanisms currently proposed are based on conventional information retrieval models which consider documents as indepent entities, and ignore hypertext links. To promote the use of other information retrieval mechnaisms adapted to hypertext systems, responds to the following questions; how can we integrate information given by hypertext links into an information retrieval scheme; are these hypertext links (and link semantics) clues to the enhancement of retrieval effectiveness; if so, how can we use them. 2 solutions are: using a default weight function based on link tape or assigning the same strength to all link types; or using a specific weight for each particular link, i.e. the level of association or a similarity measure. Proposes an extended vector processing scheme which extracts additional information from hypertext links to enhance retrieval effectiveness. A hypertext based on 2 medium size collections, the CACM and the CISI collection has been built. The hypergraph is composed of explicit links (bibliographic references), computed links based on bibliographic information, or on hypertext links established according to document representatives (nearest neighbour)
    Source
    Information processing and management. 32(1996) no.2, S.155-170
  8. Savoy, J.; Picard, J.: Retrieval effectiveness on the web (2001) 0.01 
    0.006007989 = product of:
  0.024031956 = sum of:
    0.024031956 = weight(_text_:information in 775) [ClassicSimilarity], result of:
      0.024031956 = score(doc=775,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.27153665 = fieldWeight in 775, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=775)
  0.25 = coord(1/4)
    Source
    Information processing and management. 37(2001) no.4, S.543-569
  9. Savoy, J.: Searching information in legal hypertext systems (1993/94) 0.01 
    0.005946367 = product of:
  0.023785468 = sum of:
    0.023785468 = weight(_text_:information in 757) [ClassicSimilarity], result of:
      0.023785468 = score(doc=757,freq=6.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.2687516 = fieldWeight in 757, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=757)
  0.25 = coord(1/4)
    Abstract
    Hypertext may represent a new paradigm capable of exploring legal sources within which links are established according to pertinent relationships found between statute texts and case law. However, to discover relvant information in such a network, a browsing mechanism is not enough when faced with a large column of texts. Describes a new retrieval model where documents are represented according to both their content and relationship with other sources of information
  10. Savoy, J.: ¬A stemming procedure and stopword list for general French Corpora (1999) 0.01 
    0.005149705 = product of:
  0.02059882 = sum of:
    0.02059882 = weight(_text_:information in 4314) [ClassicSimilarity], result of:
      0.02059882 = score(doc=4314,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.23274569 = fieldWeight in 4314, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=4314)
  0.25 = coord(1/4)
    Source
    Journal of the American Society for Information Science. 50(1999) no.10, S.944-954
  11. Savoy, J.; Desbois, D.: Information retrieval in hypertext systems (1991) 0.00 
    0.004855188 = product of:
  0.019420752 = sum of:
    0.019420752 = weight(_text_:information in 4452) [ClassicSimilarity], result of:
      0.019420752 = score(doc=4452,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.21943474 = fieldWeight in 4452, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4452)
  0.25 = coord(1/4)
    Abstract
    The emphasis in most hypertext systems is on the navigational methods, rather than on the global document retrieval mechanisms. When a search mechanism is provided, it is often restricted to simple string matching or to the Boolean model (as an alternate method). proposes a retrieval mechanism using Bayesian inference networks. The main contribution of this approach is the automatic construction of this network using the expected mutual information measure to build the inference tree, and using Jaccard's formula to define fixed conditional probability relationships
  12. Savoy, J.: Effectiveness of information retrieval systems used in a hypertext environment (1993) 0.00 
    0.004855188 = product of:
  0.019420752 = sum of:
    0.019420752 = weight(_text_:information in 6511) [ClassicSimilarity], result of:
      0.019420752 = score(doc=6511,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.21943474 = fieldWeight in 6511, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=6511)
  0.25 = coord(1/4)
    Abstract
    In most hypertext systems, information retrieval techniques emphasize browsing or navigational methods which are not thorough enough to find all relevant material, especially when the number of nodes and/or links becomes very large. Reviews the main query-based search techniques currently used in hypertext environments. Explains the experimental methodology. Concentrates on the retrieval effectiveness of these retrieval strategies. Considers ways of improving search effectiveness
  13. Savoy, J.: ¬A learning scheme for information retrieval in hypertext (1994) 0.00 
    0.004855188 = product of:
  0.019420752 = sum of:
    0.019420752 = weight(_text_:information in 7292) [ClassicSimilarity], result of:
      0.019420752 = score(doc=7292,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.21943474 = fieldWeight in 7292, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=7292)
  0.25 = coord(1/4)
    Source
    Information processing and management. 30(1994) no.4, S.515-533
  14. Abdou, S.; Savoy, J.: Searching in Medline : query expansion and manual indexing evaluation (2008) 0.00 
    0.0044597755 = product of:
  0.017839102 = sum of:
    0.017839102 = weight(_text_:information in 2062) [ClassicSimilarity], result of:
      0.017839102 = score(doc=2062,freq=6.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.20156369 = fieldWeight in 2062, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2062)
  0.25 = coord(1/4)
    Abstract
    Based on a relatively large subset representing one third of the Medline collection, this paper evaluates ten different IR models, including recent developments in both probabilistic and language models. We show that the best performing IR models is a probabilistic model developed within the Divergence from Randomness framework [Amati, G., & van Rijsbergen, C.J. (2002) Probabilistic models of information retrieval based on measuring the divergence from randomness. ACM-Transactions on Information Systems 20(4), 357-389], which result in 170% enhancements in mean average precision when compared to the classical tf idf vector-space model. This paper also reports on our impact evaluations on the retrieval effectiveness of manually assigned descriptors (MeSH or Medical Subject Headings), showing that by including these terms retrieval performance can improve from 2.4% to 13.5%, depending on the underling IR model. Finally, we design a new general blind-query expansion approach showing improved retrieval performances compared to those obtained using the Rocchio approach.
    Source
    Information processing and management. 44(2008) no.2, S.781-789
  15. Fautsch, C.; Savoy, J.: Algorithmic stemmers or morphological analysis? : an evaluation (2009) 0.00 
    0.0044597755 = product of:
  0.017839102 = sum of:
    0.017839102 = weight(_text_:information in 2950) [ClassicSimilarity], result of:
      0.017839102 = score(doc=2950,freq=6.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.20156369 = fieldWeight in 2950, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2950)
  0.25 = coord(1/4)
    Abstract
    It is important in information retrieval (IR), information extraction, or classification tasks that morphologically related forms are conflated under the same stem (using stemmer) or lemma (using morphological analyzer). To achieve this for the English language, algorithmic stemming or various morphological analysis approaches have been suggested. Based on Cross-Language Evaluation Forum test collections containing 284 queries and various IR models, this article evaluates these word-normalization proposals. Stemming improves the mean average precision significantly by around 7% while performance differences are not significant when comparing various algorithmic stemmers or algorithmic stemmers and morphological analysis. Accounting for thesaurus class numbers during indexing does not modify overall retrieval performances. Finally, we demonstrate that including a stop word list, even one containing only around 10 terms, might significantly improve retrieval performance, depending on the IR model.
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.8, S.1616-1624
  16. Picard, J.; Savoy, J.: Enhancing retrieval with hyperlinks : a general model based on propositional argumentation systems (2003) 0.00 
    0.0037164795 = product of:
  0.014865918 = sum of:
    0.014865918 = weight(_text_:information in 1427) [ClassicSimilarity], result of:
      0.014865918 = score(doc=1427,freq=6.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16796975 = fieldWeight in 1427, 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=1427)
  0.25 = coord(1/4)
    Abstract
    Fast, effective, and adaptable techniques are needed to automatically organize and retrieve information an the ever-increasing World Wide Web. In that respect, different strategies have been suggested to take hypertext links into account. For example, hyperlinks have been used to (1) enhance document representation, (2) improve document ranking by propagating document score, (3) provide an indicator of popularity, and (4) find hubs and authorities for a given topic. Although the TREC experiments have not demonstrated the usefulness of hyperlinks for retrieval, the hypertext structure is nevertheless an essential aspect of the Web, and as such, should not be ignored. The development of abstract models of the IR task was a key factor to the improvement of search engines. However, at this time conceptual tools for modeling the hypertext retrieval task are lacking, making it difficult to compare, improve, and reason an the existing techniques. This article proposes a general model for using hyperlinks based an Probabilistic Argumentation Systems, in which each of the above-mentioned techniques can be stated. This model will allow to discover some inconsistencies in the mentioned techniques, and to take a higher level and systematic approach for using hyperlinks for retrieval.
    Footnote
    Beitrag eines Themenheftes: Mathematical, logical, and formal methods in information retrieval
    Source
    Journal of the American Society for Information Science and technology. 54(2003) no.4, S.347-355
  17. Dolamic, L.; Savoy, J.: Retrieval effectiveness of machine translated queries (2010) 0.00 
    0.0036413912 = product of:
  0.014565565 = sum of:
    0.014565565 = weight(_text_:information in 4102) [ClassicSimilarity], result of:
      0.014565565 = score(doc=4102,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.16457605 = fieldWeight in 4102, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=4102)
  0.25 = coord(1/4)
    Abstract
    This article describes and evaluates various information retrieval models used to search document collections written in English through submitting queries written in various other languages, either members of the Indo-European family (English, French, German, and Spanish) or radically different language groups such as Chinese. This evaluation method involves searching a rather large number of topics (around 300) and using two commercial machine translation systems to translate across the language barriers. In this study, mean average precision is used to measure variances in retrieval effectiveness when a query language differs from the document language. Although performance differences are rather large for certain languages pairs, this does not mean that bilingual search methods are not commercially viable. Causes of the difficulties incurred when searching or during translation are analyzed and the results of concrete examples are explained.
    Source
    Journal of the American Society for Information Science and Technology. 61(2010) no.11, S.2266-2273
  18. Dolamic, L.; Savoy, J.: Indexing and searching strategies for the Russian language (2009) 0.00 
    0.0030344925 = product of:
  0.01213797 = sum of:
    0.01213797 = weight(_text_:information in 3301) [ClassicSimilarity], result of:
      0.01213797 = score(doc=3301,freq=4.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13714671 = fieldWeight in 3301, 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=3301)
  0.25 = coord(1/4)
    Abstract
    This paper describes and evaluates various stemming and indexing strategies for the Russian language. We design and evaluate two stemming approaches, a light and a more aggressive one, and compare these stemmers to the Snowball stemmer, to no stemming, and also to a language-independent approach (n-gram). To evaluate the suggested stemming strategies we apply various probabilistic information retrieval (IR) models, including the Okapi, the Divergence from Randomness (DFR), a statistical language model (LM), as well as two vector-space approaches, namely, the classical tf idf scheme and the dtu-dtn model. We find that the vector-space dtu-dtn and the DFR models tend to result in better retrieval effectiveness than the Okapi, LM, or tf idf models, while only the latter two IR approaches result in statistically significant performance differences. Ignoring stemming generally reduces the MAP by more than 50%, and these differences are always significant. When applying an n-gram approach, performance differences are usually lower than an approach involving stemming. Finally, our light stemmer tends to perform best, although performance differences between the light, aggressive, and Snowball stemmers are not statistically significant.
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.12, S.2540-2547
  19. Savoy, J.: ¬A new probabilistic scheme for information retrieval in hypertext (1995) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 7254) [ClassicSimilarity], result of:
      0.012015978 = score(doc=7254,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 7254, 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=7254)
  0.25 = coord(1/4)
  20. Savoy, J.: Bibliographic database access using free-text and controlled vocabulary : an evaluation (2005) 0.00 
    0.0030039945 = product of:
  0.012015978 = sum of:
    0.012015978 = weight(_text_:information in 1053) [ClassicSimilarity], result of:
      0.012015978 = score(doc=1053,freq=2.0), product of:
        0.08850355 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.050415643 = queryNorm
        0.13576832 = fieldWeight in 1053, 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=1053)
  0.25 = coord(1/4)
    Source
    Information processing and management. 41(2005) no.4, S.873-890

Authors

Years

Themes