Search (414 results, page 1 of 21)

  • × year_i:[2020 TO 2030}
  1. Vogt, T.: ¬Die Transformation des renommierten Informationsservices zbMATH zu einer Open Access-Plattform für die Mathematik steht vor dem Abschluss. (2020) 0.06
    0.058128864 = product of:
      0.11625773 = sum of:
        0.0516701 = product of:
          0.2583505 = sum of:
            0.2583505 = weight(_text_:c3 in 31) [ClassicSimilarity], result of:
              0.2583505 = score(doc=31,freq=2.0), product of:
                0.29975477 = queryWeight, product of:
                  9.7509775 = idf(docFreq=6, maxDocs=44218)
                  0.030740997 = queryNorm
                0.8618728 = fieldWeight in 31, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  9.7509775 = idf(docFreq=6, maxDocs=44218)
                  0.0625 = fieldNorm(doc=31)
          0.2 = coord(1/5)
        0.06458762 = product of:
          0.2583505 = sum of:
            0.2583505 = weight(_text_:c3 in 31) [ClassicSimilarity], result of:
              0.2583505 = score(doc=31,freq=2.0), product of:
                0.29975477 = queryWeight, product of:
                  9.7509775 = idf(docFreq=6, maxDocs=44218)
                  0.030740997 = queryNorm
                0.8618728 = fieldWeight in 31, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  9.7509775 = idf(docFreq=6, maxDocs=44218)
                  0.0625 = fieldNorm(doc=31)
          0.25 = coord(1/4)
      0.5 = coord(2/4)
    
    Content
    "Mit Beginn des Jahres 2021 wird der umfassende internationale Informationsservice zbMATH in eine Open Access-Plattform überführt. Dann steht dieser bislang kostenpflichtige Dienst weltweit allen Interessierten kostenfrei zur Verfügung. Die Änderung des Geschäftsmodells ermöglicht, die meisten Informationen und Daten von zbMATH für Forschungszwecke und zur Verknüpfung mit anderen nicht-kommerziellen Diensten frei zu nutzen, siehe: https://www.mathematik.de/dmv-blog/2772-transformation-von-zbmath-zu-einer-open-access-plattform-f%C3%BCr-die-mathematik-kurz-vor-dem-abschluss."
  2. Scheven, E.: Qualitätssicherung in der GND (2021) 0.04
    0.042262804 = product of:
      0.08452561 = sum of:
        0.012619193 = weight(_text_:m in 314) [ClassicSimilarity], result of:
          0.012619193 = score(doc=314,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.1649624 = fieldWeight in 314, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=314)
        0.07190642 = sum of:
          0.046916533 = weight(_text_:da in 314) [ClassicSimilarity], result of:
            0.046916533 = score(doc=314,freq=2.0), product of:
              0.1475006 = queryWeight, product of:
                4.7981725 = idf(docFreq=990, maxDocs=44218)
                0.030740997 = queryNorm
              0.31807688 = fieldWeight in 314, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.7981725 = idf(docFreq=990, maxDocs=44218)
                0.046875 = fieldNorm(doc=314)
          0.024989884 = weight(_text_:22 in 314) [ClassicSimilarity], result of:
            0.024989884 = score(doc=314,freq=2.0), product of:
              0.107649736 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.030740997 = queryNorm
              0.23214069 = fieldWeight in 314, 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=314)
      0.5 = coord(2/4)
    
    Abstract
    Was mag das Akronym GND bedeuten? Lassen wir der Fantasie freien Lauf, kommen wir auf Auflösungen wie Golfer nehmen Datteln, Gerne noch Details, Glück nach Dauerstress, Größter Nutzen Deutschlands und vieles mehr. Eine ernsthaftere Recherche führt zur Gesamtnutzungsdauer oder auf einen Sachverhalt der Elektrotechnik: Die von einer Stromquelle bereitgestellte Spannung bezieht sich stets auf ein Grundniveau. Dieses Grundniveau wird auf Deutsch als Masse, im Englischen aber als ground oder GND bezeichnet. Techniker kennen das Schaltzeichen dafür: Für den informationswissenschaftlichen Bereich steht dagegen GND für die Gemeinsame Normdatei. Auch sie hat (seit 2020) ein Zeichen. Da die Gemeinsame Normdatei (im weiteren Text nur noch GND) auch ein Instrument der Inhaltserschließung ist, beeinflussen ihre Stärken und Schwächen die Qualität der Inhaltserschließung. Deshalb widmet sich dieser Artikel der Qualitätssicherung in der GND.
    Date
    23. 9.2021 19:12:22
    Source
    Qualität in der Inhaltserschließung. Hrsg.: M. Franke-Maier, u.a
  3. Bischoff, M.: ¬Das grosse Experiment (2021) 0.03
    0.03006455 = product of:
      0.0601291 = sum of:
        0.021031989 = weight(_text_:m in 329) [ClassicSimilarity], result of:
          0.021031989 = score(doc=329,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.27493733 = fieldWeight in 329, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.078125 = fieldNorm(doc=329)
        0.039097108 = product of:
          0.078194216 = sum of:
            0.078194216 = weight(_text_:da in 329) [ClassicSimilarity], result of:
              0.078194216 = score(doc=329,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.5301281 = fieldWeight in 329, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.078125 = fieldNorm(doc=329)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    Zahlreiche konkurrierende wissenschaftliche Theorien versuchen, das Bewusstsein zu beschreiben. In einer noch nie da gewesenen Kollaboration finden nun weltweit Versuche an hunderten Probanden statt, um zwei der führenden Ansätze auf den Prüfstand zu stellen.
  4. Dietz, K.: en.wikipedia.org > 6 Mio. Artikel (2020) 0.03
    0.026029129 = product of:
      0.052058257 = sum of:
        0.024412425 = product of:
          0.122062124 = sum of:
            0.122062124 = weight(_text_:3a in 5669) [ClassicSimilarity], result of:
              0.122062124 = score(doc=5669,freq=2.0), product of:
                0.2606225 = queryWeight, product of:
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.030740997 = queryNorm
                0.46834838 = fieldWeight in 5669, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=5669)
          0.2 = coord(1/5)
        0.027645834 = product of:
          0.055291668 = sum of:
            0.055291668 = weight(_text_:da in 5669) [ClassicSimilarity], result of:
              0.055291668 = score(doc=5669,freq=4.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.37485722 = fieldWeight in 5669, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=5669)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Content
    "Die Englischsprachige Wikipedia verfügt jetzt über mehr als 6 Millionen Artikel. An zweiter Stelle kommt die deutschsprachige Wikipedia mit 2.3 Millionen Artikeln, an dritter Stelle steht die französischsprachige Wikipedia mit 2.1 Millionen Artikeln (via Researchbuzz: Firehose <https://rbfirehose.com/2020/01/24/techcrunch-wikipedia-now-has-more-than-6-million-articles-in-english/> und Techcrunch <https://techcrunch.com/2020/01/23/wikipedia-english-six-million-articles/?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed%3A+Techcrunch+%28TechCrunch%29&guccounter=1&guce_referrer=aHR0cHM6Ly9yYmZpcmVob3NlLmNvbS8yMDIwLzAxLzI0L3RlY2hjcnVuY2gtd2lraXBlZGlhLW5vdy1oYXMtbW9yZS10aGFuLTYtbWlsbGlvbi1hcnRpY2xlcy1pbi1lbmdsaXNoLw&guce_referrer_sig=AQAAAK0zHfjdDZ_spFZBF_z-zDjtL5iWvuKDumFTzm4HvQzkUfE2pLXQzGS6FGB_y-VISdMEsUSvkNsg2U_NWQ4lwWSvOo3jvXo1I3GtgHpP8exukVxYAnn5mJspqX50VHIWFADHhs5AerkRn3hMRtf_R3F1qmEbo8EROZXp328HMC-o>). 250120 via digithek ch = #fineBlog s.a.: Angesichts der Veröffentlichung des 6-millionsten Artikels vergangene Woche in der englischsprachigen Wikipedia hat die Community-Zeitungsseite "Wikipedia Signpost" ein Moratorium bei der Veröffentlichung von Unternehmensartikeln gefordert. Das sei kein Vorwurf gegen die Wikimedia Foundation, aber die derzeitigen Maßnahmen, um die Enzyklopädie gegen missbräuchliches undeklariertes Paid Editing zu schützen, funktionierten ganz klar nicht. *"Da die ehrenamtlichen Autoren derzeit von Werbung in Gestalt von Wikipedia-Artikeln überwältigt werden, und da die WMF nicht in der Lage zu sein scheint, dem irgendetwas entgegenzusetzen, wäre der einzige gangbare Weg für die Autoren, fürs erste die Neuanlage von Artikeln über Unternehmen zu untersagen"*, schreibt der Benutzer Smallbones in seinem Editorial <https://en.wikipedia.org/wiki/Wikipedia:Wikipedia_Signpost/2020-01-27/From_the_editor> zur heutigen Ausgabe."
  5. Ibrahim, G.M.; Taylor, M.: Krebszellen manipulieren Neurone : Gliome (2023) 0.03
    0.025114134 = product of:
      0.050228268 = sum of:
        0.025238385 = weight(_text_:m in 1203) [ClassicSimilarity], result of:
          0.025238385 = score(doc=1203,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.3299248 = fieldWeight in 1203, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.09375 = fieldNorm(doc=1203)
        0.024989884 = product of:
          0.04997977 = sum of:
            0.04997977 = weight(_text_:22 in 1203) [ClassicSimilarity], result of:
              0.04997977 = score(doc=1203,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.46428138 = fieldWeight in 1203, 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=1203)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Source
    Spektrum der Wissenschaft. 2023, H.10, S.22-24
  6. Hubert, M.; Griesbaum, J.; Womser-Hacker, C.: Usability von Browsererweiterungen zum Schutz vor Tracking (2020) 0.02
    0.021045186 = product of:
      0.04209037 = sum of:
        0.014722392 = weight(_text_:m in 5866) [ClassicSimilarity], result of:
          0.014722392 = score(doc=5866,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.19245613 = fieldWeight in 5866, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5866)
        0.027367977 = product of:
          0.054735955 = sum of:
            0.054735955 = weight(_text_:da in 5866) [ClassicSimilarity], result of:
              0.054735955 = score(doc=5866,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.3710897 = fieldWeight in 5866, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=5866)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    Browsererweiterungen zum Schutz vor Tracking stellen beliebte Werkzeuge zum Schutz der Privatsphäre von Nutzerinnen und Nutzern dar. Ihre tatsächliche Effektivität ist in hohem Maße von ihrer Usability abhängig, da diese bestimmt, in welchem Ausmaß diese Werkzeuge effektiv, effizient und zufriedenstellend genutzt werden können. Die vorliegende Untersuchung prüft die Gebrauchstauglichkeit vier solcher Browsererweiterungen mit Hilfe von Benutzertests. Die Ergebnisse zeigen, dass die Add-ons auch heutzutage noch eine Vielzahl an Usability-Mängeln aufweisen. Kernprobleme stellen insbesondere die mangelnde Verständlichkeit und die fehlende Führung und Unterstützung der Nutzenden dar.
  7. Katzlberger, M.: GPT-3 - die erste allgemeine Künstliche Intelligenz? (2020) 0.02
    0.021045186 = product of:
      0.04209037 = sum of:
        0.014722392 = weight(_text_:m in 45) [ClassicSimilarity], result of:
          0.014722392 = score(doc=45,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.19245613 = fieldWeight in 45, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0546875 = fieldNorm(doc=45)
        0.027367977 = product of:
          0.054735955 = sum of:
            0.054735955 = weight(_text_:da in 45) [ClassicSimilarity], result of:
              0.054735955 = score(doc=45,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.3710897 = fieldWeight in 45, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=45)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Content
    Vgl. auch: https://openai.com/blog/openai-api/. Vgl. auch: https://www.heise.de/hintergrund/GPT-3-Schockierend-guter-Sprachgenerator-4867089.html. Vgl. auch: https://www.heise.de/news/heiseshow-Wenn-Maschinen-philosophieren-wo-bleibt-da-der-Mensch-4974474.html?view=print.
  8. Weiß, E.-M.: ChatGPT soll es richten : Microsoft baut KI in Suchmaschine Bing ein (2023) 0.02
    0.021045186 = product of:
      0.04209037 = sum of:
        0.014722392 = weight(_text_:m in 866) [ClassicSimilarity], result of:
          0.014722392 = score(doc=866,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.19245613 = fieldWeight in 866, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0546875 = fieldNorm(doc=866)
        0.027367977 = product of:
          0.054735955 = sum of:
            0.054735955 = weight(_text_:da in 866) [ClassicSimilarity], result of:
              0.054735955 = score(doc=866,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.3710897 = fieldWeight in 866, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=866)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    ChatGPT, die künstliche Intelligenz der Stunde, ist von OpenAI entwickelt worden. Und OpenAI ist in der Vergangenheit nicht unerheblich von Microsoft unterstützt worden. Nun geht es ums Profitieren: Die KI soll in die Suchmaschine Bing eingebaut werden, was eine direkte Konkurrenz zu Googles Suchalgorithmen und Intelligenzen bedeutet. Bing war da bislang nicht sonderlich erfolgreich. Wie "The Information" mit Verweis auf zwei Insider berichtet, plant Microsoft, ChatGPT in seine Suchmaschine Bing einzubauen. Bereits im März könnte die neue, intelligente Suche verfügbar sein. Microsoft hatte zuvor auf der hauseigenen Messe Ignite zunächst die Integration des Bildgenerators DALL·E 2 in seine Suchmaschine angekündigt - ohne konkretes Startdatum jedoch. Fragt man ChatGPT selbst, bestätigt der Chatbot seine künftige Aufgabe noch nicht. Weiß aber um potentielle Vorteile.
  9. Noever, D.; Ciolino, M.: ¬The Turing deception (2022) 0.02
    0.02095705 = product of:
      0.0419141 = sum of:
        0.029294908 = product of:
          0.14647454 = sum of:
            0.14647454 = weight(_text_:3a in 862) [ClassicSimilarity], result of:
              0.14647454 = score(doc=862,freq=2.0), product of:
                0.2606225 = queryWeight, product of:
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.030740997 = queryNorm
                0.56201804 = fieldWeight in 862, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.046875 = fieldNorm(doc=862)
          0.2 = coord(1/5)
        0.012619193 = weight(_text_:m in 862) [ClassicSimilarity], result of:
          0.012619193 = score(doc=862,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.1649624 = fieldWeight in 862, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=862)
      0.5 = coord(2/4)
    
    Source
    https%3A%2F%2Farxiv.org%2Fabs%2F2212.06721&usg=AOvVaw3i_9pZm9y_dQWoHi6uv0EN
  10. Kempf, K.; Brantl, M.; Meiers, T.; Wolf, T.: Auf der Suche nach dem verborgenen Bild : Künstliche Intelligenz erschließt historische Bibliotheksbestände (2021) 0.02
    0.01803873 = product of:
      0.03607746 = sum of:
        0.012619193 = weight(_text_:m in 147) [ClassicSimilarity], result of:
          0.012619193 = score(doc=147,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.1649624 = fieldWeight in 147, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=147)
        0.023458267 = product of:
          0.046916533 = sum of:
            0.046916533 = weight(_text_:da in 147) [ClassicSimilarity], result of:
              0.046916533 = score(doc=147,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.31807688 = fieldWeight in 147, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.046875 = fieldNorm(doc=147)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    Die von den Nutzern hochgeladenen Bilder werden nicht in den Bestand eingebracht; nach einmaliger Verwendung für eine Suche werden Uploads umgehend wieder gelöscht. Die Upload-Option gehört zu den beliebtesten Funktionen des Online-Angebotes. Das Frontend bietet zudem eine Konfigurationsmöglichkeit zur Gewichtung der Suchparameter. So kann der Schwerpunkt auf die Farb- oder die Kantenmerkmale verschoben werden. Die besten Treffer ergeben sich bei einem ausgewogenen Verhältnis von Farb- und Kantenmerkmalen. Eine Suche nach reiner Farbähnlichkeit ergibt allerdings keinen Sinn, da Farbe allein kein ausreichendes Ähnlichkeitskriterium ist. Durch Vorgabe eines Schwellenwertes (zwischen 0,1 und 1,0) lässt sich bestimmen, wie stark die Ergebnisbilder vom Suchbild abweichen sollten. Je niedriger der Wert, desto größer die zulässigen Differenzen. Hierbei ergeben sich die besten Treffer bei einem Wert zwischen 0,85 und 0,95.
  11. Wartena, C.; Golub, K.: Evaluierung von Verschlagwortung im Kontext des Information Retrievals (2021) 0.02
    0.015032275 = product of:
      0.03006455 = sum of:
        0.010515994 = weight(_text_:m in 376) [ClassicSimilarity], result of:
          0.010515994 = score(doc=376,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.13746867 = fieldWeight in 376, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=376)
        0.019548554 = product of:
          0.039097108 = sum of:
            0.039097108 = weight(_text_:da in 376) [ClassicSimilarity], result of:
              0.039097108 = score(doc=376,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.26506406 = fieldWeight in 376, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=376)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    Dieser Beitrag möchte einen Überblick über die in der Literatur diskutierten Möglichkeiten, Herausforderungen und Grenzen geben, Retrieval als eine extrinsische Evaluierungsmethode für die Ergebnisse verbaler Sacherschließung zu nutzen. Die inhaltliche Erschließung im Allgemeinen und die Verschlagwortung im Besonderen können intrinsisch oder extrinsisch evaluiert werden. Die intrinsische Evaluierung bezieht sich auf Eigenschaften der Erschließung, von denen vermutet wird, dass sie geeignete Indikatoren für die Qualität der Erschließung sind, wie formale Einheitlichkeit (im Hinblick auf die Anzahl zugewiesener Deskriptoren pro Dokument, auf die Granularität usw.), Konsistenz oder Übereinstimmung der Ergebnisse verschiedener Erschließer:innen. Bei einer extrinsischen Evaluierung geht es darum, die Qualität der gewählten Deskriptoren daran zu messen, wie gut sie sich tatsächlich bei der Suche bewähren. Obwohl die extrinsische Evaluierung direktere Auskunft darüber gibt, ob die Erschließung ihren Zweck erfüllt, und daher den Vorzug verdienen sollte, ist sie kompliziert und oft problematisch. In einem Retrievalsystem greifen verschiedene Algorithmen und Datenquellen in vielschichtiger Weise ineinander und interagieren bei der Evaluierung darüber hinaus noch mit Nutzer:innen und Rechercheaufgaben. Die Evaluierung einer Komponente im System kann nicht einfach dadurch vorgenommen werden, dass man sie austauscht und mit einer anderen Komponente vergleicht, da die gleiche Ressource oder der gleiche Algorithmus sich in unterschiedlichen Umgebungen unterschiedlich verhalten kann. Wir werden relevante Evaluierungsansätze vorstellen und diskutieren, und zum Abschluss einige Empfehlungen für die Evaluierung von Verschlagwortung im Kontext von Retrieval geben.
    Source
    Qualität in der Inhaltserschließung. Hrsg.: M. Franke-Maier, u.a
  12. Garrel, J. von; Mayer, J.; Mühlfeld, M.: Künstliche Intelligenz im Studium : eine quantitative Befragung von Studierenden zur Nutzung von ChatGPT & Co. (2023) 0.02
    0.015032275 = product of:
      0.03006455 = sum of:
        0.010515994 = weight(_text_:m in 1006) [ClassicSimilarity], result of:
          0.010515994 = score(doc=1006,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.13746867 = fieldWeight in 1006, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1006)
        0.019548554 = product of:
          0.039097108 = sum of:
            0.039097108 = weight(_text_:da in 1006) [ClassicSimilarity], result of:
              0.039097108 = score(doc=1006,freq=2.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.26506406 = fieldWeight in 1006, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=1006)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Source
    https://opus4.kobv.de/opus4-h-da/frontdoor/deliver/index/docId/395/file/befragung_ki-im-studium.pdf
  13. Almeida, M.B.: Ontologia em Ciência da Informação: Teoria e Método (1ª ed., Vol. 1). CRV. http://dx.doi.org/10.24824/978655578679.8; Tecnologia e Aplicações (1ª ed., Vol. 2). CRV. http://dx.doi.org/10.24824/978652511477.4; Curso completo com teoria e exercícios (1ª ed., volume suplementar para professores). CRV. [Review] (2022) 0.01
    0.014365196 = product of:
      0.057460785 = sum of:
        0.057460785 = product of:
          0.11492157 = sum of:
            0.11492157 = weight(_text_:da in 631) [ClassicSimilarity], result of:
              0.11492157 = score(doc=631,freq=12.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.7791261 = fieldWeight in 631, product of:
                  3.4641016 = tf(freq=12.0), with freq of:
                    12.0 = termFreq=12.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.046875 = fieldNorm(doc=631)
          0.5 = coord(1/2)
      0.25 = coord(1/4)
    
    Abstract
    Nos últimos 30 anos, o tema das ontologias tem sido um dos terrenos mais férteis de investigação na área da Organização do Conhecimento. É um tema complexo e revestido de polémica, pela dificuldade na definição do próprio conceito e pelas apropriações que diferentes campos científicos têm exercido sobre ele. Com origem no domínio da filosofia, a ontologia é hoje um território partilhado pelas Ciências da Computação, com destaque para a Ciência dos Dados (Data Science), e pela Ciência da Informação, particularmente pela Organização do Conhecimento. São raros os autores desta área que não escreveram sobre o tema, abordando as suas fronteiras conceptuais ou discutindo a relação das ontologias com outros sistemas de organização do conhecimento, como as taxonomias, os tesauros ou as classificações.
    Source
    Boletim do Arquivo da Universidade de Coimbra 35(2022) no.1, S.191-198
  14. Thelwall, M.; Kousha, K.; Abdoli, M.; Stuart, E.; Makita, M.; Wilson, P.; Levitt, J.: Why are coauthored academic articles more cited : higher quality or larger audience? (2023) 0.01
    0.014313344 = product of:
      0.028626688 = sum of:
        0.018214235 = weight(_text_:m in 995) [ClassicSimilarity], result of:
          0.018214235 = score(doc=995,freq=6.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.2381027 = fieldWeight in 995, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=995)
        0.010412452 = product of:
          0.020824904 = sum of:
            0.020824904 = weight(_text_:22 in 995) [ClassicSimilarity], result of:
              0.020824904 = score(doc=995,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.19345059 = fieldWeight in 995, 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=995)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Date
    22. 6.2023 18:11:50
  15. Hoeber, O.; Harvey, M.; Dewan Sagar, S.A.; Pointon, M.: ¬The effects of simulated interruptions on mobile search tasks (2022) 0.01
    0.012642156 = product of:
      0.025284313 = sum of:
        0.014871862 = weight(_text_:m in 563) [ClassicSimilarity], result of:
          0.014871862 = score(doc=563,freq=4.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.19441006 = fieldWeight in 563, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=563)
        0.010412452 = product of:
          0.020824904 = sum of:
            0.020824904 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
              0.020824904 = score(doc=563,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.19345059 = fieldWeight in 563, 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=563)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Date
    3. 5.2022 13:22:33
  16. Zhang, L.; Lu, W.; Yang, J.: LAGOS-AND : a large gold standard dataset for scholarly author name disambiguation (2023) 0.01
    0.012642156 = product of:
      0.025284313 = sum of:
        0.014871862 = weight(_text_:m in 883) [ClassicSimilarity], result of:
          0.014871862 = score(doc=883,freq=4.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.19441006 = fieldWeight in 883, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=883)
        0.010412452 = product of:
          0.020824904 = sum of:
            0.020824904 = weight(_text_:22 in 883) [ClassicSimilarity], result of:
              0.020824904 = score(doc=883,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.19345059 = fieldWeight in 883, 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=883)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Abstract
    In this article, we present a method to automatically build large labeled datasets for the author ambiguity problem in the academic world by leveraging the authoritative academic resources, ORCID and DOI. Using the method, we built LAGOS-AND, two large, gold-standard sub-datasets for author name disambiguation (AND), of which LAGOS-AND-BLOCK is created for clustering-based AND research and LAGOS-AND-PAIRWISE is created for classification-based AND research. Our LAGOS-AND datasets are substantially different from the existing ones. The initial versions of the datasets (v1.0, released in February 2021) include 7.5 M citations authored by 798 K unique authors (LAGOS-AND-BLOCK) and close to 1 M instances (LAGOS-AND-PAIRWISE). And both datasets show close similarities to the whole Microsoft Academic Graph (MAG) across validations of six facets. In building the datasets, we reveal the variation degrees of last names in three literature databases, PubMed, MAG, and Semantic Scholar, by comparing author names hosted to the authors' official last names shown on the ORCID pages. Furthermore, we evaluate several baseline disambiguation methods as well as the MAG's author IDs system on our datasets, and the evaluation helps identify several interesting findings. We hope the datasets and findings will bring new insights for future studies. The code and datasets are publicly available.
    Date
    22. 1.2023 18:40:36
  17. Geras, A.; Siudem, G.; Gagolewski, M.: Should we introduce a dislike button for academic articles? (2020) 0.01
    0.012557067 = product of:
      0.025114134 = sum of:
        0.012619193 = weight(_text_:m in 5620) [ClassicSimilarity], result of:
          0.012619193 = score(doc=5620,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.1649624 = fieldWeight in 5620, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=5620)
        0.012494942 = product of:
          0.024989884 = sum of:
            0.024989884 = weight(_text_:22 in 5620) [ClassicSimilarity], result of:
              0.024989884 = score(doc=5620,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.23214069 = fieldWeight in 5620, 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=5620)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Date
    6. 1.2020 18:10:22
  18. Hertzum, M.: Information seeking by experimentation : trying something out to discover what happens (2023) 0.01
    0.012557067 = product of:
      0.025114134 = sum of:
        0.012619193 = weight(_text_:m in 915) [ClassicSimilarity], result of:
          0.012619193 = score(doc=915,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.1649624 = fieldWeight in 915, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.046875 = fieldNorm(doc=915)
        0.012494942 = product of:
          0.024989884 = sum of:
            0.024989884 = weight(_text_:22 in 915) [ClassicSimilarity], result of:
              0.024989884 = score(doc=915,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.23214069 = fieldWeight in 915, 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=915)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Date
    21. 3.2023 19:22:29
  19. Zhang, D.; Wu, C.: What online review features really matter? : an explainable deep learning approach for hotel demand forecasting (2023) 0.01
    0.010927975 = product of:
      0.0437119 = sum of:
        0.0437119 = product of:
          0.0874238 = sum of:
            0.0874238 = weight(_text_:da in 1039) [ClassicSimilarity], result of:
              0.0874238 = score(doc=1039,freq=10.0), product of:
                0.1475006 = queryWeight, product of:
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.030740997 = queryNorm
                0.5927013 = fieldWeight in 1039, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  4.7981725 = idf(docFreq=990, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=1039)
          0.5 = coord(1/2)
      0.25 = coord(1/4)
    
    Abstract
    Accurate demand forecasting plays a critical role in hotel revenue management. Online reviews have emerged as a viable information source for hotel demand forecasting. However, existing hotel demand forecasting studies leverage only sentiment information from online reviews, leading to capturing insufficient information. Furthermore, prevailing hotel demand forecasting methods either lack explainability or fail to capture local correlations within sequences. In this study, we (1) propose a comprehensive framework consisting of four components: expertise, sentiment, popularity, and novelty (ESPN framework), to investigate the impact of online reviews on hotel demand forecasting; (2) propose a novel dual attention-based long short-term memory convolutional neural network (DA-LSTM-CNN) model to optimize the model effectiveness. We collected online review data from Ctrip.com to evaluate our proposed ESPN framework and DA-LSTM-CNN model. The empirical results show that incorporating features derived from the ESPN improves forecasting accuracy and our DA-LSTM-CNN significantly outperforms the state-of-the-art models. Further, we use a case study to illustrate the explainability of the DA-LSTM-CNN, which could guide future setups for hotel demand forecasting systems. We discuss how stakeholders can benefit from our proposed ESPN framework and DA-LSTM-CNN model.
  20. Kang, M.: Dual paths to continuous online knowledge sharing : a repetitive behavior perspective (2020) 0.01
    0.010464223 = product of:
      0.020928446 = sum of:
        0.010515994 = weight(_text_:m in 5985) [ClassicSimilarity], result of:
          0.010515994 = score(doc=5985,freq=2.0), product of:
            0.07649739 = queryWeight, product of:
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.030740997 = queryNorm
            0.13746867 = fieldWeight in 5985, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.4884486 = idf(docFreq=9980, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5985)
        0.010412452 = product of:
          0.020824904 = sum of:
            0.020824904 = weight(_text_:22 in 5985) [ClassicSimilarity], result of:
              0.020824904 = score(doc=5985,freq=2.0), product of:
                0.107649736 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.030740997 = queryNorm
                0.19345059 = fieldWeight in 5985, 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=5985)
          0.5 = coord(1/2)
      0.5 = coord(2/4)
    
    Date
    20. 1.2015 18:30:22

Languages

  • e 241
  • d 167
  • pt 4
  • m 2
  • More… Less…

Types

  • a 330
  • el 73
  • m 64
  • s 10
  • p 3
  • r 1
  • x 1
  • More… Less…

Subjects

Classifications