Search (2 results, page 1 of 1)

0.016486328 = product of:
  0.049458984 = sum of:
    0.008834538 = weight(_text_:in in 432) [ClassicSimilarity], result of:
      0.008834538 = score(doc=432,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.14877784 = fieldWeight in 432, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=432)
    0.040624447 = weight(_text_:und in 432) [ClassicSimilarity], result of:
      0.040624447 = score(doc=432,freq=12.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.41987535 = fieldWeight in 432, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0546875 = fieldNorm(doc=432)
  0.33333334 = coord(2/6)

Abstract

Suchportale von Bibliotheken haben im Laufe der Zeit immer stärker eine Reduktion auf einfachste Suchmöglichkeiten im Stile von Google erfahren. Das kommt zwar den Gewohnheiten der Nutzer:innen entgegen, schränkt aber die Möglichkeiten einer fundierten Recherche ein. Abhilfe schaffen explorative Suchinstrumente. Damit diese ökonomisch und bedarfsgerecht realisiert werden können, braucht es eine hohe Datenqualität und einen standardisierten Werkzeugkasten zur Umsetzung von Rechercheoberflächen. Anstelle eines Ausbaus der Funktionen von Suchportalen empfiehlt sich daher eine Ausrichtung und Individualisierung zusätzlicher Recherchetools auf konkrete Anwendungskontexte und Nutzertypen.

Footnote

Beitrag in einem Schwerpunktheft: Transfer und Transformation - Bibliotheken als Vermittler im globalen Kontext. Kolloquium anlässlich des 80. Geburtstages von Elmar Mittler.

Source

Bibliothek: Forschung und Praxis. 45(2021) H.2, S.304-316

0.0014873719 = product of:
  0.008924231 = sum of:
    0.008924231 = weight(_text_:in in 2939) [ClassicSimilarity], result of:
      0.008924231 = score(doc=2939,freq=8.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.15028831 = fieldWeight in 2939, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2939)
  0.16666667 = coord(1/6)

Abstract

Libraries, private and public, offer valuable resources to library patrons. As of today, the only way to locate information archived exclusively in libraries is through their catalogs. Library patrons, however, often find it difficult to formulate a proper query, which requires using specific keywords assigned to different fields of desired library catalog records, to obtain relevant results. These improperly formulated queries often yield irrelevant results or no results at all. This negative experience in dealing with existing library systems turns library patrons away from directly querying library catalogs; instead, they rely on Web search engines to perform their searches first, and upon obtaining the initial information (e.g., titles, subject headings, or authors) on the desired library materials, they query library catalogs. This searching strategy is an evidence of failure of today's library systems. In solving this problem, we propose an enhanced library system, which allows partial, similarity matching of (a) tags defined by ordinary users at a folksonomy site that describe the content of books and (b) unrestricted keywords specified by an ordinary library patron in a query to search for relevant library catalog records. The proposed library system allows patrons posting a query Q using commonly used words and ranks the retrieved results according to their degrees of resemblance with Q while maintaining the query processing time comparable with that achieved by current library search engines.