Search (37 results, page 1 of 2)

  • × theme_ss:"Retrievalalgorithmen"
  • × year_i:[2000 TO 2010}
  1. Mandl, T.: Tolerantes Information Retrieval : Neuronale Netze zur Erhöhung der Adaptivität und Flexibilität bei der Informationssuche (2001) 0.01 
    0.0054112542 = product of:
  0.048701286 = sum of:
    0.019504976 = weight(_text_:formale in 5965) [ClassicSimilarity], result of:
      0.019504976 = score(doc=5965,freq=2.0), product of:
        0.13942613 = queryWeight, product of:
          6.330911 = idf(docFreq=213, maxDocs=44218)
          0.022023074 = queryNorm
        0.1398947 = fieldWeight in 5965, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.330911 = idf(docFreq=213, maxDocs=44218)
          0.015625 = fieldNorm(doc=5965)
    0.02919631 = weight(_text_:komponente in 5965) [ClassicSimilarity], result of:
      0.02919631 = score(doc=5965,freq=2.0), product of:
        0.17058289 = queryWeight, product of:
          7.7456436 = idf(docFreq=51, maxDocs=44218)
          0.022023074 = queryNorm
        0.17115615 = fieldWeight in 5965, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.7456436 = idf(docFreq=51, maxDocs=44218)
          0.015625 = fieldNorm(doc=5965)
  0.11111111 = coord(2/18)
    Footnote
    Rez. in: nfd - Information 54(2003) H.6, S.379-380 (U. Thiel): "Kannte G. Salton bei der Entwicklung des Vektorraummodells die kybernetisch orientierten Versuche mit assoziativen Speicherstrukturen? An diese und ähnliche Vermutungen, die ich vor einigen Jahren mit Reginald Ferber und anderen Kollegen diskutierte, erinnerte mich die Thematik des vorliegenden Buches. Immerhin lässt sich feststellen, dass die Vektorrepräsentation eine genial einfache Darstellung sowohl der im Information Retrieval (IR) als grundlegende Datenstruktur benutzten "inverted files" als auch der assoziativen Speichermatrizen darstellt, die sich im Laufe der Zeit Über Perzeptrons zu Neuronalen Netzen (NN) weiterentwickelten. Dieser formale Zusammenhang stimulierte in der Folge eine Reihe von Ansätzen, die Netzwerke im Retrieval zu verwenden, wobei sich, wie auch im vorliegenden Band, hybride Ansätze, die Methoden aus beiden Disziplinen kombinieren, als sehr geeignet erweisen. Aber der Reihe nach... Das Buch wurde vom Autor als Dissertation beim Fachbereich IV "Sprachen und Technik" der Universität Hildesheim eingereicht und resultiert aus einer Folge von Forschungsbeiträgen zu mehreren Projekten, an denen der Autor in der Zeit von 1995 bis 2000 an verschiedenen Standorten beteiligt war. Dies erklärt die ungewohnte Breite der Anwendungen, Szenarien und Domänen, in denen die Ergebnisse gewonnen wurden. So wird das in der Arbeit entwickelte COSIMIR Modell (COgnitive SIMilarity learning in Information Retrieval) nicht nur anhand der klassischen Cranfield-Kollektion evaluiert, sondern auch im WING-Projekt der Universität Regensburg im Faktenretrieval aus einer Werkstoffdatenbank eingesetzt. Weitere Versuche mit der als "Transformations-Netzwerk" bezeichneten Komponente, deren Aufgabe die Abbildung von Gewichtungsfunktionen zwischen zwei Termräumen ist, runden das Spektrum der Experimente ab. Aber nicht nur die vorgestellten Resultate sind vielfältig, auch der dem Leser angebotene "State-of-the-Art"-Überblick fasst in hoch informativer Breite Wesentliches aus den Gebieten IR und NN zusammen und beleuchtet die Schnittpunkte der beiden Bereiche. So werden neben den Grundlagen des Text- und Faktenretrieval die Ansätze zur Verbesserung der Adaptivität und zur Beherrschung von Heterogenität vorgestellt, während als Grundlagen Neuronaler Netze neben einer allgemeinen Einführung in die Grundbegriffe u.a. das Backpropagation-Modell, KohonenNetze und die Adaptive Resonance Theory (ART) geschildert werden. Einweiteres Kapitel stellt die bisherigen NN-orientierten Ansätze im IR vor und rundet den Abriss der relevanten Forschungslandschaft ab. Als Vorbereitung der Präsentation des COSIMIR-Modells schiebt der Autor an dieser Stelle ein diskursives Kapitel zum Thema Heterogenität im IR ein, wodurch die Ziele und Grundannahmen der Arbeit noch einmal reflektiert werden. Als Dimensionen der Heterogenität werden der Objekttyp, die Qualität der Objekte und ihrer Erschließung und die Mehrsprachigkeit genannt. Wenn auch diese Systematik im Wesentlichen die Akzente auf Probleme aus den hier tangierten Projekten legt, und weniger eine umfassende Aufbereitung z.B. der Literatur zum Problem der Relevanz anstrebt, ist sie dennoch hilfreich zum Verständnis der in den nachfolgenden Kapitel oft nur implizit angesprochenen Designentscheidungen bei der Konzeption der entwickelten Prototypen. Der Ansatz, Heterogenität durch Transformationen zu behandeln, wird im speziellen Kontext der NN konkretisiert, wobei andere Möglichkeiten, die z.B. Instrumente der Logik und Probabilistik einzusetzen, nur kurz diskutiert werden. Eine weitergehende Analyse hätte wohl auch den Rahmen der Arbeit zu weit gespannt,
  2. Mutschke, P.: Autorennetzwerke : Verfahren zur Netzwerkanalyse als Mehrwertdienste für Informationssysteme (2004) 0.00 
    0.0028329256 = product of:
  0.05099266 = sum of:
    0.05099266 = weight(_text_:virtuelle in 4050) [ClassicSimilarity], result of:
      0.05099266 = score(doc=4050,freq=2.0), product of:
        0.13015614 = queryWeight, product of:
          5.90999 = idf(docFreq=325, maxDocs=44218)
          0.022023074 = queryNorm
        0.39178067 = fieldWeight in 4050, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.90999 = idf(docFreq=325, maxDocs=44218)
          0.046875 = fieldNorm(doc=4050)
  0.055555556 = coord(1/18)
    Abstract
    Virtuelle Bibliotheken enthalten eine Fülle an Informationen, die in ihrer Vielfalt und Tiefe von Standardsuchmaschinen nicht erschöpfend erfasst wird. Der Arbeitsbericht informiert über Entwicklungen am IZ, die darauf abzielen, Wissen über das Interaktionsgeschehen in wissenschaftlichen Communities und den sozialen Status ihrer Akteure für das Retrieval auszunutzen. Grundlage hierfür sind soziale Netzwerke, die sich durch Kooperation der wissenschaftlichen Akteure konstituieren und in den Dokumenten der Datenbasis z.B. als Koautorbeziehungen repräsentiert sind (Autorennetzwerke). Die in dem Bericht beschriebenen Studien zur Small-World-Topologie von Autorennetzwerken zeigen, dass diese Netzwerke ein erhebliches Potential für Informationssysteme haben. Der Bericht diskutiert Szenarios, die beschreiben, wie Autorennetzwerke und hier insbesondere das Konzept der Akteurszentralität für die Informationssuche in Datenbanken sinnvoll genutzt werden können. Kernansatz dieser Retrievalmodelle ist die Suche nach Experten und das Ranking von Dokumenten auf der Basis der Zentralität von Autoren in Autorennetzwerken.
  3. Carpineto, C.; Romano, G.: Order-theoretical ranking (2000) 0.00 
    0.0027090246 = product of:
  0.04876244 = sum of:
    0.04876244 = weight(_text_:formale in 4766) [ClassicSimilarity], result of:
      0.04876244 = score(doc=4766,freq=2.0), product of:
        0.13942613 = queryWeight, product of:
          6.330911 = idf(docFreq=213, maxDocs=44218)
          0.022023074 = queryNorm
        0.34973675 = fieldWeight in 4766, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.330911 = idf(docFreq=213, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4766)
  0.055555556 = coord(1/18)
    Theme
    Formale Begriffsanalyse
  4. Kulyukin, V.A.; Settle, A.: Ranked retrieval with semantic networks and vector spaces (2001) 0.00 
    0.0024194021 = product of:
  0.043549236 = sum of:
    0.043549236 = product of:
      0.08709847 = sum of:
        0.08709847 = weight(_text_:networks in 6934) [ClassicSimilarity], result of:
          0.08709847 = score(doc=6934,freq=8.0), product of:
            0.10416738 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.022023074 = queryNorm
            0.8361396 = fieldWeight in 6934, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0625 = fieldNorm(doc=6934)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Abstract
    The equivalence of semantic networks with spreading activation and vector spaces with dot product is investigated under ranked retrieval. Semantic networks are viewed as networks of concepts organized in terms of abstraction and packaging relations. It is shown that the two models can be effectively constructed from each other. A formal method is suggested to analyze the models in terms of their relative performance in the same universe of objects
  5. Zhang, D.; Dong, Y.: ¬An effective algorithm to rank Web resources (2000) 0.00 
    0.0021169768 = product of:
  0.03810558 = sum of:
    0.03810558 = product of:
      0.07621116 = sum of:
        0.07621116 = weight(_text_:networks in 3662) [ClassicSimilarity], result of:
          0.07621116 = score(doc=3662,freq=2.0), product of:
            0.10416738 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.022023074 = queryNorm
            0.73162216 = fieldWeight in 3662, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.109375 = fieldNorm(doc=3662)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Source
    Computer networks. 33(2000) nos.1/6, S.449-455
  6. Archuby, C.G.: Interfaces se recuperacion para catalogos en linea con salidas ordenadas por probable relevancia (2000) 0.00 
    0.0011827962 = product of:
  0.021290332 = sum of:
    0.021290332 = product of:
      0.042580664 = sum of:
        0.042580664 = weight(_text_:29 in 5727) [ClassicSimilarity], result of:
          0.042580664 = score(doc=5727,freq=4.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.5496386 = fieldWeight in 5727, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.078125 = fieldNorm(doc=5727)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    29. 1.1996 18:23:13
    Source
    Ciencia da informacao. 29(2000) no.3, S.5-13
  7. Crestani, F.: Combination of similarity measures for effective spoken document retrieval (2003) 0.00 
    0.0011709085 = product of:
  0.021076351 = sum of:
    0.021076351 = product of:
      0.042152703 = sum of:
        0.042152703 = weight(_text_:29 in 4690) [ClassicSimilarity], result of:
          0.042152703 = score(doc=4690,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.5441145 = fieldWeight in 4690, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.109375 = fieldNorm(doc=4690)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Source
    Journal of information science. 29(2003) no.2, S.87-96
  8. Li, J.; Willett, P.: ArticleRank : a PageRank-based alternative to numbers of citations for analysing citation networks (2009) 0.00 
    0.0010692347 = product of:
  0.019246224 = sum of:
    0.019246224 = product of:
      0.03849245 = sum of:
        0.03849245 = weight(_text_:networks in 751) [ClassicSimilarity], result of:
          0.03849245 = score(doc=751,freq=4.0), product of:
            0.10416738 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.022023074 = queryNorm
            0.369525 = fieldWeight in 751, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=751)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Abstract
    Purpose - The purpose of this paper is to suggest an alternative to the widely used Times Cited criterion for analysing citation networks. The approach involves taking account of the natures of the papers that cite a given paper, so as to differentiate between papers that attract the same number of citations. Design/methodology/approach - ArticleRank is an algorithm that has been derived from Google's PageRank algorithm to measure the influence of journal articles. ArticleRank is applied to two datasets - a citation network based on an early paper on webometrics, and a self-citation network based on the 19 most cited papers in the Journal of Documentation - using citation data taken from the Web of Knowledge database. Findings - ArticleRank values provide a different ranking of a set of papers from that provided by the corresponding Times Cited values, and overcomes the inability of the latter to differentiate between papers with the same numbers of citations. The difference in rankings between Times Cited and ArticleRank is greatest for the most heavily cited articles in a dataset. Originality/value - This is a novel application of the PageRank algorithm.
  9. Okada, M.; Ando, K.; Lee, S.S.; Hayashi, Y.; Aoe, J.I.: ¬An efficient substring search method by using delayed keyword extraction (2001) 0.00 
    0.0010036358 = product of:
  0.018065445 = sum of:
    0.018065445 = product of:
      0.03613089 = sum of:
        0.03613089 = weight(_text_:29 in 6415) [ClassicSimilarity], result of:
          0.03613089 = score(doc=6415,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.46638384 = fieldWeight in 6415, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.09375 = fieldNorm(doc=6415)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    29. 3.2002 17:24:03
  10. Ding, Y.; Yan, E.; Frazho, A.; Caverlee, J.: PageRank for ranking authors in co-citation networks (2009) 0.00 
    9.072757E-4 = product of:
  0.016330963 = sum of:
    0.016330963 = product of:
      0.032661926 = sum of:
        0.032661926 = weight(_text_:networks in 3161) [ClassicSimilarity], result of:
          0.032661926 = score(doc=3161,freq=2.0), product of:
            0.10416738 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.022023074 = queryNorm
            0.31355235 = fieldWeight in 3161, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=3161)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
  11. Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000) 0.00 
    7.7358366E-4 = product of:
  0.013924506 = sum of:
    0.013924506 = product of:
      0.041773517 = sum of:
        0.041773517 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
          0.041773517 = score(doc=3445,freq=2.0), product of:
            0.07712106 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.022023074 = queryNorm
            0.5416616 = fieldWeight in 3445, 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=3445)
      0.33333334 = coord(1/3)
  0.055555556 = coord(1/18)
    Date
    25. 8.2005 17:42:22
  12. Thompson, P.: Looking back: on relevance, probabilistic indexing and information retrieval (2008) 0.00 
    6.6909054E-4 = product of:
  0.01204363 = sum of:
    0.01204363 = product of:
      0.02408726 = sum of:
        0.02408726 = weight(_text_:29 in 2074) [ClassicSimilarity], result of:
          0.02408726 = score(doc=2074,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.31092256 = fieldWeight in 2074, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=2074)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    31. 7.2008 19:58:29
  13. Vechtomova, O.; Karamuftuoglu, M.: Lexical cohesion and term proximity in document ranking (2008) 0.00 
    6.6909054E-4 = product of:
  0.01204363 = sum of:
    0.01204363 = product of:
      0.02408726 = sum of:
        0.02408726 = weight(_text_:29 in 2101) [ClassicSimilarity], result of:
          0.02408726 = score(doc=2101,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.31092256 = fieldWeight in 2101, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=2101)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    1. 8.2008 12:29:05
  14. Otterbacher, J.; Erkan, G.; Radev, D.R.: Biased LexRank : passage retrieval using random walks with question-based priors (2009) 0.00 
    5.854542E-4 = product of:
  0.010538176 = sum of:
    0.010538176 = product of:
      0.021076351 = sum of:
        0.021076351 = weight(_text_:29 in 2450) [ClassicSimilarity], result of:
          0.021076351 = score(doc=2450,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.27205724 = fieldWeight in 2450, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2450)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    22.11.2008 17:11:29
  15. Cannane, A.; Williams, H.E.: General-purpose compression for efficient retrieval (2001) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 5705) [ClassicSimilarity], result of:
          0.018065445 = score(doc=5705,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.23319192 = fieldWeight in 5705, 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=5705)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    29. 9.2001 13:59:55
  16. Kaszkiel, M.; Zobel, J.: Effective ranking with arbitrary passages (2001) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 5764) [ClassicSimilarity], result of:
          0.018065445 = score(doc=5764,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = 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.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    29. 9.2001 14:00:39
  17. Bodoff, D.; Enache, D.; Kambil, A.; Simon, G.; Yukhimets, A.: ¬A unified maximum likelihood approach to document retrieval (2001) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 174) [ClassicSimilarity], result of:
          0.018065445 = score(doc=174,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.23319192 = fieldWeight in 174, 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=174)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    29. 9.2001 17:52:51
  18. Drucker, H.; Shahrary, B.; Gibbon, D.C.: Support vector machines : relevance feedback and information retrieval (2002) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 2581) [ClassicSimilarity], result of:
          0.018065445 = score(doc=2581,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.23319192 = fieldWeight in 2581, 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=2581)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    15. 8.2004 18:55:29
  19. Käki, M.: fKWIC: frequency-based Keyword-in-Context Index for filtering Web search results (2006) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 6112) [ClassicSimilarity], result of:
          0.018065445 = score(doc=6112,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.23319192 = fieldWeight in 6112, 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=6112)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Abstract
    Enormous Web search engine databases combined with short search queries result in large result sets that are often difficult to access. Result ranking works fairly well, but users need help when it fails. For these situations, we propose a filtering interface that is inspired by keyword-in-context (KWIC) indices. The user interface lists the most frequent keyword contexts (fKWIC). When a context is selected, the corresponding results are displayed in the result list, allowing users to concentrate on the specific context. We compared the keyword context index user interface to the rank order result listing in an experiment with 36 participants. The results show that the proposed user interface was 29% faster in finding relevant results, and the precision of the selected results was 19% higher. In addition, participants showed positive attitudes toward the system.
  20. Kekäläinen, J.: Binary and graded relevance in IR evaluations : comparison of the effects on ranking of IR systems (2005) 0.00 
    5.018179E-4 = product of:
  0.009032723 = sum of:
    0.009032723 = product of:
      0.018065445 = sum of:
        0.018065445 = weight(_text_:29 in 1036) [ClassicSimilarity], result of:
          0.018065445 = score(doc=1036,freq=2.0), product of:
            0.07747029 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.022023074 = queryNorm
            0.23319192 = fieldWeight in 1036, 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=1036)
      0.5 = coord(1/2)
  0.055555556 = coord(1/18)
    Date
    26.12.2007 20:29:18

Authors

Languages

  • e 31
  • d 5
  • pt 1
  • More… Less…

Types

  • a 33
  • m 2
  • r 1
  • x 1
  • More… Less…

Themes

Subjects

Classifications