Search (55 results, page 3 of 3)

  • × theme_ss:"Retrievalalgorithmen"
  1. Crestani, F.; Dominich, S.; Lalmas, M.; Rijsbergen, C.J.K. van: Mathematical, logical, and formal methods in information retrieval : an introduction to the special issue (2003) 0.01 
    0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 1451) [ClassicSimilarity], result of:
          0.0407446 = score(doc=1451,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 1451, 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=1451)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2003 19:27:36
  2. Fan, W.; Fox, E.A.; Pathak, P.; Wu, H.: ¬The effects of fitness functions an genetic programming-based ranking discovery for Web search (2004) 0.01 
    0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
          0.0407446 = score(doc=2239,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 2239, 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=2239)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    31. 5.2004 19:22:06
  3. Furner, J.: ¬A unifying model of document relatedness for hybrid search engines (2003) 0.01 
    0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 2717) [ClassicSimilarity], result of:
          0.0407446 = score(doc=2717,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 2717, 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=2717)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    11. 9.2004 17:32:22
  4. Witschel, H.F.: Global term weights in distributed environments (2008) 0.01 
    0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 2096) [ClassicSimilarity], result of:
          0.0407446 = score(doc=2096,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 2096, 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=2096)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    1. 8.2008 9:44:22
  5. Campos, L.M. de; Fernández-Luna, J.M.; Huete, J.F.: Implementing relevance feedback in the Bayesian network retrieval model (2003) 0.01 
    0.005093075 = product of:
  0.0203723 = sum of:
    0.0203723 = product of:
      0.0407446 = sum of:
        0.0407446 = weight(_text_:22 in 825) [ClassicSimilarity], result of:
          0.0407446 = score(doc=825,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.23214069 = fieldWeight in 825, 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=825)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2003 19:30:19
  6. Jacso, P.: Testing the calculation of a realistic h-index in Google Scholar, Scopus, and Web of Science for F. W. Lancaster (2008) 0.00 
    0.004785695 = product of:
  0.01914278 = sum of:
    0.01914278 = weight(_text_:library in 5586) [ClassicSimilarity], result of:
      0.01914278 = score(doc=5586,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.14525402 = fieldWeight in 5586, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5586)
  0.25 = coord(1/4)
    Source
    Library trends. 56(2008) no.4, S.784-815
  7. Burgin, R.: ¬The retrieval effectiveness of 5 clustering algorithms as a function of indexing exhaustivity (1995) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 3365) [ClassicSimilarity], result of:
          0.033953834 = score(doc=3365,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 3365, 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=3365)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 2.1996 11:20:06
  8. Efthimiadis, E.N.: User choices : a new yardstick for the evaluation of ranking algorithms for interactive query expansion (1995) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 5697) [ClassicSimilarity], result of:
          0.033953834 = score(doc=5697,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 5697, 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=5697)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 2.1996 13:14:10
  9. Song, D.; Bruza, P.D.: Towards context sensitive information inference (2003) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 1428) [ClassicSimilarity], result of:
          0.033953834 = score(doc=1428,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 1428, 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=1428)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2003 19:35:46
  10. Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
          0.033953834 = score(doc=56,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 56, 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=56)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 7.2006 16:32:43
  11. Dominich, S.: Mathematical foundations of information retrieval (2001) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 1753) [ClassicSimilarity], result of:
          0.033953834 = score(doc=1753,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 1753, 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=1753)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2008 12:26:32
  12. Baloh, P.; Desouza, K.C.; Hackney, R.: Contextualizing organizational interventions of knowledge management systems : a design science perspectiveA domain analysis (2012) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 241) [ClassicSimilarity], result of:
          0.033953834 = score(doc=241,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 241, 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=241)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    11. 6.2012 14:22:34
  13. Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013) 0.00 
    0.0042442293 = product of:
  0.016976917 = sum of:
    0.016976917 = product of:
      0.033953834 = sum of:
        0.033953834 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
          0.033953834 = score(doc=664,freq=2.0), product of:
            0.17551683 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050121464 = queryNorm
            0.19345059 = fieldWeight in 664, 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=664)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2013 19:34:49
  14. Austin, D.: How Google finds your needle in the Web's haystack : as we'll see, the trick is to ask the web itself to rank the importance of pages... (2006) 0.00 
    0.0033499864 = product of:
  0.013399946 = sum of:
    0.013399946 = weight(_text_:library in 93) [ClassicSimilarity], result of:
      0.013399946 = score(doc=93,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.10167781 = fieldWeight in 93, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
  0.25 = coord(1/4)
    Abstract
    Imagine a library containing 25 billion documents but with no centralized organization and no librarians. In addition, anyone may add a document at any time without telling anyone. You may feel sure that one of the documents contained in the collection has a piece of information that is vitally important to you, and, being impatient like most of us, you'd like to find it in a matter of seconds. How would you go about doing it? Posed in this way, the problem seems impossible. Yet this description is not too different from the World Wide Web, a huge, highly-disorganized collection of documents in many different formats. Of course, we're all familiar with search engines (perhaps you found this article using one) so we know that there is a solution. This article will describe Google's PageRank algorithm and how it returns pages from the web's collection of 25 billion documents that match search criteria so well that "google" has become a widely used verb. Most search engines, including Google, continually run an army of computer programs that retrieve pages from the web, index the words in each document, and store this information in an efficient format. Each time a user asks for a web search using a search phrase, such as "search engine," the search engine determines all the pages on the web that contains the words in the search phrase. (Perhaps additional information such as the distance between the words "search" and "engine" will be noted as well.) Here is the problem: Google now claims to index 25 billion pages. Roughly 95% of the text in web pages is composed from a mere 10,000 words. This means that, for most searches, there will be a huge number of pages containing the words in the search phrase. What is needed is a means of ranking the importance of the pages that fit the search criteria so that the pages can be sorted with the most important pages at the top of the list. One way to determine the importance of pages is to use a human-generated ranking. For instance, you may have seen pages that consist mainly of a large number of links to other resources in a particular area of interest. Assuming the person maintaining this page is reliable, the pages referenced are likely to be useful. Of course, the list may quickly fall out of date, and the person maintaining the list may miss some important pages, either unintentionally or as a result of an unstated bias. Google's PageRank algorithm assesses the importance of web pages without human evaluation of the content. In fact, Google feels that the value of its service is largely in its ability to provide unbiased results to search queries; Google claims, "the heart of our software is PageRank." As we'll see, the trick is to ask the web itself to rank the importance of pages.
  15. Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006) 0.00 
    0.0028714167 = product of:
  0.011485667 = sum of:
    0.011485667 = weight(_text_:library in 6) [ClassicSimilarity], result of:
      0.011485667 = score(doc=6,freq=2.0), product of:
        0.1317883 = queryWeight, product of:
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.050121464 = queryNorm
        0.08715241 = fieldWeight in 6, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6293786 = idf(docFreq=8668, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
  0.25 = coord(1/4)
    Content
    Chapter 9. Accelerating the Computation of PageRank: 9.1 An Adaptive Power Method - 9.2 Extrapolation - 9.3 Aggregation - 9.4 Other Numerical Methods Chapter 10. Updating the PageRank Vector: 10.1 The Two Updating Problems and their History - 10.2 Restarting the Power Method - 10.3 Approximate Updating Using Approximate Aggregation - 10.4 Exact Aggregation - 10.5 Exact vs. Approximate Aggregation - 10.6 Updating with Iterative Aggregation - 10.7 Determining the Partition - 10.8 Conclusions Chapter 11. The HITS Method for Ranking Webpages: 11.1 The HITS Algorithm - 11.2 HITS Implementation - 11.3 HITS Convergence - 11.4 HITS Example - 11.5 Strengths and Weaknesses of HITS - 11.6 HITS's Relationship to Bibliometrics - 11.7 Query-Independent HITS - 11.8 Accelerating HITS - 11.9 HITS Sensitivity Chapter 12. Other Link Methods for Ranking Webpages: 12.1 SALSA - 12.2 Hybrid Ranking Methods - 12.3 Rankings based on Traffic Flow Chapter 13. The Future of Web Information Retrieval: 13.1 Spam - 13.2 Personalization - 13.3 Clustering - 13.4 Intelligent Agents - 13.5 Trends and Time-Sensitive Search - 13.6 Privacy and Censorship - 13.7 Library Classification Schemes - 13.8 Data Fusion Chapter 14. Resources for Web Information Retrieval: 14.1 Resources for Getting Started - 14.2 Resources for Serious Study Chapter 15. The Mathematics Guide: 15.1 Linear Algebra - 15.2 Perron-Frobenius Theory - 15.3 Markov Chains - 15.4 Perron Complementation - 15.5 Stochastic Complementation - 15.6 Censoring - 15.7 Aggregation - 15.8 Disaggregation

Authors

Years

Languages

  • e 50
  • d 4
  • chi 1
  • More… Less…

Types

  • a 46
  • el 3
  • r 3
  • m 2
  • p 2
  • More… Less…

Themes

Subjects

Classifications