Search (890 results, page 1 of 45)

0.52914715 = product of:
  1.0582943 = sum of:
    0.08140726 = product of:
      0.24422176 = sum of:
        0.24422176 = weight(_text_:3a in 1826) [ClassicSimilarity], result of:
          0.24422176 = score(doc=1826,freq=2.0), product of:
            0.2607266 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.030753274 = queryNorm
            0.93669677 = fieldWeight in 1826, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.078125 = fieldNorm(doc=1826)
      0.33333334 = coord(1/3)
    0.24422176 = weight(_text_:2f in 1826) [ClassicSimilarity], result of:
      0.24422176 = score(doc=1826,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.93669677 = fieldWeight in 1826, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.078125 = fieldNorm(doc=1826)
    0.24422176 = weight(_text_:2f in 1826) [ClassicSimilarity], result of:
      0.24422176 = score(doc=1826,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.93669677 = fieldWeight in 1826, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.078125 = fieldNorm(doc=1826)
    0.24422176 = weight(_text_:2f in 1826) [ClassicSimilarity], result of:
      0.24422176 = score(doc=1826,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.93669677 = fieldWeight in 1826, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.078125 = fieldNorm(doc=1826)
    0.24422176 = weight(_text_:2f in 1826) [ClassicSimilarity], result of:
      0.24422176 = score(doc=1826,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.93669677 = fieldWeight in 1826, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.078125 = fieldNorm(doc=1826)
  0.5 = coord(5/10)

Source

http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CDQQFjAE&url=http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F3131107&ei=HzFWVYvGMsiNsgGTyoFI&usg=AFQjCNE2FHUeR9oQTQlNC4TPedv4Mo3DaQ&sig2=Rlzpr7a3BLZZkqZCXXN_IA&bvm=bv.93564037,d.bGg&cad=rja

0.42331773 = product of:
  0.84663546 = sum of:
    0.06512581 = product of:
      0.19537741 = sum of:
        0.19537741 = weight(_text_:3a in 230) [ClassicSimilarity], result of:
          0.19537741 = score(doc=230,freq=2.0), product of:
            0.2607266 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.030753274 = queryNorm
            0.7493574 = fieldWeight in 230, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0625 = fieldNorm(doc=230)
      0.33333334 = coord(1/3)
    0.19537741 = weight(_text_:2f in 230) [ClassicSimilarity], result of:
      0.19537741 = score(doc=230,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.7493574 = fieldWeight in 230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=230)
    0.19537741 = weight(_text_:2f in 230) [ClassicSimilarity], result of:
      0.19537741 = score(doc=230,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.7493574 = fieldWeight in 230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=230)
    0.19537741 = weight(_text_:2f in 230) [ClassicSimilarity], result of:
      0.19537741 = score(doc=230,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.7493574 = fieldWeight in 230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=230)
    0.19537741 = weight(_text_:2f in 230) [ClassicSimilarity], result of:
      0.19537741 = score(doc=230,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.7493574 = fieldWeight in 230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=230)
  0.5 = coord(5/10)

Source

https%3A%2F%2Ftannerlectures.utah.edu%2F_documents%2Fa-to-z%2Fp%2Fpopper80.pdf&usg=AOvVaw3f4QRTEH-OEBmoYr2J_c7H

0.26457357 = product of:
  0.52914715 = sum of:
    0.04070363 = product of:
      0.12211088 = sum of:
        0.12211088 = weight(_text_:3a in 4388) [ClassicSimilarity], result of:
          0.12211088 = score(doc=4388,freq=2.0), product of:
            0.2607266 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.030753274 = queryNorm
            0.46834838 = fieldWeight in 4388, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4388)
      0.33333334 = coord(1/3)
    0.12211088 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12211088 = score(doc=4388,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12211088 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12211088 = score(doc=4388,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12211088 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12211088 = score(doc=4388,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
    0.12211088 = weight(_text_:2f in 4388) [ClassicSimilarity], result of:
      0.12211088 = score(doc=4388,freq=2.0), product of:
        0.2607266 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.030753274 = queryNorm
        0.46834838 = fieldWeight in 4388, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4388)
  0.5 = coord(5/10)

Footnote

Vgl. unter: https://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwizweHljdbcAhVS16QKHXcFD9QQFjABegQICRAB&url=https%3A%2F%2Fwww.researchgate.net%2Fpublication%2F271200105_Die_Autonomie_des_Menschen_und_der_Maschine_-_gegenwartige_Definitionen_von_Autonomie_zwischen_philosophischem_Hintergrund_und_technologischer_Umsetzbarkeit_Redigierte_Version_der_Magisterarbeit_Karls&usg=AOvVaw06orrdJmFF2xbCCp_hL26q.

0.05224331 = product of:
  0.13060828 = sum of:
    0.005235487 = weight(_text_:information in 2565) [ClassicSimilarity], result of:
      0.005235487 = score(doc=2565,freq=2.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.09697737 = fieldWeight in 2565, 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=2565)
    0.015545071 = weight(_text_:retrieval in 2565) [ClassicSimilarity], result of:
      0.015545071 = score(doc=2565,freq=2.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.16710453 = fieldWeight in 2565, 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=2565)
    0.09941111 = weight(_text_:ranking in 2565) [ClassicSimilarity], result of:
      0.09941111 = score(doc=2565,freq=8.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.5976189 = fieldWeight in 2565, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2565)
    0.01041661 = product of:
      0.02083322 = sum of:
        0.02083322 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.02083322 = score(doc=2565,freq=2.0), product of:
            0.107692726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030753274 = queryNorm
            0.19345059 = fieldWeight in 2565, 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=2565)
      0.5 = coord(1/2)
  0.4 = coord(4/10)

Abstract

This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that PageRank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank's using a fixed small number of iterations; comparisons were performed using Kendall's tau on large domain datasets.

Date

16. 1.2016 10:22:28

Source

http://chato.cl/papers/baeza06_general_pagerank_damping_functions_link_ranking.pdf [Proceedings of the ACM Special Interest Group on Information Retrieval (SIGIR) Conference, SIGIR'06, August 6-10, 2006, Seattle, Washington, USA]

0.033833336 = product of:
  0.11277778 = sum of:
    0.00837678 = weight(_text_:information in 1944) [ClassicSimilarity], result of:
      0.00837678 = score(doc=1944,freq=2.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.1551638 = fieldWeight in 1944, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=1944)
    0.024872115 = weight(_text_:retrieval in 1944) [ClassicSimilarity], result of:
      0.024872115 = score(doc=1944,freq=2.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.26736724 = fieldWeight in 1944, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=1944)
    0.07952888 = weight(_text_:ranking in 1944) [ClassicSimilarity], result of:
      0.07952888 = score(doc=1944,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.47809508 = fieldWeight in 1944, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0625 = fieldNorm(doc=1944)
  0.3 = coord(3/10)

Abstract

For the last ten years Stephen Robertson has been a researcher at the Microsoft Research Laboratory. He previously spent twenty years at City University, where he started the Centre for Interactive Systems Research and still retains a part-time professorship. His work on probabilistic theory underpins the algorithms behind every serious search engine today. In his talk, he gave a non-technical overview of some current concerns of core IR research, in particular on the use of different kinds of evidence in searching and ranking.

0.031742394 = product of:
  0.105807975 = sum of:
    0.017769832 = weight(_text_:information in 922) [ClassicSimilarity], result of:
      0.017769832 = score(doc=922,freq=4.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.3291521 = fieldWeight in 922, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=922)
    0.03730817 = weight(_text_:retrieval in 922) [ClassicSimilarity], result of:
      0.03730817 = score(doc=922,freq=2.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.40105087 = fieldWeight in 922, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.09375 = fieldNorm(doc=922)
    0.05072997 = product of:
      0.10145994 = sum of:
        0.10145994 = weight(_text_:evaluation in 922) [ClassicSimilarity], result of:
          0.10145994 = score(doc=922,freq=4.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.7865064 = fieldWeight in 922, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.09375 = fieldNorm(doc=922)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Source

Information Research. 8(2003), no.3

0.02947834 = product of:
  0.098261125 = sum of:
    0.018731048 = weight(_text_:information in 3097) [ClassicSimilarity], result of:
      0.018731048 = score(doc=3097,freq=10.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.3469568 = fieldWeight in 3097, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=3097)
    0.055615738 = weight(_text_:retrieval in 3097) [ClassicSimilarity], result of:
      0.055615738 = score(doc=3097,freq=10.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.59785134 = fieldWeight in 3097, 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=3097)
    0.023914335 = product of:
      0.04782867 = sum of:
        0.04782867 = weight(_text_:evaluation in 3097) [ClassicSimilarity], result of:
          0.04782867 = score(doc=3097,freq=2.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.37076265 = fieldWeight in 3097, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.0625 = fieldNorm(doc=3097)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

Das Projekt "Aufbau einer Infrastruktur für Information Retrieval-Evaluationen" (AIIRE) bietet eine Softwareinfrastruktur zur Unterstützung von Information Retrieval-Evaluationen (IR-Evaluationen). Die Infrastruktur basiert auf einem Tool-Kit, das bei GESIS im Rahmen des DFG-Projekts IRM entwickelt wurde. Ziel ist es, ein System zu bieten, das zur Forschung und Lehre am Fachbereich Media für IR-Evaluationen genutzt werden kann. This paper describes some aspects of a project called "Aufbau einer Infrastruktur für Information Retrieval-Evaluationen" (AIIRE). Its goal is to build a software-infrastructure which supports the evaluation of information retrieval algorithms.

0.02862323 = product of:
  0.095410764 = sum of:
    0.011846555 = weight(_text_:information in 2862) [ClassicSimilarity], result of:
      0.011846555 = score(doc=2862,freq=4.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.21943474 = fieldWeight in 2862, 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=2862)
    0.04974423 = weight(_text_:retrieval in 2862) [ClassicSimilarity], result of:
      0.04974423 = score(doc=2862,freq=8.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.5347345 = fieldWeight in 2862, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=2862)
    0.03381998 = product of:
      0.06763996 = sum of:
        0.06763996 = weight(_text_:evaluation in 2862) [ClassicSimilarity], result of:
          0.06763996 = score(doc=2862,freq=4.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.5243376 = fieldWeight in 2862, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.0625 = fieldNorm(doc=2862)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

This paper evaluates the use of an explicit domain ontology in an information retrieval tool. The evaluation compares the performance of ontology-enhanced retrieval with keyword retrieval for a fixed set of queries across several data sets. The robustness of the IR approach is assessed by comparing the performance of the tool on the original data set with that on previously unseen data.

0.028473733 = product of:
  0.09491244 = sum of:
    0.008884916 = weight(_text_:information in 1173) [ClassicSimilarity], result of:
      0.008884916 = score(doc=1173,freq=4.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.16457605 = fieldWeight in 1173, 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=1173)
    0.026380861 = weight(_text_:retrieval in 1173) [ClassicSimilarity], result of:
      0.026380861 = score(doc=1173,freq=4.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.2835858 = fieldWeight in 1173, 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=1173)
    0.059646662 = weight(_text_:ranking in 1173) [ClassicSimilarity], result of:
      0.059646662 = score(doc=1173,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.35857132 = fieldWeight in 1173, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.046875 = fieldNorm(doc=1173)
  0.3 = coord(3/10)

Abstract

Popular commercial on-line services such as Google, e-Bay, Amazon, and Netflix have evolved quickly over the last decade to help people find what they want, developing information retrieval strategies such as usefully ranked results, spelling correction, and recommender systems. Online library catalogs (OPACs), in contrast, have changed little and are notoriously difficult for patrons to use (University of California Libraries, 2005). Over the past year (June 2005 to the present), the Melvyl Recommender Project (California Digital Library, 2005) has been exploring methods and feasibility of closing the gap between features that library patrons want and have come to expect from information retrieval systems and what libraries are currently equipped to deliver. The project team conducted exploratory work in five topic areas: relevance ranking, auto-correction, use of a text-based discovery system, user interface strategies, and recommending. This article focuses specifically on the recommending portion of the project and potential extensions to that work.

0.024227323 = product of:
  0.08075774 = sum of:
    0.0090681305 = weight(_text_:information in 2861) [ClassicSimilarity], result of:
      0.0090681305 = score(doc=2861,freq=6.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.16796975 = fieldWeight in 2861, 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=2861)
    0.02198405 = weight(_text_:retrieval in 2861) [ClassicSimilarity], result of:
      0.02198405 = score(doc=2861,freq=4.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.23632148 = fieldWeight in 2861, 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=2861)
    0.049705554 = weight(_text_:ranking in 2861) [ClassicSimilarity], result of:
      0.049705554 = score(doc=2861,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.29880944 = fieldWeight in 2861, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2861)
  0.3 = coord(3/10)

Abstract

Today's conventional search engines hardly do provide the essential content relevant to the user's search query. This is because the context and semantics of the request made by the user is not analyzed to the full extent. So here the need for a semantic web search arises. SWS is upcoming in the area of web search which combines Natural Language Processing and Artificial Intelligence. The objective of the work done here is to design, develop and implement a semantic search engine- SIEU(Semantic Information Extraction in University Domain) confined to the university domain. SIEU uses ontology as a knowledge base for the information retrieval process. It is not just a mere keyword search. It is one layer above what Google or any other search engines retrieve by analyzing just the keywords. Here the query is analyzed both syntactically and semantically. The developed system retrieves the web results more relevant to the user query through keyword expansion. The results obtained here will be accurate enough to satisfy the request made by the user. The level of accuracy will be enhanced since the query is analyzed semantically. The system will be of great use to the developers and researchers who work on web. The Google results are re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which fetches more apt results for the user query.

0.02208383 = product of:
  0.073612764 = sum of:
    0.010365736 = weight(_text_:information in 4330) [ClassicSimilarity], result of:
      0.010365736 = score(doc=4330,freq=4.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.1920054 = fieldWeight in 4330, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4330)
    0.048663773 = weight(_text_:retrieval in 4330) [ClassicSimilarity], result of:
      0.048663773 = score(doc=4330,freq=10.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.5231199 = fieldWeight in 4330, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4330)
    0.014583254 = product of:
      0.029166508 = sum of:
        0.029166508 = weight(_text_:22 in 4330) [ClassicSimilarity], result of:
          0.029166508 = score(doc=4330,freq=2.0), product of:
            0.107692726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030753274 = queryNorm
            0.2708308 = fieldWeight in 4330, 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=4330)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

One vision of the Semantic Web is that it will be much like the Web we know today, except that documents will be enriched by annotations in machine understandable markup. These annotations will provide metadata about the documents as well as machine interpretable statements capturing some of the meaning of document content. We discuss how the information retrieval paradigm might be recast in such an environment. We suggest that retrieval can be tightly bound to inference. Doing so makes today's Web search engines useful to Semantic Web inference engines, and causes improvements in either retrieval or inference to lead directly to improvements in the other.

Date

12. 2.2011 17:35:22

0.020342728 = product of:
  0.06780909 = sum of:
    0.0125651695 = weight(_text_:information in 3829) [ClassicSimilarity], result of:
      0.0125651695 = score(doc=3829,freq=8.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.23274569 = fieldWeight in 3829, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3829)
    0.03730817 = weight(_text_:retrieval in 3829) [ClassicSimilarity], result of:
      0.03730817 = score(doc=3829,freq=8.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.40105087 = fieldWeight in 3829, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3829)
    0.017935753 = product of:
      0.035871506 = sum of:
        0.035871506 = weight(_text_:evaluation in 3829) [ClassicSimilarity], result of:
          0.035871506 = score(doc=3829,freq=2.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.278072 = fieldWeight in 3829, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.046875 = fieldNorm(doc=3829)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

In this thesis, we present an ontology-based information extraction and retrieval system and its application to soccer domain. In general, we deal with three issues in semantic search, namely, usability, scalability and retrieval performance. We propose a keyword-based semantic retrieval approach. The performance of the system is improved considerably using domain-specific information extraction, inference and rules. Scalability is achieved by adapting a semantic indexing approach. The system is implemented using the state-of-the-art technologies in SemanticWeb and its performance is evaluated against traditional systems as well as the query expansion methods. Furthermore, a detailed evaluation is provided to observe the performance gain due to domain-specific information extraction and inference. Finally, we show how we use semantic indexing to solve simple structural ambiguities.

Source

Information Systems. 37(2012) no. 4, S.294-305

0.020089902 = product of:
  0.06696634 = sum of:
    0.0110814385 = weight(_text_:information in 1154) [ClassicSimilarity], result of:
      0.0110814385 = score(doc=1154,freq=14.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.20526241 = fieldWeight in 1154, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=1154)
    0.03517448 = weight(_text_:retrieval in 1154) [ClassicSimilarity], result of:
      0.03517448 = score(doc=1154,freq=16.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.37811437 = fieldWeight in 1154, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03125 = fieldNorm(doc=1154)
    0.020710424 = product of:
      0.041420847 = sum of:
        0.041420847 = weight(_text_:evaluation in 1154) [ClassicSimilarity], result of:
          0.041420847 = score(doc=1154,freq=6.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.3210899 = fieldWeight in 1154, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.03125 = fieldNorm(doc=1154)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

In this thesis, we will present methods for introducing ontologies in information retrieval. The main hypothesis is that the inclusion of conceptual knowledge such as ontologies in the information retrieval process can contribute to the solution of major problems currently found in information retrieval. This utilization of ontologies has a number of challenges. Our focus is on the use of similarity measures derived from the knowledge about relations between concepts in ontologies, the recognition of semantic information in texts and the mapping of this knowledge into the ontologies in use, as well as how to fuse together the ideas of ontological similarity and ontological indexing into a realistic information retrieval scenario. To achieve the recognition of semantic knowledge in a text, shallow natural language processing is used during indexing that reveals knowledge to the level of noun phrases. Furthermore, we briefly cover the identification of semantic relations inside and between noun phrases, as well as discuss which kind of problems are caused by an increase in compoundness with respect to the structure of concepts in the evaluation of queries. Measuring similarity between concepts based on distances in the structure of the ontology is discussed. In addition, a shared nodes measure is introduced and, based on a set of intuitive similarity properties, compared to a number of different measures. In this comparison the shared nodes measure appears to be superior, though more computationally complex. Some of the major problems of shared nodes which relate to the way relations differ with respect to the degree they bring the concepts they connect closer are discussed. A generalized measure called weighted shared nodes is introduced to deal with these problems. Finally, the utilization of concept similarity in query evaluation is discussed. A semantic expansion approach that incorporates concept similarity is introduced and a generalized fuzzy set retrieval model that applies expansion during query evaluation is presented. While not commonly used in present information retrieval systems, it appears that the fuzzy set model comprises the flexibility needed when generalizing to an ontology-based retrieval model and, with the introduction of a hierarchical fuzzy aggregation principle, compound concepts can be handled in a straightforward and natural manner.

0.02007309 = product of:
  0.100365445 = sum of:
    0.03077767 = weight(_text_:retrieval in 1150) [ClassicSimilarity], result of:
      0.03077767 = score(doc=1150,freq=4.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.33085006 = fieldWeight in 1150, 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=1150)
    0.069587775 = weight(_text_:ranking in 1150) [ClassicSimilarity], result of:
      0.069587775 = score(doc=1150,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.4183332 = fieldWeight in 1150, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1150)
  0.2 = coord(2/10)

Abstract

Voice search is becoming a popular mode for interacting with search engines. As a result, research has gone into building better voice transcription engines, interfaces, and search engines that better handle inherent verbosity of queries. However, when one considers its use by non- native speakers of English, another aspect that becomes important is the formulation of the query by users. In this paper, we present the results of a preliminary study that we conducted with non-native English speakers who formulate queries for given retrieval tasks. Our results show that the current search engines are sensitive in their rankings to the query formulation, and thus highlights the need for developing more robust ranking methods.

0.020047983 = product of:
  0.05011996 = sum of:
    0.0069258986 = weight(_text_:information in 4232) [ClassicSimilarity], result of:
      0.0069258986 = score(doc=4232,freq=14.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.128289 = fieldWeight in 4232, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.0077725356 = weight(_text_:retrieval in 4232) [ClassicSimilarity], result of:
      0.0077725356 = score(doc=4232,freq=2.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.08355226 = fieldWeight in 4232, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.024852777 = weight(_text_:ranking in 4232) [ClassicSimilarity], result of:
      0.024852777 = score(doc=4232,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.14940472 = fieldWeight in 4232, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.01953125 = fieldNorm(doc=4232)
    0.010568744 = product of:
      0.021137487 = sum of:
        0.021137487 = weight(_text_:evaluation in 4232) [ClassicSimilarity], result of:
          0.021137487 = score(doc=4232,freq=4.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.1638555 = fieldWeight in 4232, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.01953125 = fieldNorm(doc=4232)
      0.5 = coord(1/2)
  0.4 = coord(4/10)

Abstract

After the launch of the World Wide Web, it became clear that searching documentson the Web would not be trivial. Well-known engines to search the web, like Google, focus on search in web documents using keywords. The documents are structured and indexed to ensure keywords match documents as accurately as possible. However, searching by keywords does not always suice. It is oen the case that users do not know exactly how to formulate the search query or which keywords guarantee retrieving the most relevant documents. Besides that, it occurs that users rather want to browse information than looking up something specific. It turned out that there is need for systems that enable more interactivity and facilitate the gradual refinement of search queries to explore the Web. Users expect more from the Web because the short keyword-based queries they pose during search, do not suffice for all cases. On top of that, the Web is changing structurally. The Web comprises, apart from a collection of documents, more and more linked data, pieces of information structured so they can be processed by machines. The consequently applied semantics allow users to exactly indicate machines their search intentions. This is made possible by describing data following controlled vocabularies, concept lists composed by experts, published uniquely identifiable on the Web. Even so, it is still not trivial to explore data on the Web. There is a large variety of vocabularies and various data sources use different terms to identify the same concepts.
This PhD-thesis describes how to effectively explore linked data on the Web. The main focus is on scenarios where users want to discover relationships between resources rather than finding out more about something specific. Searching for a specific document or piece of information fits in the theoretical framework of information retrieval and is associated with exploratory search. Exploratory search goes beyond 'looking up something' when users are seeking more detailed understanding, further investigation or navigation of the initial search results. The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. Queries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research. Our first technique focuses on the interactive visualization of search results. Linked data resources can be brought in relation with each other at will. This leads to complex and diverse graphs structures. Our technique facilitates navigation and supports a workflow starting from a broad overview on the data and allows narrowing down until the desired level of detail to then broaden again. To validate the flow, two visualizations where implemented and presented to test-users. The users judged the usability of the visualizations, how the visualizations fit in the workflow and to which degree their features seemed useful for the exploration of linked data.
The ideas behind exploratory search and querying linked data merge when it comes to the way knowledge is represented and indexed by machines - how data is structured and stored for optimal searchability. eries and information should be aligned to facilitate that searches also reveal connections between results. This implies that they take into account the same semantic entities, relevant at that moment. To realize this, we research three techniques that are evaluated one by one in an experimental set-up to assess how well they succeed in their goals. In the end, the techniques are applied to a practical use case that focuses on forming a bridge between the Web and the use of digital libraries in scientific research.
Our first technique focuses on the interactive visualization of search results. Linked data resources can be brought in relation with each other at will. This leads to complex and diverse graphs structures. Our technique facilitates navigation and supports a workflow starting from a broad overview on the data and allows narrowing down until the desired level of detail to then broaden again. To validate the flow, two visualizations where implemented and presented to test-users. The users judged the usability of the visualizations, how the visualizations fit in the workflow and to which degree their features seemed useful for the exploration of linked data. There is a difference in the way users interact with resources, visually or textually, and how resources are represented for machines to be processed by algorithms. This difference complicates bridging the users' intents and machine executable queries. It is important to implement this 'translation' mechanism to impact the search as favorable as possible in terms of performance, complexity and accuracy. To do this, we explain a second technique, that supports such a bridging component. Our second technique is developed around three features that support the search process: looking up, relating and ranking resources. The main goal is to ensure that resources in the results are as precise and relevant as possible. During the evaluation of this technique, we did not only look at the precision of the search results but also investigated how the effectiveness of the search evolved while the user executed certain actions sequentially.
When we speak about finding relationships between resources, it is necessary to dive deeper in the structure. The graph structure of linked data where the semantics give meaning to the relationships between resources enable the execution of pathfinding algorithms. The assigned weights and heuristics are base components of such algorithms and ultimately define (the order) which resources are included in a path. These paths explain indirect connections between resources. Our third technique proposes an algorithm that optimizes the choice of resources in terms of serendipity. Some optimizations guard the consistence of candidate-paths where the coherence of consecutive connections is maximized to avoid trivial and too arbitrary paths. The implementation uses the A* algorithm, the de-facto reference when it comes to heuristically optimized minimal cost paths. The effectiveness of paths was measured based on common automatic metrics and surveys where the users could indicate their preference for paths, generated each time in a different way. Finally, all our techniques are applied to a use case about publications in digital libraries where they are aligned with information about scientific conferences and researchers. The application to this use case is a practical example because the different aspects of exploratory search come together. In fact, the techniques also evolved from the experiences when implementing the use case. Practical details about the semantic model are explained and the implementation of the search system is clarified module by module. The evaluation positions the result, a prototype of a tool to explore scientific publications, researchers and conferences next to some important alternatives.

0.01980486 = product of:
  0.0660162 = sum of:
    0.006347691 = weight(_text_:information in 93) [ClassicSimilarity], result of:
      0.006347691 = score(doc=93,freq=6.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.11757882 = fieldWeight in 93, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
    0.04920599 = weight(_text_:ranking in 93) [ClassicSimilarity], result of:
      0.04920599 = score(doc=93,freq=4.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.29580626 = fieldWeight in 93, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
    0.0104625225 = product of:
      0.020925045 = sum of:
        0.020925045 = weight(_text_:evaluation in 93) [ClassicSimilarity], result of:
          0.020925045 = score(doc=93,freq=2.0), product of:
            0.12900078 = queryWeight, product of:
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.030753274 = queryNorm
            0.16220866 = fieldWeight in 93, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1947007 = idf(docFreq=1811, maxDocs=44218)
              0.02734375 = fieldNorm(doc=93)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

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.

0.018718302 = product of:
  0.062394336 = sum of:
    0.010470974 = weight(_text_:information in 611) [ClassicSimilarity], result of:
      0.010470974 = score(doc=611,freq=2.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.19395474 = fieldWeight in 611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=611)
    0.031090142 = weight(_text_:retrieval in 611) [ClassicSimilarity], result of:
      0.031090142 = score(doc=611,freq=2.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.33420905 = fieldWeight in 611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=611)
    0.02083322 = product of:
      0.04166644 = sum of:
        0.04166644 = weight(_text_:22 in 611) [ClassicSimilarity], result of:
          0.04166644 = score(doc=611,freq=2.0), product of:
            0.107692726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030753274 = queryNorm
            0.38690117 = fieldWeight in 611, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=611)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Content

Präsentation zum Vortrag anlässlich des 98. Deutscher Bibliothekartag in Erfurt: Ein neuer Blick auf Bibliotheken; TK10: Information erschließen und recherchieren Inhalte erschließen - mit neuen Tools

Date

22. 8.2009 12:54:24

Theme

Klassifikationssysteme im Online-Retrieval

0.017657416 = product of:
  0.05885805 = sum of:
    0.014048288 = weight(_text_:information in 3261) [ClassicSimilarity], result of:
      0.014048288 = score(doc=3261,freq=10.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.2602176 = fieldWeight in 3261, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=3261)
    0.032309826 = weight(_text_:retrieval in 3261) [ClassicSimilarity], result of:
      0.032309826 = score(doc=3261,freq=6.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.34732026 = fieldWeight in 3261, 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=3261)
    0.012499932 = product of:
      0.024999864 = sum of:
        0.024999864 = weight(_text_:22 in 3261) [ClassicSimilarity], result of:
          0.024999864 = score(doc=3261,freq=2.0), product of:
            0.107692726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.030753274 = queryNorm
            0.23214069 = fieldWeight in 3261, 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=3261)
      0.5 = coord(1/2)
  0.3 = coord(3/10)

Abstract

Ontologies improve IR systems regarding its retrieval and presentation of information, which make the task of finding information more effective, efficient, and interactive. In this paper we argue that ontologies also greatly improve the engineering of such systems. We created a framework that uses ontology to drive the process of engineering an IR system. We developed a prototype that shows how a domain specialist without knowledge in the IR field can build an IR system with interactive components. The resulting system provides support for users not only to find their information needs but also to extend their state of knowledge. This way, our approach to ontology-enabled information retrieval addresses both the engineering aspect described here and also the usability aspect described elsewhere.

Date

28.11.2016 12:43:22

0.017593661 = product of:
  0.087968305 = sum of:
    0.022162877 = weight(_text_:information in 5393) [ClassicSimilarity], result of:
      0.022162877 = score(doc=5393,freq=14.0), product of:
        0.05398669 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.030753274 = queryNorm
        0.41052482 = fieldWeight in 5393, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=5393)
    0.06580543 = weight(_text_:retrieval in 5393) [ClassicSimilarity], result of:
      0.06580543 = score(doc=5393,freq=14.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.7073872 = fieldWeight in 5393, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=5393)
  0.2 = coord(2/10)

LCSH

Information storage and retrieval systems / Research / Congresses
Information retrieval / Research / Congresses

RSWK

Information retrieval / Kongress / Aberdeen <1997>

Subject

Information storage and retrieval systems / Research / Congresses
Information retrieval / Research / Congresses
Information retrieval / Kongress / Aberdeen <1997>

0.017205505 = product of:
  0.086027525 = sum of:
    0.026380861 = weight(_text_:retrieval in 1557) [ClassicSimilarity], result of:
      0.026380861 = score(doc=1557,freq=4.0), product of:
        0.093026035 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.030753274 = queryNorm
        0.2835858 = fieldWeight in 1557, 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=1557)
    0.059646662 = weight(_text_:ranking in 1557) [ClassicSimilarity], result of:
      0.059646662 = score(doc=1557,freq=2.0), product of:
        0.16634533 = queryWeight, product of:
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.030753274 = queryNorm
        0.35857132 = fieldWeight in 1557, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4090285 = idf(docFreq=537, maxDocs=44218)
          0.046875 = fieldNorm(doc=1557)
  0.2 = coord(2/10)

Abstract

In this paper, we present a multimodal Recurrent Neural Network (m-RNN) model for generating novel sentence descriptions to explain the content of images. It directly models the probability distribution of generating a word given previous words and the image. Image descriptions are generated by sampling from this distribution. The model consists of two sub-networks: a deep recurrent neural network for sentences and a deep convolutional network for images. These two sub-networks interact with each other in a multimodal layer to form the whole m-RNN model. The effectiveness of our model is validated on three benchmark datasets (IAPR TC-12 [8], Flickr 8K [28], and Flickr 30K [13]). Our model outperforms the state-of-the-art generative method. In addition, the m-RNN model can be applied to retrieval tasks for retrieving images or sentences, and achieves significant performance improvement over the state-of-the-art methods which directly optimize the ranking objective function for retrieval.