Search (60 results, page 1 of 3)

  • × theme_ss:"Retrievalalgorithmen"
  • × year_i:[2010 TO 2020}
  1. Fuhr, N.: Modelle im Information Retrieval (2013) 0.02 
    0.018837553 = product of:
  0.09418776 = sum of:
    0.022241939 = weight(_text_:und in 724) [ClassicSimilarity], result of:
      0.022241939 = score(doc=724,freq=4.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.34630734 = fieldWeight in 724, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.078125 = fieldNorm(doc=724)
    0.064969115 = weight(_text_:informationswissenschaft in 724) [ClassicSimilarity], result of:
      0.064969115 = score(doc=724,freq=2.0), product of:
        0.13053758 = queryWeight, product of:
          4.504705 = idf(docFreq=1328, maxDocs=44218)
          0.028978055 = queryNorm
        0.49770427 = fieldWeight in 724, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.504705 = idf(docFreq=1328, maxDocs=44218)
          0.078125 = fieldNorm(doc=724)
    0.0069766995 = product of:
      0.013953399 = sum of:
        0.013953399 = weight(_text_:information in 724) [ClassicSimilarity], result of:
          0.013953399 = score(doc=724,freq=4.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.27429342 = fieldWeight in 724, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.078125 = fieldNorm(doc=724)
      0.5 = coord(1/2)
  0.2 = coord(3/15)
    Source
    Grundlagen der praktischen Information und Dokumentation. Handbuch zur Einführung in die Informationswissenschaft und -praxis. 6., völlig neu gefaßte Ausgabe. Hrsg. von R. Kuhlen, W. Semar u. D. Strauch. Begründet von Klaus Laisiepen, Ernst Lutterbeck, Karl-Heinrich Meyer-Uhlenried
  2. Tober, M.; Hennig, L.; Furch, D.: SEO Ranking-Faktoren und Rang-Korrelationen 2014 : Google Deutschland (2014) 0.01 
    0.005845145 = product of:
  0.043838583 = sum of:
    0.028134076 = weight(_text_:und in 1484) [ClassicSimilarity], result of:
      0.028134076 = score(doc=1484,freq=10.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.438048 = fieldWeight in 1484, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0625 = fieldNorm(doc=1484)
    0.015704507 = product of:
      0.031409014 = sum of:
        0.031409014 = weight(_text_:22 in 1484) [ClassicSimilarity], result of:
          0.031409014 = score(doc=1484,freq=2.0), product of:
            0.101476215 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.028978055 = queryNorm
            0.30952093 = fieldWeight in 1484, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=1484)
      0.5 = coord(1/2)
  0.13333334 = coord(2/15)
    Abstract
    Dieses Whitepaper beschäftigt sich mit der Definition und Bewertung von Faktoren, die eine hohe Rangkorrelation-Koeffizienz mit organischen Suchergebnissen aufweisen und dient dem Zweck der tieferen Analyse von Suchmaschinen-Algorithmen. Die Datenerhebung samt Auswertung bezieht sich auf Ranking-Faktoren für Google-Deutschland im Jahr 2014. Zusätzlich wurden die Korrelationen und Faktoren unter anderem anhand von Durchschnitts- und Medianwerten sowie Entwicklungstendenzen zu den Vorjahren hinsichtlich ihrer Relevanz für vordere Suchergebnis-Positionen interpretiert.
    Date
    13. 9.2014 14:45:22
  3. Mayr, P.: Bradfordizing als Re-Ranking-Ansatz in Literaturinformationssystemen (2011) 0.00 
    0.0034765953 = product of:
  0.026074464 = sum of:
    0.0231145 = weight(_text_:und in 4292) [ClassicSimilarity], result of:
      0.0231145 = score(doc=4292,freq=12.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.35989314 = fieldWeight in 4292, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.046875 = fieldNorm(doc=4292)
    0.002959963 = product of:
      0.005919926 = sum of:
        0.005919926 = weight(_text_:information in 4292) [ClassicSimilarity], result of:
          0.005919926 = score(doc=4292,freq=2.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.116372846 = fieldWeight in 4292, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046875 = fieldNorm(doc=4292)
      0.5 = coord(1/2)
  0.13333334 = coord(2/15)
    Abstract
    In diesem Artikel wird ein Re-Ranking-Ansatz für Suchsysteme vorgestellt, der die Recherche nach wissenschaftlicher Literatur messbar verbessern kann. Das nichttextorientierte Rankingverfahren Bradfordizing wird eingeführt und anschließend im empirischen Teil des Artikels bzgl. der Effektivität für typische fachbezogene Recherche-Topics evaluiert. Dem Bradford Law of Scattering (BLS), auf dem Bradfordizing basiert, liegt zugrunde, dass sich die Literatur zu einem beliebigen Fachgebiet bzw. -thema in Zonen unterschiedlicher Dokumentenkonzentration verteilt. Dem Kernbereich mit hoher Konzentration der Literatur folgen Bereiche mit mittlerer und geringer Konzentration. Bradfordizing sortiert bzw. rankt eine Dokumentmenge damit nach den sogenannten Kernzeitschriften. Der Retrievaltest mit 164 intellektuell bewerteten Fragestellungen in Fachdatenbanken aus den Bereichen Sozial- und Politikwissenschaften, Wirtschaftswissenschaften, Psychologie und Medizin zeigt, dass die Dokumente der Kernzeitschriften signifikant häufiger relevant bewertet werden als Dokumente der zweiten Dokumentzone bzw. den Peripherie-Zeitschriften. Die Implementierung von Bradfordizing und weiteren Re-Rankingverfahren liefert unmittelbare Mehrwerte für den Nutzer.
    Source
    Information - Wissenschaft und Praxis. 62(2011) H.1, S.3-10
  4. Behnert, C.; Plassmeier, K.; Borst, T.; Lewandowski, D.: Evaluierung von Rankingverfahren für bibliothekarische Informationssysteme (2019) 0.00 
    0.003396225 = product of:
  0.025471685 = sum of:
    0.022018395 = weight(_text_:und in 5023) [ClassicSimilarity], result of:
      0.022018395 = score(doc=5023,freq=8.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.34282678 = fieldWeight in 5023, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5023)
    0.00345329 = product of:
      0.00690658 = sum of:
        0.00690658 = weight(_text_:information in 5023) [ClassicSimilarity], result of:
          0.00690658 = score(doc=5023,freq=2.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.13576832 = fieldWeight in 5023, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5023)
      0.5 = coord(1/2)
  0.13333334 = coord(2/15)
    Abstract
    Dieser Beitrag beschreibt eine Studie zur Entwicklung und Evaluierung von Rankingverfahren für bibliothekarische Informationssysteme. Dazu wurden mögliche Faktoren für das Relevanzranking ausgehend von den Verfahren in Websuchmaschinen identifiziert, auf den Bibliothekskontext übertragen und systematisch evaluiert. Mithilfe eines Testsystems, das auf dem ZBW-Informationsportal EconBiz und einer web-basierten Software zur Evaluierung von Suchsystemen aufsetzt, wurden verschiedene Relevanzfaktoren (z. B. Popularität in Verbindung mit Aktualität) getestet. Obwohl die getesteten Rankingverfahren auf einer theoretischen Ebene divers sind, konnten keine einheitlichen Verbesserungen gegenüber den Baseline-Rankings gemessen werden. Die Ergebnisse deuten darauf hin, dass eine Adaptierung des Rankings auf individuelle Nutzer bzw. Nutzungskontexte notwendig sein könnte, um eine höhere Performance zu erzielen.
    Source
    Information - Wissenschaft und Praxis. 70(2019) H.1, S.14-23
  5. Bornmann, L.; Mutz, R.: From P100 to P100' : a new citation-rank approach (2014) 0.00 
    0.00262015 = product of:
  0.03930225 = sum of:
    0.03930225 = sum of:
      0.0078932345 = weight(_text_:information in 1431) [ClassicSimilarity], result of:
        0.0078932345 = score(doc=1431,freq=2.0), product of:
          0.050870337 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.028978055 = queryNorm
          0.1551638 = fieldWeight in 1431, 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=1431)
      0.031409014 = weight(_text_:22 in 1431) [ClassicSimilarity], result of:
        0.031409014 = score(doc=1431,freq=2.0), product of:
          0.101476215 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.028978055 = queryNorm
          0.30952093 = fieldWeight in 1431, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=1431)
  0.06666667 = coord(1/15)
    Date
    22. 8.2014 17:05:18
    Source
    Journal of the Association for Information Science and Technology. 65(2014) no.9, S.1939-1943
  6. Ravana, S.D.; Rajagopal, P.; Balakrishnan, V.: Ranking retrieval systems using pseudo relevance judgments (2015) 0.00 
    0.0023159073 = product of:
  0.034738608 = sum of:
    0.034738608 = sum of:
      0.0069766995 = weight(_text_:information in 2591) [ClassicSimilarity], result of:
        0.0069766995 = score(doc=2591,freq=4.0), product of:
          0.050870337 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.028978055 = queryNorm
          0.13714671 = fieldWeight in 2591, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2591)
      0.027761906 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
        0.027761906 = score(doc=2591,freq=4.0), product of:
          0.101476215 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.028978055 = 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.06666667 = coord(1/15)
    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
    Source
    Aslib journal of information management. 67(2015) no.6, S.700-714
  7. Soulier, L.; Jabeur, L.B.; Tamine, L.; Bahsoun, W.: On ranking relevant entities in heterogeneous networks using a language-based model (2013) 0.00 
    0.0019664785 = product of:
  0.029497176 = sum of:
    0.029497176 = sum of:
      0.009866543 = weight(_text_:information in 664) [ClassicSimilarity], result of:
        0.009866543 = score(doc=664,freq=8.0), product of:
          0.050870337 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.028978055 = queryNorm
          0.19395474 = fieldWeight in 664, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.0390625 = fieldNorm(doc=664)
      0.019630633 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
        0.019630633 = score(doc=664,freq=2.0), product of:
          0.101476215 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.028978055 = queryNorm
          0.19345059 = fieldWeight in 664, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=664)
  0.06666667 = coord(1/15)
    Abstract
    A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.
    Date
    22. 3.2013 19:34:49
    Source
    Journal of the American Society for Information Science and Technology. 64(2013) no.3, S.500-515
  8. Behnert, C.; Borst, T.: Neue Formen der Relevanz-Sortierung in bibliothekarischen Informationssystemen : das DFG-Projekt LibRank (2015) 0.00 
    0.0018756052 = product of:
  0.028134076 = sum of:
    0.028134076 = weight(_text_:und in 5392) [ClassicSimilarity], result of:
      0.028134076 = score(doc=5392,freq=10.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.438048 = fieldWeight in 5392, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0625 = fieldNorm(doc=5392)
  0.06666667 = coord(1/15)
    Abstract
    Das von der DFG geförderte Projekt LibRank erforscht neue Rankingverfahren für bibliothekarische Informationssysteme, die aufbauend auf Erkenntnissen aus dem Bereich Websuche qualitätsinduzierende Faktoren wie z. B. Aktualität, Popularität und Verfügbarkeit von einzelnen Medien berücksichtigen. Die konzipierten Verfahren werden im Kontext eines in den Wirtschaftswissenschaften häufig genutzten Rechercheportals (EconBiz) entwickelt und in einem Testsystem systematisch evaluiert. Es werden Rankingfaktoren, die für den Bibliotheksbereich von besonderem Interesse sind, vorgestellt und exemplarisch Probleme und Herausforderungen aufgezeigt.
    Source
    Bibliothek: Forschung und Praxis. 39(2015) H.3, S.384-393
  9. Baloh, P.; Desouza, K.C.; Hackney, R.: Contextualizing organizational interventions of knowledge management systems : a design science perspectiveA domain analysis (2012) 0.00 
    0.0016375937 = product of:
  0.024563905 = sum of:
    0.024563905 = sum of:
      0.0049332716 = weight(_text_:information in 241) [ClassicSimilarity], result of:
        0.0049332716 = score(doc=241,freq=2.0), product of:
          0.050870337 = queryWeight, product of:
            1.7554779 = idf(docFreq=20772, maxDocs=44218)
            0.028978055 = queryNorm
          0.09697737 = fieldWeight in 241, 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=241)
      0.019630633 = weight(_text_:22 in 241) [ClassicSimilarity], result of:
        0.019630633 = score(doc=241,freq=2.0), product of:
          0.101476215 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.028978055 = queryNorm
          0.19345059 = fieldWeight in 241, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=241)
  0.06666667 = coord(1/15)
    Date
    11. 6.2012 14:22:34
    Source
    Journal of the American Society for Information Science and Technology. 63(2012) no.5, S.948-966
  10. Mayr, P.: Bradfordizing mit Katalogdaten : Alternative Sicht auf Suchergebnisse und Publikationsquellen durch Re-Ranking (2010) 0.00 
    0.0015409668 = product of:
  0.0231145 = sum of:
    0.0231145 = weight(_text_:und in 4301) [ClassicSimilarity], result of:
      0.0231145 = score(doc=4301,freq=12.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.35989314 = fieldWeight in 4301, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.046875 = fieldNorm(doc=4301)
  0.06666667 = coord(1/15)
    Abstract
    Nutzer erwarten für Literaturrecherchen in wissenschaftlichen Suchsystemen einen möglichst hohen Anteil an relevanten und qualitativen Dokumenten in den Trefferergebnissen. Insbesondere die Reihenfolge und Struktur der gelisteten Ergebnisse (Ranking) spielt, neben dem direkten Volltextzugriff auf die Dokumente, für viele Nutzer inzwischen eine entscheidende Rolle. Abgegrenzt wird Ranking oder Relevance Ranking von sogenannten Sortierungen zum Beispiel nach dem Erscheinungsjahr der Publikation, obwohl hier die Grenze zu »nach inhaltlicher Relevanz« gerankten Listen konzeptuell nicht sauber zu ziehen ist. Das Ranking von Dokumenten führt letztlich dazu, dass sich die Benutzer fokussiert mit den oberen Treffermengen eines Suchergebnisses beschäftigen. Der mittlere und untere Bereich eines Suchergebnisses wird häufig nicht mehr in Betracht gezogen. Aufgrund der Vielzahl an relevanten und verfügbaren Informationsquellen ist es daher notwendig, Kernbereiche in den Suchräumen zu identifizieren und diese anschließend dem Nutzer hervorgehoben zu präsentieren. Phillipp Mayr fasst hier die Ergebnisse seiner Dissertation zum Thema »Re-Ranking auf Basis von Bradfordizing für die verteilte Suche in Digitalen Bibliotheken« zusammen.
  11. Hora, M.: Methoden für das Ranking in Discovery-Systemen (2018) 0.00 
    0.0014678931 = product of:
  0.022018395 = sum of:
    0.022018395 = weight(_text_:und in 4968) [ClassicSimilarity], result of:
      0.022018395 = score(doc=4968,freq=8.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.34282678 = fieldWeight in 4968, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4968)
  0.06666667 = coord(1/15)
    Abstract
    Discovery-Systeme bieten meist als Standardeinstellung eine Sortierung nach Relevanz an. Wie die Relevanz ermittelt wird, ist häufig intransparent. Dabei wären Kenntnisse darüber aus Nutzersicht ein wichtiger Faktor in der Informationskompetenz, während Bibliotheken sicherstellen sollten, dass das Ranking zum eigenen Bestand und Publikum passt. In diesem Aufsatz wird dargestellt, wie Discovery-Systeme Treffer auswählen und bewerten. Dazu gehören Indexierung, Prozessierung, Text-Matching und weitere Relevanzkriterien, z. B. Popularität oder Verfügbarkeit. Schließlich müssen alle betrachteten Kriterien zu einem zentralen Score zusammengefasst werden. Ein besonderer Fokus wird auf das Ranking von EBSCO Discovery Service, Primo und Summon gelegt.
  12. Walz, J.: Analyse der Übertragbarkeit allgemeiner Rankingfaktoren von Web-Suchmaschinen auf Discovery-Systeme (2018) 0.00 
    0.0012581941 = product of:
  0.018872911 = sum of:
    0.018872911 = weight(_text_:und in 5744) [ClassicSimilarity], result of:
      0.018872911 = score(doc=5744,freq=8.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.29385152 = fieldWeight in 5744, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.046875 = fieldNorm(doc=5744)
  0.06666667 = coord(1/15)
    Abstract
    Ziel: Ziel dieser Bachelorarbeit war es, die Übertragbarkeit der allgemeinen Rankingfaktoren, wie sie von Web-Suchmaschinen verwendet werden, auf Discovery-Systeme zu analysieren. Dadurch könnte das bisher hauptsächlich auf dem textuellen Abgleich zwischen Suchanfrage und Dokumenten basierende bibliothekarische Ranking verbessert werden. Methode: Hierfür wurden Faktoren aus den Gruppen Popularität, Aktualität, Lokalität, Technische Faktoren, sowie dem personalisierten Ranking diskutiert. Die entsprechenden Rankingfaktoren wurden nach ihrer Vorkommenshäufigkeit in der analysierten Literatur und der daraus abgeleiteten Wichtigkeit, ausgewählt. Ergebnis: Von den 23 untersuchten Rankingfaktoren sind 14 (61 %) direkt vom Ranking der Web-Suchmaschinen auf das Ranking der Discovery-Systeme übertragbar. Zu diesen zählen unter anderem das Klickverhalten, das Erstellungsdatum, der Nutzerstandort, sowie die Sprache. Sechs (26%) der untersuchten Faktoren sind dagegen nicht übertragbar (z.B. Aktualisierungsfrequenz und Ladegeschwindigkeit). Die Linktopologie, die Nutzungshäufigkeit, sowie die Aktualisierungsfrequenz sind mit entsprechenden Modifikationen übertragbar.
    Imprint
    Köln : Fakultät für Informations- und Kommunikationswissenschaften
  13. Oberhauser, O.: Relevance Ranking in den Online-Katalogen der "nächsten Generation" (2010) 0.00 
    8.896776E-4 = product of:
  0.013345163 = sum of:
    0.013345163 = weight(_text_:und in 4308) [ClassicSimilarity], result of:
      0.013345163 = score(doc=4308,freq=4.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.20778441 = fieldWeight in 4308, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.046875 = fieldNorm(doc=4308)
  0.06666667 = coord(1/15)
    Abstract
    Relevance Ranking in Online-Katalogen ist zwar kein neues Thema, doch liegt dazu nicht allzu viel Literatur vor, die das Prädikat "ernstzunehmen" verdient. Dies ist zum einen darin begründet, dass das Interesse an der Ausgabe ranggereihter Ergebnislisten auf Seiten aller Beteiligter (Bibliothekare, Softwarehersteller, Benutzer) traditionell gering war. Zum anderen ging die seit einigen Jahren populär gewordene Kritik an den bestehenden OPACs vielfach von einer unzureichenden Wissensbasis aus und produzierte oft nur polemische oder emotional gefärbte Beiträge, die zum Thema Ranking wenig beitrugen. ... Der hier beschriebene Test ist natürlich in keiner Weise erschöpfend oder repräsentativ. Dennoch gibt er, wie ich glaube, Anlass zu einiger Hoffnung. Er lässt vermuten, dass die "neuen" OPACs - zumindest was das Relevance Ranking betrifft - auf dem Weg in die richtige Richtung sind. Wie gut es wirklich gelingen wird, die Rankingleistung von Suchmaschinen wie Google, die unter völlig anderen Voraussetzungen arbeiten, einzuholen, wird aber erst die Zukunft zeigen.
    Source
    Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 63(2010) H.1/2, S.25-37
  14. Maylein, L.; Langenstein, A.: Neues vom Relevanz-Ranking im HEIDI-Katalog der Universitätsbibliothek Heidelberg : Perspektiven für bibliothekarische Dienstleistungen (2013) 0.00 
    8.387961E-4 = product of:
  0.012581941 = sum of:
    0.012581941 = weight(_text_:und in 775) [ClassicSimilarity], result of:
      0.012581941 = score(doc=775,freq=2.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.19590102 = fieldWeight in 775, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0625 = fieldNorm(doc=775)
  0.06666667 = coord(1/15)
    Abstract
    Das Relevanz-Ranking im Katalog der Universitätsbibliothek Heidelberg HEIDI, bereits 2009 in einem Beitrag in dieser Zeitschrift beschrieben, wurde in den letzten Jahren durch neue Entwicklungen und Methoden stark verbessert. Der Aufsatz beschreibt die Realisierung der bisherigen Rankingmaßnahmen unter der neu eingesetzten Suchmaschinenplattform SOLR. Weiter werden verschiedene neue Möglichkeiten für Rankinganpassungen unter SOLR sowie deren Einsatz im HEIDI-Katalog dargestellt.
  15. Karlsson, A.; Hammarfelt, B.; Steinhauer, H.J.; Falkman, G.; Olson, N.; Nelhans, G.; Nolin, J.: Modeling uncertainty in bibliometrics and information retrieval : an information fusion approach (2015) 0.00 
    5.696452E-4 = product of:
  0.008544678 = sum of:
    0.008544678 = product of:
      0.017089356 = sum of:
        0.017089356 = weight(_text_:information in 1696) [ClassicSimilarity], result of:
          0.017089356 = score(doc=1696,freq=6.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.3359395 = fieldWeight in 1696, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.078125 = fieldNorm(doc=1696)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Footnote
    Beitrag in einem Special Issue "Combining bibliometrics and information retrieval"
  16. Jindal, V.; Bawa, S.; Batra, S.: ¬A review of ranking approaches for semantic search on Web (2014) 0.00 
    4.4124527E-4 = product of:
  0.0066186786 = sum of:
    0.0066186786 = product of:
      0.013237357 = sum of:
        0.013237357 = weight(_text_:information in 2799) [ClassicSimilarity], result of:
          0.013237357 = score(doc=2799,freq=10.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.2602176 = fieldWeight in 2799, 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=2799)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Abstract
    With ever increasing information being available to the end users, search engines have become the most powerful tools for obtaining useful information scattered on the Web. However, it is very common that even most renowned search engines return result sets with not so useful pages to the user. Research on semantic search aims to improve traditional information search and retrieval methods where the basic relevance criteria rely primarily on the presence of query keywords within the returned pages. This work is an attempt to explore different relevancy ranking approaches based on semantics which are considered appropriate for the retrieval of relevant information. In this paper, various pilot projects and their corresponding outcomes have been investigated based on methodologies adopted and their most distinctive characteristics towards ranking. An overview of selected approaches and their comparison by means of the classification criteria has been presented. With the help of this comparison, some common concepts and outstanding features have been identified.
    Source
    Information processing and management. 50(2014) no.2, S.416-425
  17. Hoenkamp, E.; Bruza, P.: How everyday language can and will boost effective information retrieval (2015) 0.00 
    4.0279995E-4 = product of:
  0.006041999 = sum of:
    0.006041999 = product of:
      0.012083998 = sum of:
        0.012083998 = weight(_text_:information in 2123) [ClassicSimilarity], result of:
          0.012083998 = score(doc=2123,freq=12.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.23754507 = fieldWeight in 2123, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2123)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Abstract
    Typing 2 or 3 keywords into a browser has become an easy and efficient way to find information. Yet, typing even short queries becomes tedious on ever shrinking (virtual) keyboards. Meanwhile, speech processing is maturing rapidly, facilitating everyday language input. Also, wearable technology can inform users proactively by listening in on their conversations or processing their social media interactions. Given these developments, everyday language may soon become the new input of choice. We present an information retrieval (IR) algorithm specifically designed to accept everyday language. It integrates two paradigms of information retrieval, previously studied in isolation; one directed mainly at the surface structure of language, the other primarily at the underlying meaning. The integration was achieved by a Markov machine that encodes meaning by its transition graph, and surface structure by the language it generates. A rigorous evaluation of the approach showed, first, that it can compete with the quality of existing language models, second, that it is more effective the more verbose the input, and third, as a consequence, that it is promising for an imminent transition from keyword input, where the onus is on the user to formulate concise queries, to a modality where users can express more freely, more informal, and more natural their need for information in everyday language.
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.8, S.1546-1558
  18. Jacucci, G.; Barral, O.; Daee, P.; Wenzel, M.; Serim, B.; Ruotsalo, T.; Pluchino, P.; Freeman, J.; Gamberini, L.; Kaski, S.; Blankertz, B.: Integrating neurophysiologic relevance feedback in intent modeling for information retrieval (2019) 0.00 
    4.0279995E-4 = product of:
  0.006041999 = sum of:
    0.006041999 = product of:
      0.012083998 = sum of:
        0.012083998 = weight(_text_:information in 5356) [ClassicSimilarity], result of:
          0.012083998 = score(doc=5356,freq=12.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.23754507 = fieldWeight in 5356, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5356)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Abstract
    The use of implicit relevance feedback from neurophysiology could deliver effortless information retrieval. However, both computing neurophysiologic responses and retrieving documents are characterized by uncertainty because of noisy signals and incomplete or inconsistent representations of the data. We present the first-of-its-kind, fully integrated information retrieval system that makes use of online implicit relevance feedback generated from brain activity as measured through electroencephalography (EEG), and eye movements. The findings of the evaluation experiment (N = 16) show that we are able to compute online neurophysiology-based relevance feedback with performance significantly better than chance in complex data domains and realistic search tasks. We contribute by demonstrating how to integrate in interactive intent modeling this inherently noisy implicit relevance feedback combined with scarce explicit feedback. Although experimental measures of task performance did not allow us to demonstrate how the classification outcomes translated into search task performance, the experiment proved that our approach is able to generate relevance feedback from brain signals and eye movements in a realistic scenario, thus providing promising implications for future work in neuroadaptive information retrieval (IR).
    Footnote
    Beitrag in einem 'Special issue on neuro-information science'.
    Source
    Journal of the Association for Information Science and Technology. 70(2019) no.9, S.917-930
  19. Efron, M.: Linear time series models for term weighting in information retrieval (2010) 0.00 
    3.9466174E-4 = product of:
  0.005919926 = sum of:
    0.005919926 = product of:
      0.011839852 = sum of:
        0.011839852 = weight(_text_:information in 3688) [ClassicSimilarity], result of:
          0.011839852 = score(doc=3688,freq=8.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.23274569 = fieldWeight in 3688, 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=3688)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Abstract
    Common measures of term importance in information retrieval (IR) rely on counts of term frequency; rare terms receive higher weight in document ranking than common terms receive. However, realistic scenarios yield additional information about terms in a collection. Of interest in this article is the temporal behavior of terms as a collection changes over time. We propose capturing each term's collection frequency at discrete time intervals over the lifespan of a corpus and analyzing the resulting time series. We hypothesize the collection frequency of a weakly discriminative term x at time t is predictable by a linear model of the term's prior observations. On the other hand, a linear time series model for a strong discriminators' collection frequency will yield a poor fit to the data. Operationalizing this hypothesis, we induce three time-based measures of term importance and test these against state-of-the-art term weighting models.
    Source
    Journal of the American Society for Information Science and Technology. 61(2010) no.7, S.1299-1312
  20. Habernal, I.; Konopík, M.; Rohlík, O.: Question answering (2012) 0.00 
    3.9466174E-4 = product of:
  0.005919926 = sum of:
    0.005919926 = product of:
      0.011839852 = sum of:
        0.011839852 = weight(_text_:information in 101) [ClassicSimilarity], result of:
          0.011839852 = score(doc=101,freq=8.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.23274569 = fieldWeight in 101, 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=101)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    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

Authors

Languages

  • e 49
  • d 11

Types

  • a 58
  • el 1
  • r 1
  • x 1
  • More… Less…

Themes