Search (41 results, page 1 of 3)

  • × theme_ss:"Retrievalalgorithmen"
  1. Joss, M.W.; Wszola, S.: ¬The engines that can : text search and retrieval software, their strategies, and vendors (1996) 0.03 
    0.03299309 = product of:
  0.13197236 = sum of:
    0.13197236 = sum of:
      0.09497249 = weight(_text_:software in 5123) [ClassicSimilarity], result of:
        0.09497249 = score(doc=5123,freq=8.0), product of:
          0.18056466 = queryWeight, product of:
            3.9671519 = idf(docFreq=2274, maxDocs=44218)
            0.045514934 = queryNorm
          0.525975 = fieldWeight in 5123, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.9671519 = idf(docFreq=2274, maxDocs=44218)
            0.046875 = fieldNorm(doc=5123)
      0.03699987 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
        0.03699987 = score(doc=5123,freq=2.0), product of:
          0.15938555 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.045514934 = queryNorm
          0.23214069 = fieldWeight in 5123, 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=5123)
  0.25 = coord(1/4)
    Abstract
    Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching
    Date
    12. 9.1996 13:56:22
  2. Mutschke, P.: Autorennetzwerke : Verfahren zur Netzwerkanalyse als Mehrwertdienste für Informationssysteme (2004) 0.03 
    0.028156668 = product of:
  0.11262667 = sum of:
    0.11262667 = weight(_text_:soziale in 4050) [ClassicSimilarity], result of:
      0.11262667 = score(doc=4050,freq=2.0), product of:
        0.2780798 = queryWeight, product of:
          6.1096387 = idf(docFreq=266, maxDocs=44218)
          0.045514934 = queryNorm
        0.40501565 = fieldWeight in 4050, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.1096387 = idf(docFreq=266, maxDocs=44218)
          0.046875 = fieldNorm(doc=4050)
  0.25 = coord(1/4)
    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. Shiri, A.A.; Revie, C.: Query expansion behavior within a thesaurus-enhanced search environment : a user-centered evaluation (2006) 0.02 
    0.017601274 = product of:
  0.070405096 = sum of:
    0.070405096 = sum of:
      0.03957187 = weight(_text_:software in 56) [ClassicSimilarity], result of:
        0.03957187 = score(doc=56,freq=2.0), product of:
          0.18056466 = queryWeight, product of:
            3.9671519 = idf(docFreq=2274, maxDocs=44218)
            0.045514934 = queryNorm
          0.21915624 = fieldWeight in 56, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9671519 = idf(docFreq=2274, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
      0.030833228 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
        0.030833228 = score(doc=56,freq=2.0), product of:
          0.15938555 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.045514934 = queryNorm
          0.19345059 = fieldWeight in 56, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
  0.25 = coord(1/4)
    Abstract
    The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.
    Date
    22. 7.2006 16:32:43
  4. Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (1999) 0.02 
    0.016788924 = product of:
  0.0671557 = sum of:
    0.0671557 = product of:
      0.1343114 = sum of:
        0.1343114 = weight(_text_:software in 5777) [ClassicSimilarity], result of:
          0.1343114 = score(doc=5777,freq=16.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.743841 = fieldWeight in 5777, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.046875 = fieldNorm(doc=5777)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    This book discusses many of the key design issues for building search engines and emphazises the important role that applied mathematics can play in improving information retrieval. The authors discuss not only important data structures, algorithms, and software but also user-centered issues such as interfaces, manual indexing, and document preparation. They also present some of the current problems in information retrieval that many not be familiar to applied mathematicians and computer scientists and some of the driving computational methods (SVD, SDD) for automated conceptual indexing
    Classification
    ST 230 [Informatik # Monographien # Software und -entwicklung # Software allgemein, (Einführung, Lehrbücher, Methoden der Programmierung) Software engineering, Programmentwicklungssysteme, Softwarewerkzeuge]
    RVK
    ST 230 [Informatik # Monographien # Software und -entwicklung # Software allgemein, (Einführung, Lehrbücher, Methoden der Programmierung) Software engineering, Programmentwicklungssysteme, Softwarewerkzeuge]
    Series
    Software, environments, tools; 8
  5. Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986) 0.01 
    0.012333291 = product of:
  0.049333163 = sum of:
    0.049333163 = product of:
      0.098666325 = sum of:
        0.098666325 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.098666325 = score(doc=402,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.61904186 = fieldWeight in 402, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=402)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Information processing and management. 22(1986) no.6, S.465-476
  6. Smeaton, A.F.; Rijsbergen, C.J. van: ¬The retrieval effects of query expansion on a feedback document retrieval system (1983) 0.01 
    0.01079163 = product of:
  0.04316652 = sum of:
    0.04316652 = product of:
      0.08633304 = sum of:
        0.08633304 = weight(_text_:22 in 2134) [ClassicSimilarity], result of:
          0.08633304 = score(doc=2134,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.5416616 = fieldWeight in 2134, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=2134)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    30. 3.2001 13:32:22
  7. Back, J.: ¬An evaluation of relevancy ranking techniques used by Internet search engines (2000) 0.01 
    0.01079163 = product of:
  0.04316652 = sum of:
    0.04316652 = product of:
      0.08633304 = sum of:
        0.08633304 = weight(_text_:22 in 3445) [ClassicSimilarity], result of:
          0.08633304 = score(doc=3445,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    25. 8.2005 17:42:22
  8. Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986) 0.01 
    0.0092499675 = product of:
  0.03699987 = sum of:
    0.03699987 = product of:
      0.07399974 = sum of:
        0.07399974 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.07399974 = score(doc=58,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.46428138 = fieldWeight in 58, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=58)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    14. 6.2015 22:12:44
  9. Fuhr, N.: Rankingexperimente mit gewichteter Indexierung (1986) 0.01 
    0.0092499675 = product of:
  0.03699987 = sum of:
    0.03699987 = product of:
      0.07399974 = sum of:
        0.07399974 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
          0.07399974 = score(doc=2051,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.46428138 = fieldWeight in 2051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=2051)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    14. 6.2015 22:12:56
  10. Chang, R.: ¬The development of indexing technology (1993) 0.01 
    0.007914375 = product of:
  0.0316575 = sum of:
    0.0316575 = product of:
      0.063315 = sum of:
        0.063315 = weight(_text_:software in 7024) [ClassicSimilarity], result of:
          0.063315 = score(doc=7024,freq=2.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.35064998 = fieldWeight in 7024, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.0625 = fieldNorm(doc=7024)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Library software review. 12(1993) no.3, S.30-35
  11. Mandl, T.: Web- und Multimedia-Dokumente : Neuere Entwicklungen bei der Evaluierung von Information Retrieval Systemen (2003) 0.01 
    0.007914375 = product of:
  0.0316575 = sum of:
    0.0316575 = product of:
      0.063315 = sum of:
        0.063315 = weight(_text_:software in 1734) [ClassicSimilarity], result of:
          0.063315 = score(doc=1734,freq=2.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.35064998 = fieldWeight in 1734, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.0625 = fieldNorm(doc=1734)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Die Menge an Daten im Internet steigt weiter rapide an. Damit wächst auch der Bedarf an qualitativ hochwertigen Information Retrieval Diensten zur Orientierung und problemorientierten Suche. Die Entscheidung für die Benutzung oder Beschaffung von Information Retrieval Software erfordert aussagekräftige Evaluierungsergebnisse. Dieser Beitrag stellt neuere Entwicklungen bei der Evaluierung von Information Retrieval Systemen vor und zeigt den Trend zu Spezialisierung und Diversifizierung von Evaluierungsstudien, die den Realitätsgrad derErgebnisse erhöhen. DerSchwerpunkt liegt auf dem Retrieval von Fachtexten, Internet-Seiten und Multimedia-Objekten.
  12. Keen, M.: Query reformulation in ranked output interaction (1994) 0.01 
    0.006925077 = product of:
  0.027700309 = sum of:
    0.027700309 = product of:
      0.055400617 = sum of:
        0.055400617 = weight(_text_:software in 1065) [ClassicSimilarity], result of:
          0.055400617 = score(doc=1065,freq=2.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.30681872 = fieldWeight in 1065, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1065)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Reports on a research project to evaluate and compare Boolean searching and methods of query reformulation using ranked output retrieval. Illustrates the design and operating features of the ranked output system, called ROSE (Ranked Output Search Engine), by means of typical results obtained by searching a database of 1239 records on the subject of cystic fibrosis. Concludes that further work is needed to determine the best reformulation tactics needed to harness the professional searcher's intelligence with that much more limited intelligence provided by the search software
  13. Wollf, J.G.: ¬A scalable technique for best-match retrieval of sequential information using metrics-guided search (1994) 0.01 
    0.006925077 = product of:
  0.027700309 = sum of:
    0.027700309 = product of:
      0.055400617 = sum of:
        0.055400617 = weight(_text_:software in 5334) [ClassicSimilarity], result of:
          0.055400617 = score(doc=5334,freq=2.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.30681872 = fieldWeight in 5334, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5334)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    Describes a new technique for retrieving information by finding the best match or matches between a textual query and a textual database. The technique uses principles of beam search with a measure of probability to guide the search and prune the search tree. Unlike many methods for comparing strings, the method gives a set of alternative matches, graded by the quality of the matching. The new technique is embodies in a software simulation SP21 which runs on a conventional computer. Presnts examples showing best-match retrieval of information from a textual database. Presents analytic and emprirical evidence on the performance of the technique. It lends itself well to parallel processing. Discusses planned developments
  14. Behnert, C.; Plassmeier, K.; Borst, T.; Lewandowski, D.: Evaluierung von Rankingverfahren für bibliothekarische Informationssysteme (2019) 0.01 
    0.006925077 = product of:
  0.027700309 = sum of:
    0.027700309 = product of:
      0.055400617 = sum of:
        0.055400617 = weight(_text_:software in 5023) [ClassicSimilarity], result of:
          0.055400617 = score(doc=5023,freq=2.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.30681872 = fieldWeight in 5023, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5023)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    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.
  15. Berry, M.W.; Browne, M.: Understanding search engines : mathematical modeling and text retrieval (2005) 0.01 
    0.0068540494 = product of:
  0.027416198 = sum of:
    0.027416198 = product of:
      0.054832395 = sum of:
        0.054832395 = weight(_text_:software in 7) [ClassicSimilarity], result of:
          0.054832395 = score(doc=7,freq=6.0), product of:
            0.18056466 = queryWeight, product of:
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.045514934 = queryNorm
            0.3036718 = fieldWeight in 7, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.9671519 = idf(docFreq=2274, maxDocs=44218)
              0.03125 = fieldNorm(doc=7)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    The second edition of Understanding Search Engines: Mathematical Modeling and Text Retrieval follows the basic premise of the first edition by discussing many of the key design issues for building search engines and emphasizing the important role that applied mathematics can play in improving information retrieval. The authors discuss important data structures, algorithms, and software as well as user-centered issues such as interfaces, manual indexing, and document preparation. Significant changes bring the text up to date on current information retrieval methods: for example the addition of a new chapter on link-structure algorithms used in search engines such as Google. The chapter on user interface has been rewritten to specifically focus on search engine usability. In addition the authors have added new recommendations for further reading and expanded the bibliography, and have updated and streamlined the index to make it more reader friendly.
    Content
    Inhalt: Introduction Document File Preparation - Manual Indexing - Information Extraction - Vector Space Modeling - Matrix Decompositions - Query Representations - Ranking and Relevance Feedback - Searching by Link Structure - User Interface - Book Format Document File Preparation Document Purification and Analysis - Text Formatting - Validation - Manual Indexing - Automatic Indexing - Item Normalization - Inverted File Structures - Document File - Dictionary List - Inversion List - Other File Structures Vector Space Models Construction - Term-by-Document Matrices - Simple Query Matching - Design Issues - Term Weighting - Sparse Matrix Storage - Low-Rank Approximations Matrix Decompositions QR Factorization - Singular Value Decomposition - Low-Rank Approximations - Query Matching - Software - Semidiscrete Decomposition - Updating Techniques Query Management Query Binding - Types of Queries - Boolean Queries - Natural Language Queries - Thesaurus Queries - Fuzzy Queries - Term Searches - Probabilistic Queries Ranking and Relevance Feedback Performance Evaluation - Precision - Recall - Average Precision - Genetic Algorithms - Relevance Feedback Searching by Link Structure HITS Method - HITS Implementation - HITS Summary - PageRank Method - PageRank Adjustments - PageRank Implementation - PageRank Summary User Interface Considerations General Guidelines - Search Engine Interfaces - Form Fill-in - Display Considerations - Progress Indication - No Penalties for Error - Results - Test and Retest - Final Considerations Further Reading
    Series
    Software, environments, tools; 17
  16. MacFarlane, A.; Robertson, S.E.; McCann, J.A.: Parallel computing for passage retrieval (2004) 0.01 
    0.0061666453 = product of:
  0.024666581 = sum of:
    0.024666581 = product of:
      0.049333163 = sum of:
        0.049333163 = weight(_text_:22 in 5108) [ClassicSimilarity], result of:
          0.049333163 = score(doc=5108,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.30952093 = fieldWeight in 5108, 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=5108)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    20. 1.2007 18:30:22
  17. Faloutsos, C.: Signature files (1992) 0.01 
    0.0061666453 = product of:
  0.024666581 = sum of:
    0.024666581 = product of:
      0.049333163 = sum of:
        0.049333163 = weight(_text_:22 in 3499) [ClassicSimilarity], result of:
          0.049333163 = score(doc=3499,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.30952093 = fieldWeight in 3499, 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=3499)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    7. 5.1999 15:22:48
  18. Losada, D.E.; Barreiro, A.: Emebedding term similarity and inverse document frequency into a logical model of information retrieval (2003) 0.01 
    0.0061666453 = product of:
  0.024666581 = sum of:
    0.024666581 = product of:
      0.049333163 = sum of:
        0.049333163 = weight(_text_:22 in 1422) [ClassicSimilarity], result of:
          0.049333163 = score(doc=1422,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = queryNorm
            0.30952093 = fieldWeight in 1422, 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=1422)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 3.2003 19:27:23
  19. Bornmann, L.; Mutz, R.: From P100 to P100' : a new citation-rank approach (2014) 0.01 
    0.0061666453 = product of:
  0.024666581 = sum of:
    0.024666581 = product of:
      0.049333163 = sum of:
        0.049333163 = weight(_text_:22 in 1431) [ClassicSimilarity], result of:
          0.049333163 = score(doc=1431,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = 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.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 8.2014 17:05:18
  20. Tober, M.; Hennig, L.; Furch, D.: SEO Ranking-Faktoren und Rang-Korrelationen 2014 : Google Deutschland (2014) 0.01 
    0.0061666453 = product of:
  0.024666581 = sum of:
    0.024666581 = product of:
      0.049333163 = sum of:
        0.049333163 = weight(_text_:22 in 1484) [ClassicSimilarity], result of:
          0.049333163 = score(doc=1484,freq=2.0), product of:
            0.15938555 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045514934 = 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.25 = coord(1/4)
    Date
    13. 9.2014 14:45:22

Authors

Years

Languages

  • e 34
  • d 7

Types

  • a 34
  • m 4
  • r 2
  • el 1
  • s 1
  • More… Less…

Themes

Subjects

Classifications