Search (2 results, page 1 of 1)

  • × author_ss:"Hofmann, M."
  1. Goslin, K.; Hofmann, M.: ¬A Wikipedia powered state-based approach to automatic search query enhancement (2018) 0.01
    0.008111361 = product of:
      0.016222723 = sum of:
        0.008916007 = weight(_text_:a in 5083) [ClassicSimilarity], result of:
          0.008916007 = score(doc=5083,freq=8.0), product of:
            0.05832264 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.05058132 = queryNorm
            0.15287387 = fieldWeight in 5083, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=5083)
        0.0073067155 = product of:
          0.014613431 = sum of:
            0.014613431 = weight(_text_:information in 5083) [ClassicSimilarity], result of:
              0.014613431 = score(doc=5083,freq=4.0), product of:
                0.088794395 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.05058132 = queryNorm
                0.16457605 = fieldWeight in 5083, 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=5083)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    This paper describes the development and testing of a novel Automatic Search Query Enhancement (ASQE) algorithm, the Wikipedia N Sub-state Algorithm (WNSSA), which utilises Wikipedia as the sole data source for prior knowledge. This algorithm is built upon the concept of iterative states and sub-states, harnessing the power of Wikipedia's data set and link information to identify and utilise reoccurring terms to aid term selection and weighting during enhancement. This algorithm is designed to prevent query drift by making callbacks to the user's original search intent by persisting the original query between internal states with additional selected enhancement terms. The developed algorithm has shown to improve both short and long queries by providing a better understanding of the query and available data. The proposed algorithm was compared against five existing ASQE algorithms that utilise Wikipedia as the sole data source, showing an average Mean Average Precision (MAP) improvement of 0.273 over the tested existing ASQE algorithms.
    Source
    Information processing and management. 54(2018) no.4, S.726-739
    Type
    a
  2. Hofmann, M.; Simon, L.: Problemlösung Hypertext : Grundlagen - Entwicklung - Anwendung (1995) 0.00
    0.0047796657 = product of:
      0.009559331 = sum of:
        0.005253808 = weight(_text_:a in 2474) [ClassicSimilarity], result of:
          0.005253808 = score(doc=2474,freq=4.0), product of:
            0.05832264 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.05058132 = queryNorm
            0.090081796 = fieldWeight in 2474, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2474)
        0.0043055234 = product of:
          0.008611047 = sum of:
            0.008611047 = weight(_text_:information in 2474) [ClassicSimilarity], result of:
              0.008611047 = score(doc=2474,freq=2.0), product of:
                0.088794395 = queryWeight, product of:
                  1.7554779 = idf(docFreq=20772, maxDocs=44218)
                  0.05058132 = queryNorm
                0.09697737 = fieldWeight in 2474, 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=2474)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    Dieses Buch ist ein Problemlöser für Projektmanager, die den Einsatz von Hyperteextsystemen erwägen, ebenso für die Entwickler und auch für den interessierten Anwender, der die Hintergründe von Hypertextsystemen verstehen will. Präzise Informationen zu den Grundlagen von Hypertext schaffen die Basis sich sicher in diesem Feld zu bewegen, sich gezielt weitergehende Information zu beschaffen und eigenständig Entwicklungstendenzen abzuschätzen. Eine ausführliche Beschreibung der Entwicklung von Hypertextanwendungen leistet die notwendige Hilfe für die Gestaltung von Hypertexten. Der Leser wird in die Lage versetzt, Chancen und Probleme von Hypertextprojekten frühzeitig zu erkennen und optimale Lösungen zu finden. Beispiele illustrieren tatsächlich realisierte und für den praktischen Einsatz konizpierte Anwendungen das Potential von Hypertext und geben Anregungen für die weitere Entwicklung von Hypertextsystemen.
    Classification
    ST 351 H97 Informatik / Monographien / Einzelne Anwendungen der Datenverarbeitung / Textverarbeitung, Desktop Publishing / Einzelne Programme (A-Z) / Programme H / Hypertext
    RVK
    ST 351 H97 Informatik / Monographien / Einzelne Anwendungen der Datenverarbeitung / Textverarbeitung, Desktop Publishing / Einzelne Programme (A-Z) / Programme H / Hypertext