Search (313 results, page 1 of 16)

  • × theme_ss:"Retrievalalgorithmen"
  1. Chang, C.-H.; Hsu, C.-C.: Integrating query expansion and conceptual relevance feedback for personalized Web information retrieval (1998) 0.12 
    0.12046325 = product of:
  0.18069488 = sum of:
    0.06437215 = weight(_text_:wide in 1319) [ClassicSimilarity], result of:
      0.06437215 = score(doc=1319,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.342674 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.060488462 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
      0.060488462 = score(doc=1319,freq=6.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.43716836 = fieldWeight in 1319, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.042430993 = weight(_text_:retrieval in 1319) [ClassicSimilarity], result of:
      0.042430993 = score(doc=1319,freq=4.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.33085006 = fieldWeight in 1319, 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=1319)
    0.013403265 = product of:
      0.040209793 = sum of:
        0.040209793 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
          0.040209793 = score(doc=1319,freq=2.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = queryNorm
            0.2708308 = fieldWeight in 1319, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1319)
      0.33333334 = coord(1/3)
  0.6666667 = coord(4/6)
    Abstract
    Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web
    Date
    1. 8.1996 22:08:06
    Footnote
    Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  2. Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999) 0.10 
    0.102969915 = product of:
  0.20593983 = sum of:
    0.07803083 = weight(_text_:wide in 5777) [ClassicSimilarity], result of:
      0.07803083 = score(doc=5777,freq=4.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.4153836 = fieldWeight in 5777, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=5777)
    0.059868045 = weight(_text_:web in 5777) [ClassicSimilarity], result of:
      0.059868045 = score(doc=5777,freq=8.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.43268442 = fieldWeight in 5777, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=5777)
    0.06804096 = weight(_text_:retrieval in 5777) [ClassicSimilarity], result of:
      0.06804096 = score(doc=5777,freq=14.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.5305404 = fieldWeight in 5777, 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=5777)
  0.5 = coord(3/6)
    Abstract
    This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing
    LCSH
    Web search engines
    RSWK
    Suchmaschine / Information Retrieval
    World Wide Web / Suchmaschine / Mathematisches Modell (BVB)
    Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
    Subject
    Suchmaschine / Information Retrieval
    World Wide Web / Suchmaschine / Mathematisches Modell (BVB)
    Suchmaschine / Information Retrieval / Mathematisches Modell (HEBIS)
    Web search engines
  3. Symonds, M.; Bruza, P.; Zuccon, G.; Koopman, B.; Sitbon, L.; Turner, I.: Automatic query expansion : a structural linguistic perspective (2014) 0.09 
    0.08744289 = product of:
  0.13116433 = sum of:
    0.045980107 = weight(_text_:wide in 1338) [ClassicSimilarity], result of:
      0.045980107 = score(doc=1338,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.24476713 = fieldWeight in 1338, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
    0.02494502 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
      0.02494502 = score(doc=1338,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.18028519 = fieldWeight in 1338, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
    0.052494746 = weight(_text_:retrieval in 1338) [ClassicSimilarity], result of:
      0.052494746 = score(doc=1338,freq=12.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.40932083 = fieldWeight in 1338, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
    0.007744446 = product of:
      0.023233337 = sum of:
        0.023233337 = weight(_text_:system in 1338) [ClassicSimilarity], result of:
          0.023233337 = score(doc=1338,freq=2.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.17398985 = fieldWeight in 1338, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1338)
      0.33333334 = coord(1/3)
  0.6666667 = coord(4/6)
    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.
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  4. Kantor, P.; Kim, M.H.; Ibraev, U.; Atasoy, K.: Estimating the number of relevant documents in enormous collections (1999) 0.07 
    0.074790195 = product of:
  0.112185284 = sum of:
    0.045980107 = weight(_text_:wide in 6690) [ClassicSimilarity], result of:
      0.045980107 = score(doc=6690,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.24476713 = fieldWeight in 6690, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6690)
    0.02494502 = weight(_text_:web in 6690) [ClassicSimilarity], result of:
      0.02494502 = score(doc=6690,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.18028519 = fieldWeight in 6690, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6690)
    0.030307854 = weight(_text_:retrieval in 6690) [ClassicSimilarity], result of:
      0.030307854 = score(doc=6690,freq=4.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.23632148 = fieldWeight in 6690, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6690)
    0.010952301 = product of:
      0.032856904 = sum of:
        0.032856904 = weight(_text_:system in 6690) [ClassicSimilarity], result of:
          0.032856904 = score(doc=6690,freq=4.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.24605882 = fieldWeight in 6690, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6690)
      0.33333334 = coord(1/3)
  0.6666667 = coord(4/6)
    Abstract
    In assessing information retrieval systems, it is important to know not only the precision of the retrieved set, but also to compare the number of retrieved relevant items to the total number of relevant items. For large collections, such as the TREC test collections, or the World Wide Web, it is not possible to enumerate the entire set of relevant documents. If the retrieved documents are evaluated, a variant of the statistical "capture-recapture" method can be used to estimate the total number of relevant documents, providing the several retrieval systems used are sufficiently independent. We show that the underlying signal detection model supporting such an analysis can be extended in two ways. First, assuming that there are two distinct performance characteristics (corresponding to the chance of retrieving a relevant, and retrieving a given non-relevant document), we show that if there are three or more independent systems available it is possible to estimate the number of relevant documents without actually having to decide whether each individual document is relevant. We report applications of this 3-system method to the TREC data, leading to the conclusion that the independence assumptions are not satisfied. We then extend the model to a multi-system, multi-problem model, and show that it is possible to include statistical dependencies of all orders in the model, and determine the number of relevant documents for each of the problems in the set. Application to the TREC setting will be presented
  5. Ding, Y.; Chowdhury, G.; Foo, S.: Organsising keywords in a Web search environment : a methodology based on co-word analysis (2000) 0.07 
    0.07102625 = product of:
  0.1420525 = sum of:
    0.055176124 = weight(_text_:wide in 105) [ClassicSimilarity], result of:
      0.055176124 = score(doc=105,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.29372054 = fieldWeight in 105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=105)
    0.042333104 = weight(_text_:web in 105) [ClassicSimilarity], result of:
      0.042333104 = score(doc=105,freq=4.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.3059541 = fieldWeight in 105, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=105)
    0.04454327 = weight(_text_:retrieval in 105) [ClassicSimilarity], result of:
      0.04454327 = score(doc=105,freq=6.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.34732026 = fieldWeight in 105, 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=105)
  0.5 = coord(3/6)
    Abstract
    The rapid development of the Internet and World Wide Web has caused some critical problem for information retrieval. Researchers have made several attempts to solve these problems. Thesauri and subject heading lists as traditional information retrieval tools have been criticised for their efficiency to tackle these newly emerging problems. This paper proposes an information retrieval tool generated by cocitation analysis, comprising keyword clusters with relationships based on the co-occurrences of keywords in the literature. Such a tool can play the role of an associative thesaurus that can provide information about the keywords in a domain that might be useful for information searching and query expansion
  6. Habernal, I.; Konopík, M.; Rohlík, O.: Question answering (2012) 0.07 
    0.07102625 = product of:
  0.1420525 = sum of:
    0.055176124 = weight(_text_:wide in 101) [ClassicSimilarity], result of:
      0.055176124 = score(doc=101,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.29372054 = fieldWeight in 101, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=101)
    0.042333104 = weight(_text_:web in 101) [ClassicSimilarity], result of:
      0.042333104 = score(doc=101,freq=4.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.3059541 = fieldWeight in 101, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=101)
    0.04454327 = weight(_text_:retrieval in 101) [ClassicSimilarity], result of:
      0.04454327 = score(doc=101,freq=6.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.34732026 = fieldWeight in 101, 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=101)
  0.5 = coord(3/6)
    Abstract
    Question Answering is an area of information retrieval with the added challenge of applying sophisticated techniques to identify the complex syntactic and semantic relationships present in text in order to provide a more sophisticated and satisfactory response to the user's information needs. For this reason, the authors see question answering as the next step beyond standard information retrieval. In this chapter state of the art question answering is covered focusing on providing an overview of systems, techniques and approaches that are likely to be employed in the next generations of search engines. Special attention is paid to question answering using the World Wide Web as the data source and to question answering exploiting the possibilities of Semantic Web. Considerations about the current issues and prospects for promising future research are also provided.
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  7. Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983) 0.07 
    0.06697209 = product of:
  0.20091626 = sum of:
    0.103934295 = weight(_text_:retrieval in 2134) [ClassicSimilarity], result of:
      0.103934295 = score(doc=2134,freq=6.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.8104139 = fieldWeight in 2134, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.109375 = fieldNorm(doc=2134)
    0.09698196 = product of:
      0.14547293 = sum of:
        0.065053344 = weight(_text_:system in 2134) [ClassicSimilarity], result of:
          0.065053344 = score(doc=2134,freq=2.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.4871716 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
        0.080419585 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.080419585 = score(doc=2134,freq=2.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.6666667 = coord(2/3)
  0.33333334 = coord(2/6)
    Date
    30. 3.2001 13:32:22
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  8. Picard, J.; Savoy, J.: Enhancing retrieval with hyperlinks : a general model based on propositional argumentation systems (2003) 0.06 
    0.06458931 = product of:
  0.12917861 = sum of:
    0.045980107 = weight(_text_:wide in 1427) [ClassicSimilarity], result of:
      0.045980107 = score(doc=1427,freq=2.0), product of:
        0.18785246 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.042397358 = queryNorm
        0.24476713 = fieldWeight in 1427, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
    0.035277586 = weight(_text_:web in 1427) [ClassicSimilarity], result of:
      0.035277586 = score(doc=1427,freq=4.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.25496176 = fieldWeight in 1427, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
    0.047920924 = weight(_text_:retrieval in 1427) [ClassicSimilarity], result of:
      0.047920924 = score(doc=1427,freq=10.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.37365708 = fieldWeight in 1427, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
  0.5 = coord(3/6)
    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
  9. Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015) 0.06 
    0.05552385 = product of:
  0.1110477 = sum of:
    0.02494502 = weight(_text_:web in 2591) [ClassicSimilarity], result of:
      0.02494502 = score(doc=2591,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.18028519 = fieldWeight in 2591, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2591)
    0.037119392 = weight(_text_:retrieval in 2591) [ClassicSimilarity], result of:
      0.037119392 = score(doc=2591,freq=6.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.28943354 = fieldWeight in 2591, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2591)
    0.048983287 = product of:
      0.07347493 = sum of:
        0.032856904 = weight(_text_:system in 2591) [ClassicSimilarity], result of:
          0.032856904 = score(doc=2591,freq=4.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.24605882 = fieldWeight in 2591, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2591)
        0.040618025 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
          0.040618025 = score(doc=2591,freq=4.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = queryNorm
            0.27358043 = fieldWeight in 2591, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2591)
      0.6666667 = coord(2/3)
  0.5 = coord(3/6)
    Abstract
    Purpose In a system-based approach, replicating the web would require large test collections, and judging the relevancy of all documents per topic in creating relevance judgment through human assessors is infeasible. Due to the large amount of documents that requires judgment, there are possible errors introduced by human assessors because of disagreements. The paper aims to discuss these issues. Design/methodology/approach This study explores exponential variation and document ranking methods that generate a reliable set of relevance judgments (pseudo relevance judgments) to reduce human efforts. These methods overcome problems with large amounts of documents for judgment while avoiding human disagreement errors during the judgment process. This study utilizes two key factors: number of occurrences of each document per topic from all the system runs; and document rankings to generate the alternate methods. Findings The effectiveness of the proposed method is evaluated using the correlation coefficient of ranked systems using mean average precision scores between the original Text REtrieval Conference (TREC) relevance judgments and pseudo relevance judgments. The results suggest that the proposed document ranking method with a pool depth of 100 could be a reliable alternative to reduce human effort and disagreement errors involved in generating TREC-like relevance judgments. Originality/value Simple methods proposed in this study show improvement in the correlation coefficient in generating alternate relevance judgment without human assessors while contributing to information retrieval evaluation.
    Date
    20. 1.2015 18:30:22
    18. 9.2018 18:22:56
  10. 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.05 
    0.05386299 = product of:
  0.10772598 = sum of:
    0.059868045 = weight(_text_:web in 2239) [ClassicSimilarity], result of:
      0.059868045 = score(doc=2239,freq=8.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.43268442 = fieldWeight in 2239, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2239)
    0.036369424 = weight(_text_:retrieval in 2239) [ClassicSimilarity], result of:
      0.036369424 = score(doc=2239,freq=4.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.2835858 = fieldWeight in 2239, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=2239)
    0.011488512 = product of:
      0.034465536 = sum of:
        0.034465536 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
          0.034465536 = score(doc=2239,freq=2.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = 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.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR taskdiscovery of ranking functions for Web search-and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is weIl known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs an GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations an the design of fitness functions for genetic-based information retrieval experiments.
    Date
    31. 5.2004 19:22:06
  11. Meghabghab, G.: Google's Web page ranking applied to different topological Web graph structures (2001) 0.05 
    0.047021 = product of:
  0.141063 = sum of:
    0.11963211 = weight(_text_:web in 6028) [ClassicSimilarity], result of:
      0.11963211 = score(doc=6028,freq=46.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.86461735 = fieldWeight in 6028, product of:
          6.78233 = tf(freq=46.0), with freq of:
            46.0 = termFreq=46.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6028)
    0.02143089 = weight(_text_:retrieval in 6028) [ClassicSimilarity], result of:
      0.02143089 = score(doc=6028,freq=2.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.16710453 = fieldWeight in 6028, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6028)
  0.33333334 = coord(2/6)
    Abstract
    This research is part of the ongoing study to better understand web page ranking on the web. It looks at a web page as a graph structure or a web graph, and tries to classify different web graphs in the new coordinate space: (out-degree, in-degree). The out-degree coordinate od is defined as the number of outgoing web pages from a given web page. The in-degree id coordinate is the number of web pages that point to a given web page. In this new coordinate space a metric is built to classify how close or far different web graphs are. Google's web ranking algorithm (Brin & Page, 1998) on ranking web pages is applied in this new coordinate space. The results of the algorithm has been modified to fit different topological web graph structures. Also the algorithm was not successful in the case of general web graphs and new ranking web algorithms have to be considered. This study does not look at enhancing web ranking by adding any contextual information. It only considers web links as a source to web page ranking. The author believes that understanding the underlying web page as a graph will help design better ranking web algorithms, enhance retrieval and web performance, and recommends using graphs as a part of visual aid for browsing engine designers
  12. Radev, D.; Fan, W.; Qu, H.; Wu, H.; Grewal, A.: Probabilistic question answering on the Web (2005) 0.04 
    0.043428827 = product of:
  0.086857654 = sum of:
    0.051847253 = weight(_text_:web in 3455) [ClassicSimilarity], result of:
      0.051847253 = score(doc=3455,freq=6.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.37471575 = fieldWeight in 3455, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=3455)
    0.025717068 = weight(_text_:retrieval in 3455) [ClassicSimilarity], result of:
      0.025717068 = score(doc=3455,freq=2.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.20052543 = fieldWeight in 3455, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3455)
    0.0092933355 = product of:
      0.027880006 = sum of:
        0.027880006 = weight(_text_:system in 3455) [ClassicSimilarity], result of:
          0.027880006 = score(doc=3455,freq=2.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.20878783 = fieldWeight in 3455, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=3455)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query, not answers to user questions. We have developed an architecture that augments existing search engines so that they support natural language question answering. The process entails five steps: query modulation, document retrieval, passage extraction, phrase extraction, and answer ranking. In this article, we describe some probabilistic approaches to the last three of these stages. We show how our techniques apply to a number of existing search engines, and we also present results contrasting three different methods for question answering. Our algorithm, probabilistic phrase reranking (PPR), uses proximity and question type features and achieves a total reciprocal document rank of .20 an the TREC8 corpus. Our techniques have been implemented as a Web-accessible system, called NSIR.
  13. Singh, S.; Dey, L.: ¬A rough-fuzzy document grading system for customized text information retrieval (2005) 0.04 
    0.04244506 = product of:
  0.08489012 = sum of:
    0.029934023 = weight(_text_:web in 1007) [ClassicSimilarity], result of:
      0.029934023 = score(doc=1007,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.21634221 = fieldWeight in 1007, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=1007)
    0.036369424 = weight(_text_:retrieval in 1007) [ClassicSimilarity], result of:
      0.036369424 = score(doc=1007,freq=4.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.2835858 = fieldWeight in 1007, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=1007)
    0.018586671 = product of:
      0.05576001 = sum of:
        0.05576001 = weight(_text_:system in 1007) [ClassicSimilarity], result of:
          0.05576001 = score(doc=1007,freq=8.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.41757566 = fieldWeight in 1007, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=1007)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Due to the large repository of documents available on the web, users are usually inundated by a large volume of information, most of which is found to be irrelevant. Since user perspectives vary, a client-side text filtering system that learns the user's perspective can reduce the problem of irrelevant retrieval. In this paper, we have provided the design of a customized text information filtering system which learns user preferences and modifies the initial query to fetch better documents. It uses a rough-fuzzy reasoning scheme. The rough-set based reasoning takes care of natural language nuances, like synonym handling, very elegantly. The fuzzy decider provides qualitative grading to the documents for the user's perusal. We have provided the detailed design of the various modules and some results related to the performance analysis of the system.
  14. Khoo, C.S.G.; Wan, K.-W.: ¬A simple relevancy-ranking strategy for an interface to Boolean OPACs (2004) 0.04 
    0.0410536 = product of:
  0.0821072 = sum of:
    0.03492303 = weight(_text_:web in 2509) [ClassicSimilarity], result of:
      0.03492303 = score(doc=2509,freq=8.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.25239927 = fieldWeight in 2509, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2509)
    0.015001623 = weight(_text_:retrieval in 2509) [ClassicSimilarity], result of:
      0.015001623 = score(doc=2509,freq=2.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.11697317 = fieldWeight in 2509, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2509)
    0.032182552 = product of:
      0.048273824 = sum of:
        0.028168926 = weight(_text_:system in 2509) [ClassicSimilarity], result of:
          0.028168926 = score(doc=2509,freq=6.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.21095149 = fieldWeight in 2509, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2509)
        0.020104896 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
          0.020104896 = score(doc=2509,freq=2.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = queryNorm
            0.1354154 = fieldWeight in 2509, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2509)
      0.6666667 = coord(2/3)
  0.5 = coord(3/6)
    Content
    "Most Web search engines accept natural language queries, perform some kind of fuzzy matching and produce ranked output, displaying first the documents that are most likely to be relevant. On the other hand, most library online public access catalogs (OPACs) an the Web are still Boolean retrieval systems that perform exact matching, and require users to express their search requests precisely in a Boolean search language and to refine their search statements to improve the search results. It is well-documented that users have difficulty searching Boolean OPACs effectively (e.g. Borgman, 1996; Ensor, 1992; Wallace, 1993). One approach to making OPACs easier to use is to develop a natural language search interface that acts as a middleware between the user's Web browser and the OPAC system. The search interface can accept a natural language query from the user and reformulate it as a series of Boolean search statements that are then submitted to the OPAC. The records retrieved by the OPAC are ranked by the search interface before forwarding them to the user's Web browser. The user, then, does not need to interact directly with the Boolean OPAC but with the natural language search interface or search intermediary. The search interface interacts with the OPAC system an the user's behalf. The advantage of this approach is that no modification to the OPAC or library system is required. Furthermore, the search interface can access multiple OPACs, acting as a meta search engine, and integrate search results from various OPACs before sending them to the user. The search interface needs to incorporate a method for converting the user's natural language query into a series of Boolean search statements, and for ranking the OPAC records retrieved. The purpose of this study was to develop a relevancyranking algorithm for a search interface to Boolean OPAC systems. This is part of an on-going effort to develop a knowledge-based search interface to OPACs called the E-Referencer (Khoo et al., 1998, 1999; Poo et al., 2000). E-Referencer v. 2 that has been implemented applies a repertoire of initial search strategies and reformulation strategies to retrieve records from OPACs using the Z39.50 protocol, and also assists users in mapping query keywords to the Library of Congress subject headings."
    Source
    Electronic library. 22(2004) no.2, S.112-120
  15. Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006) 0.04 
    0.04050616 = product of:
  0.08101232 = sum of:
    0.02494502 = weight(_text_:web in 56) [ClassicSimilarity], result of:
      0.02494502 = score(doc=56,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.18028519 = fieldWeight in 56, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=56)
    0.02143089 = weight(_text_:retrieval in 56) [ClassicSimilarity], result of:
      0.02143089 = score(doc=56,freq=2.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.16710453 = fieldWeight in 56, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=56)
    0.034636416 = product of:
      0.05195462 = sum of:
        0.023233337 = weight(_text_:system in 56) [ClassicSimilarity], result of:
          0.023233337 = score(doc=56,freq=2.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.17398985 = fieldWeight in 56, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=56)
        0.028721282 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
          0.028721282 = score(doc=56,freq=2.0), product of:
            0.14846832 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.042397358 = 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.6666667 = coord(2/3)
  0.5 = coord(3/6)
    Abstract
    The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.
    Date
    22. 7.2006 16:32:43
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  16. Agosti, M.; Pretto, L.: ¬A theoretical study of a generalized version of kleinberg's HITS algorithm (2005) 0.04 
    0.0404908 = product of:
  0.0809816 = sum of:
    0.04989004 = weight(_text_:web in 4) [ClassicSimilarity], result of:
      0.04989004 = score(doc=4,freq=8.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.36057037 = fieldWeight in 4, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4)
    0.02143089 = weight(_text_:retrieval in 4) [ClassicSimilarity], result of:
      0.02143089 = score(doc=4,freq=2.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.16710453 = fieldWeight in 4, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4)
    0.009660665 = product of:
      0.028981995 = sum of:
        0.028981995 = weight(_text_:29 in 4) [ClassicSimilarity], result of:
          0.028981995 = score(doc=4,freq=2.0), product of:
            0.14914064 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.042397358 = queryNorm
            0.19432661 = fieldWeight in 4, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Kleinberg's HITS (Hyperlink-Induced Topic Search) algorithm (Kleinberg 1999), which was originally developed in a Web context, tries to infer the authoritativeness of a Web page in relation to a specific query using the structure of a subgraph of the Web graph, which is obtained considering this specific query. Recent applications of this algorithm in contexts far removed from that of Web searching (Bacchin, Ferro and Melucci 2002, Ng et al. 2001) inspired us to study the algorithm in the abstract, independently of its particular applications, trying to mathematically illuminate its behaviour. In the present paper we detail this theoretical analysis. The original work starts from the definition of a revised and more general version of the algorithm, which includes the classic one as a particular case. We perform an analysis of the structure of two particular matrices, essential to studying the behaviour of the algorithm, and we prove the convergence of the algorithm in the most general case, finding the analytic expression of the vectors to which it converges. Then we study the symmetry of the algorithm and prove the equivalence between the existence of symmetry and the independence from the order of execution of some basic operations on initial vectors. Finally, we expound some interesting consequences of our theoretical results.
    Date
    31.12.1996 19:29:41
    Source
    Advances in mathematical/formal methods in information retrieval. 8(2005) no.2 , S.219-243
  17. Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006) 0.04 
    0.040112484 = product of:
  0.08022497 = sum of:
    0.044901032 = weight(_text_:web in 6) [ClassicSimilarity], result of:
      0.044901032 = score(doc=6,freq=18.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.32451332 = fieldWeight in 6, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
    0.028752556 = weight(_text_:retrieval in 6) [ClassicSimilarity], result of:
      0.028752556 = score(doc=6,freq=10.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.22419426 = fieldWeight in 6, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0234375 = fieldNorm(doc=6)
    0.00657138 = product of:
      0.01971414 = sum of:
        0.01971414 = weight(_text_:system in 6) [ClassicSimilarity], result of:
          0.01971414 = score(doc=6,freq=4.0), product of:
            0.13353272 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.042397358 = queryNorm
            0.14763528 = fieldWeight in 6, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other Web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of Web page rankings, "Google's PageRank and Beyond" supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample Web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. It includes: many illustrative examples and entertaining asides; MATLAB code; accessible and informal style; and complete and self-contained section for mathematics review.
    Content
    Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling
    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
    RSWK
    Google / Web-Seite / Rangstatistik (HEBIS)
    Subject
    Google / Web-Seite / Rangstatistik (HEBIS)
  18. Henzinger, M.R.: Hyperlink analysis for the Web (2001) 0.04 
    0.039104365 = product of:
  0.11731309 = sum of:
    0.07195244 = weight(_text_:web in 8) [ClassicSimilarity], result of:
      0.07195244 = score(doc=8,freq=26.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.520022 = fieldWeight in 8, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=8)
    0.045360643 = weight(_text_:retrieval in 8) [ClassicSimilarity], result of:
      0.045360643 = score(doc=8,freq=14.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.3536936 = fieldWeight in 8, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03125 = fieldNorm(doc=8)
  0.33333334 = coord(2/6)
    Abstract
    Hyperlink analysis algorithms allow search engines to deliver focused results to user queries.This article surveys ranking algorithms used to retrieve information on the Web.
    Content
    Information retrieval is a computer science subfield whose goal is to find all documents relevant to a user query in a given collection of documents. As such, information retrieval should really be called document retrieval. Before the advent of the Web, IR systems were typically installed in libraries for use mostly by reference librarians. The retrieval algorithm for these systems was usually based exclusively on analysis of the words in the document. The Web changed all this. Now each Web user has access to various search engines whose retrieval algorithms often use not only the words in the documents but also information like the hyperlink structure of the Web or markup language tags. How are hyperlinks useful? The hyperlink functionality alone-that is, the hyperlink to Web page B that is contained in Web page A-is not directly useful in information retrieval. However, the way Web page authors use hyperlinks can give them valuable information content. Authors usually create hyperlinks they think will be useful to readers. Some may be navigational aids that, for example, take the reader back to the site's home page; others provide access to documents that augment the content of the current page. The latter tend to point to highquality pages that might be on the same topic as the page containing the hyperlink. Web information retrieval systems can exploit this information to refine searches for relevant documents. Hyperlink analysis significantly improves the relevance of the search results, so much so that all major Web search engines claim to use some type of hyperlink analysis. However, the search engines do not disclose details about the type of hyperlink analysis they perform- mostly to avoid manipulation of search results by Web-positioning companies. In this article, I discuss how hyperlink analysis can be applied to ranking algorithms, and survey other ways Web search engines can use this analysis.
  19. Kaszkiel, M.; Zobel, J.: Effective ranking with arbitrary passages (2001) 0.04 
    0.038948122 = product of:
  0.077896245 = sum of:
    0.029934023 = weight(_text_:web in 5764) [ClassicSimilarity], result of:
      0.029934023 = score(doc=5764,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.21634221 = fieldWeight in 5764, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=5764)
    0.036369424 = weight(_text_:retrieval in 5764) [ClassicSimilarity], result of:
      0.036369424 = score(doc=5764,freq=4.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.2835858 = fieldWeight in 5764, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5764)
    0.011592798 = product of:
      0.034778394 = sum of:
        0.034778394 = weight(_text_:29 in 5764) [ClassicSimilarity], result of:
          0.034778394 = score(doc=5764,freq=2.0), product of:
            0.14914064 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.042397358 = queryNorm
            0.23319192 = fieldWeight in 5764, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.046875 = fieldNorm(doc=5764)
      0.33333334 = coord(1/3)
  0.5 = coord(3/6)
    Abstract
    Text retrieval systems store a great variety of documents, from abstracts, newspaper articles, and Web pages to journal articles, books, court transcripts, and legislation. Collections of diverse types of documents expose shortcomings in current approaches to ranking. Use of short fragments of documents, called passages, instead of whole documents can overcome these shortcomings: passage ranking provides convenient units of text to return to the user, can avoid the difficulties of comparing documents of different length, and enables identification of short blocks of relevant material among otherwise irrelevant text. In this article, we compare several kinds of passage in an extensive series of experiments. We introduce a new type of passage, overlapping fragments of either fixed or variable length. We show that ranking with these arbitrary passages gives substantial improvements in retrieval effectiveness over traditional document ranking schemes, particularly for queries on collections of long documents. Ranking with arbitrary passages shows consistent improvements compared to ranking with whole documents, and to ranking with previous passage types that depend on document structure or topic shifts in documents
    Date
    29. 9.2001 14:00:39
  20. Mandl, T.: Web- und Multimedia-Dokumente : Neuere Entwicklungen bei der Evaluierung von Information Retrieval Systemen (2003) 0.04 
    0.03886184 = product of:
  0.116585515 = sum of:
    0.03991203 = weight(_text_:web in 1734) [ClassicSimilarity], result of:
      0.03991203 = score(doc=1734,freq=2.0), product of:
        0.13836423 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.042397358 = queryNorm
        0.2884563 = fieldWeight in 1734, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0625 = fieldNorm(doc=1734)
    0.076673485 = weight(_text_:retrieval in 1734) [ClassicSimilarity], result of:
      0.076673485 = score(doc=1734,freq=10.0), product of:
        0.12824841 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.042397358 = queryNorm
        0.59785134 = fieldWeight in 1734, 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=1734)
  0.33333334 = coord(2/6)
    Abstract
    Die Menge an Daten im Internet steigt weiter rapide an. Damit wächst auch der Bedarf an qualitativ hochwertigen Information Retrieval Diensten zur Orientierung und problemorientierten Suche. Die Entscheidung für die Benutzung oder Beschaffung von Information Retrieval Software erfordert aussagekräftige Evaluierungsergebnisse. Dieser Beitrag stellt neuere Entwicklungen bei der Evaluierung von Information Retrieval Systemen vor und zeigt den Trend zu Spezialisierung und Diversifizierung von Evaluierungsstudien, die den Realitätsgrad derErgebnisse erhöhen. DerSchwerpunkt liegt auf dem Retrieval von Fachtexten, Internet-Seiten und Multimedia-Objekten.

Authors

Years

Languages

Types

  • a 286
  • m 12
  • el 7
  • s 5
  • r 4
  • x 3
  • p 2
  • d 1
  • More… Less…

Themes

Subjects

Classifications