Search (62 results, page 1 of 4)

  • × theme_ss:"Suchmaschinen"
  • × type_ss:"a"
  • × year_i:[2010 TO 2020}
  1. Bouidghaghen, O.; Tamine, L.: Spatio-temporal based personalization for mobile search (2012) 0.03
    0.03375241 = product of:
      0.078755625 = sum of:
        0.046337012 = weight(_text_:retrieval in 108) [ClassicSimilarity], result of:
          0.046337012 = score(doc=108,freq=8.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.40105087 = fieldWeight in 108, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=108)
        0.022068607 = weight(_text_:internet in 108) [ClassicSimilarity], result of:
          0.022068607 = score(doc=108,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.1957077 = fieldWeight in 108, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=108)
        0.010350002 = product of:
          0.031050006 = sum of:
            0.031050006 = weight(_text_:22 in 108) [ClassicSimilarity], result of:
              0.031050006 = score(doc=108,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.23214069 = fieldWeight in 108, 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=108)
          0.33333334 = coord(1/3)
      0.42857143 = coord(3/7)
    
    Abstract
    The explosion of the information available on the Internet has made traditional information retrieval systems, characterized by one size fits all approaches, less effective. Indeed, users are overwhelmed by the information delivered by such systems in response to their queries, particularly when the latter are ambiguous. In order to tackle this problem, the state-of-the-art reveals that there is a growing interest towards contextual information retrieval (CIR) which relies on various sources of evidence issued from the user's search background and environment, in order to improve the retrieval accuracy. This chapter focuses on mobile context, highlights challenges they present for IR, and gives an overview of CIR approaches applied in this environment. Then, the authors present an approach to personalize search results for mobile users by exploiting both cognitive and spatio-temporal contexts. The experimental evaluation undertaken in front of Yahoo search shows that the approach improves the quality of top search result lists and enhances search result precision.
    Date
    20. 4.2012 13:19:22
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  2. Peters, I.: Folksonomies und kollaborative Informationsdienste : eine Alternative zur Websuche? (2011) 0.03
    0.031817753 = product of:
      0.07424142 = sum of:
        0.030891342 = weight(_text_:retrieval in 343) [ClassicSimilarity], result of:
          0.030891342 = score(doc=343,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.26736724 = fieldWeight in 343, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=343)
        0.02942481 = weight(_text_:internet in 343) [ClassicSimilarity], result of:
          0.02942481 = score(doc=343,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.2609436 = fieldWeight in 343, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0625 = fieldNorm(doc=343)
        0.013925271 = product of:
          0.04177581 = sum of:
            0.04177581 = weight(_text_:29 in 343) [ClassicSimilarity], result of:
              0.04177581 = score(doc=343,freq=2.0), product of:
                0.13436082 = queryWeight, product of:
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.03819578 = queryNorm
                0.31092256 = fieldWeight in 343, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.0625 = fieldNorm(doc=343)
          0.33333334 = coord(1/3)
      0.42857143 = coord(3/7)
    
    Abstract
    Folksonomies ermöglichen den Nutzern in Kollaborativen Informationsdiensten den Zugang zu verschiedenartigen Informationsressourcen. In welchen Fällen beide Bestandteile des Web 2.0 am besten für das Information Retrieval geeignet sind und wo sie die Websuche ggf. ersetzen können, wird in diesem Beitrag diskutiert. Dazu erfolgt eine detaillierte Betrachtung der Reichweite von Social-Bookmarking-Systemen und Sharing-Systemen sowie der Retrievaleffektivität von Folksonomies innerhalb von Kollaborativen Informationsdiensten.
    Pages
    S.29-53
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
  3. Fluhr, C.: Crosslingual access to photo databases (2012) 0.02
    0.023823049 = product of:
      0.055587113 = sum of:
        0.023168506 = weight(_text_:retrieval in 93) [ClassicSimilarity], result of:
          0.023168506 = score(doc=93,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.20052543 = fieldWeight in 93, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=93)
        0.022068607 = weight(_text_:internet in 93) [ClassicSimilarity], result of:
          0.022068607 = score(doc=93,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.1957077 = fieldWeight in 93, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=93)
        0.010350002 = product of:
          0.031050006 = sum of:
            0.031050006 = weight(_text_:22 in 93) [ClassicSimilarity], result of:
              0.031050006 = score(doc=93,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.23214069 = fieldWeight in 93, 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=93)
          0.33333334 = coord(1/3)
      0.42857143 = coord(3/7)
    
    Abstract
    This paper is about search of photos in photo databases of agencies which sell photos over the Internet. The problem is far from the behavior of photo databases managed by librarians and also far from the corpora generally used for research purposes. The descriptions use mainly single words and it is well known that it is not the best way to have a good search. This increases the problem of semantic ambiguity. This problem of semantic ambiguity is crucial for cross-language querying. On the other hand, users are not aware of documentation techniques and use generally very simple queries but want to get precise answers. This paper gives the experience gained in a 3 year use (2006-2008) of a cross-language access to several of the main international commercial photo databases. The languages used were French, English, and German.
    Date
    17. 4.2012 14:25:22
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  4. Karaman, F.: Artificial intelligence enabled search engines (AIESE) and the implications (2012) 0.02
    0.018278554 = product of:
      0.06397494 = sum of:
        0.032765217 = weight(_text_:retrieval in 110) [ClassicSimilarity], result of:
          0.032765217 = score(doc=110,freq=4.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.2835858 = fieldWeight in 110, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=110)
        0.031209724 = weight(_text_:internet in 110) [ClassicSimilarity], result of:
          0.031209724 = score(doc=110,freq=4.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.27677247 = fieldWeight in 110, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=110)
      0.2857143 = coord(2/7)
    
    Abstract
    Search engines are the major means of information retrieval over the Internet. People's dependence on them increases over time as SEs introduce new and sophisticated technologies. The developments in the Artificial Intelligence (AI) will transform the current search engines Artificial Intelligence Enabled Search Engines (AIESE). Search engines already play a critical role in classifying, sorting and delivering the information over the Internet. However, as Internet's mainstream role becomes more apparent and AI technology increases the sophistication of the tools of the SEs, their roles will become much more critical. Since, the future of search engines are examined, the technological singularity concept is analyzed in detail. Second and third order indirect side effects are analyzed. A four-stage evolution-model is suggested.
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  5. Lewandowski, D.; Krewinkel, A.; Gleissner, M.; Osterode, D.; Tolg, B.; Holle, M.; Sünkler, S.: Entwicklung und Anwendung einer Software zur automatisierten Kontrolle des Lebensmittelmarktes im Internet mit informationswissenschaftlichen Methoden (2019) 0.02
    0.018278554 = product of:
      0.06397494 = sum of:
        0.032765217 = weight(_text_:retrieval in 5025) [ClassicSimilarity], result of:
          0.032765217 = score(doc=5025,freq=4.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.2835858 = fieldWeight in 5025, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=5025)
        0.031209724 = weight(_text_:internet in 5025) [ClassicSimilarity], result of:
          0.031209724 = score(doc=5025,freq=4.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.27677247 = fieldWeight in 5025, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=5025)
      0.2857143 = coord(2/7)
    
    Abstract
    In diesem Artikel präsentieren wir die Durchführung und die Ergebnisse eines interdisziplinären Forschungsprojekts zum Thema automatisierte Lebensmittelkontrolle im Web. Es wurden Kompetenzen aus den Disziplinen Lebensmittelwissenschaft, Rechtswissenschaft, Informationswissenschaft und Informatik dazu genutzt, ein detailliertes Konzept und einen Software-Prototypen zu entwickeln, um das Internet nach Produktangeboten zu durchsuchen, die gegen das Lebensmittelrecht verstoßen. Dabei wird deutlich, wie ein solcher Anwendungsfall von den Methoden der Information-Retrieval-Evaluierung profitiert, und wie sich mit relativ geringem Aufwand eine flexible Software programmieren lässt, die auch für eine Vielzahl anderer Fragestellungen einsetzbar ist. Die Ergebnisse des Projekts zeigen, wie komplexe Arbeitsprozesse einer Behörde mit Hilfe der Methoden von Retrieval-Tests und gängigen Verfahren aus dem maschinellen Lernen effektiv und effizient unterstützt werden können.
  6. Franke-Maier, M.; Rüter, C.: Discover Sacherschließung! : Was machen suchmaschinenbasierte Systeme mit unseren inhaltlichen Metadaten? (2015) 0.02
    0.01770752 = product of:
      0.061976317 = sum of:
        0.049791705 = weight(_text_:bibliothek in 1706) [ClassicSimilarity], result of:
          0.049791705 = score(doc=1706,freq=2.0), product of:
            0.15681393 = queryWeight, product of:
              4.1055303 = idf(docFreq=1980, maxDocs=44218)
              0.03819578 = queryNorm
            0.31752092 = fieldWeight in 1706, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.1055303 = idf(docFreq=1980, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1706)
        0.0121846115 = product of:
          0.036553834 = sum of:
            0.036553834 = weight(_text_:29 in 1706) [ClassicSimilarity], result of:
              0.036553834 = score(doc=1706,freq=2.0), product of:
                0.13436082 = queryWeight, product of:
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.03819578 = queryNorm
                0.27205724 = fieldWeight in 1706, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=1706)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Abstract
    Discovery Systeme erlauben einen neuen und anderen Zugriff auf verfügbare Ressourcen einer Bibliothek als die traditionellen Online-Kataloge. Daraus ergeben sich Probleme, aber auch Chancen für die Nutzung und Sichtbarkeit der bibliothekarischen Sacherschließung. Der Vortrag gibt einen Einblick in die Funktionalitäten und Funktionsweisen von Discovery Systemen am Beispiel eines großen Players, Primo von ExLibris, sowie die Auswirkungen auf bibliothekarische inhaltliche Metadaten. Es werden Chancen und Grenzen der Technik beleuchtet. Der Vortrag schließt mit der Reflektion der Implikationen für die Arbeit im Fachreferat.
    Date
    2. 3.2015 10:29:44
  7. Luo, M.M.; Nahl, D.: Let's Google : uncertainty and bilingual search (2019) 0.02
    0.015666807 = product of:
      0.054833822 = sum of:
        0.032765217 = weight(_text_:retrieval in 5363) [ClassicSimilarity], result of:
          0.032765217 = score(doc=5363,freq=4.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.2835858 = fieldWeight in 5363, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=5363)
        0.022068607 = weight(_text_:internet in 5363) [ClassicSimilarity], result of:
          0.022068607 = score(doc=5363,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.1957077 = fieldWeight in 5363, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=5363)
      0.2857143 = coord(2/7)
    
    Abstract
    This study applies Kuhlthau's Information Search Process stage (ISP) model to understand bilingual users' Internet search experience. We conduct a quasi-field experiment with 30 bilingual searchers and the results suggested that the ISP model was applicable in studying searchers' information retrieval behavior in search tasks. The ISP model was applicable in studying searchers' information retrieval behavior in simple tasks. However, searchers' emotional responses differed from those of the ISP model for a complex task. By testing searchers using different search strategies, the results suggested that search engines with multilanguage search functions provide an advantage for bilingual searchers in the Internet's multilingual environment. The findings showed that when searchers used a search engine as a tool for problem solving, they might experience different feelings in each ISP stage than in searching for information for a term paper using a library. The results echo other research findings that indicate that information seeking is a multifaceted phenomenon.
  8. Fu, T.; Abbasi, A.; Chen, H.: ¬A focused crawler for Dark Web forums (2010) 0.01
    0.014617252 = product of:
      0.05116038 = sum of:
        0.019307088 = weight(_text_:retrieval in 3471) [ClassicSimilarity], result of:
          0.019307088 = score(doc=3471,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.16710453 = fieldWeight in 3471, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3471)
        0.031853292 = weight(_text_:internet in 3471) [ClassicSimilarity], result of:
          0.031853292 = score(doc=3471,freq=6.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.28247973 = fieldWeight in 3471, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3471)
      0.2857143 = coord(2/7)
    
    Abstract
    The unprecedented growth of the Internet has given rise to the Dark Web, the problematic facet of the Web associated with cybercrime, hate, and extremism. Despite the need for tools to collect and analyze Dark Web forums, the covert nature of this part of the Internet makes traditional Web crawling techniques insufficient for capturing such content. In this study, we propose a novel crawling system designed to collect Dark Web forum content. The system uses a human-assisted accessibility approach to gain access to Dark Web forums. Several URL ordering features and techniques enable efficient extraction of forum postings. The system also includes an incremental crawler coupled with a recall-improvement mechanism intended to facilitate enhanced retrieval and updating of collected content. Experiments conducted to evaluate the effectiveness of the human-assisted accessibility approach and the recall-improvement-based, incremental-update procedure yielded favorable results. The human-assisted approach significantly improved access to Dark Web forums while the incremental crawler with recall improvement also outperformed standard periodic- and incremental-update approaches. Using the system, we were able to collect over 100 Dark Web forums from three regions. A case study encompassing link and content analysis of collected forums was used to illustrate the value and importance of gathering and analyzing content from such online communities.
    Theme
    Internet
  9. Ke, W.: Decentralized search and the clustering paradox in large scale information networks (2012) 0.01
    0.014449425 = product of:
      0.050572984 = sum of:
        0.040129032 = weight(_text_:retrieval in 94) [ClassicSimilarity], result of:
          0.040129032 = score(doc=94,freq=6.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.34732026 = fieldWeight in 94, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=94)
        0.010443954 = product of:
          0.03133186 = sum of:
            0.03133186 = weight(_text_:29 in 94) [ClassicSimilarity], result of:
              0.03133186 = score(doc=94,freq=2.0), product of:
                0.13436082 = queryWeight, product of:
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.03819578 = queryNorm
                0.23319192 = fieldWeight in 94, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.046875 = fieldNorm(doc=94)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Abstract
    Amid the rapid growth of information today is the increasing challenge for people to navigate its magnitude. Dynamics and heterogeneity of large information spaces such as the Web raise important questions about information retrieval in these environments. Collection of all information in advance and centralization of IR operations are extremely difficult, if not impossible, because systems are dynamic and information is distributed. The chapter discusses some of the key issues facing classic information retrieval models and presents a decentralized, organic view of information systems pertaining to search in large scale networks. It focuses on the impact of network structure on search performance and discusses a phenomenon we refer to as the Clustering Paradox, in which the topology of interconnected systems imposes a scalability limit.
    Pages
    S.29-46
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  10. Berri, J.; Benlamri, R.: Context-aware mobile search engine (2012) 0.01
    0.01292489 = product of:
      0.045237113 = sum of:
        0.023168506 = weight(_text_:retrieval in 104) [ClassicSimilarity], result of:
          0.023168506 = score(doc=104,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.20052543 = fieldWeight in 104, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=104)
        0.022068607 = weight(_text_:internet in 104) [ClassicSimilarity], result of:
          0.022068607 = score(doc=104,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.1957077 = fieldWeight in 104, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.046875 = fieldNorm(doc=104)
      0.2857143 = coord(2/7)
    
    Abstract
    Exploiting context information in a web search engine helps fine-tuning web services and applications to deliver custom-made information to end users. While context, including user and environment information, cannot be exploited efficiently in the wired Internet interaction type, it is becoming accessible with the mobile web where users have an intimate relationship with their handsets. In this type of interaction, context plays a significant role enhancing information search and therefore, allowing a search engine to detect relevant content in all digital forms and formats. This chapter proposes a context model and an architecture that promote integration of context information for individuals and social communities to add value to their interaction with the mobile web. The architecture relies on efficient knowledge management of multimedia resources for a wide range of applications and web services. The research is illustrated with a corporate case study showing how efficient context integration improves usability of a mobile search engine.
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  11. Lewandowski, D.: Query understanding (2011) 0.01
    0.012349946 = product of:
      0.04322481 = sum of:
        0.02942481 = weight(_text_:internet in 344) [ClassicSimilarity], result of:
          0.02942481 = score(doc=344,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.2609436 = fieldWeight in 344, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0625 = fieldNorm(doc=344)
        0.013800003 = product of:
          0.041400008 = sum of:
            0.041400008 = weight(_text_:22 in 344) [ClassicSimilarity], result of:
              0.041400008 = score(doc=344,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.30952093 = fieldWeight in 344, 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=344)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Date
    18. 9.2018 18:22:18
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
  12. Schaat, S.: Von der automatisierten Manipulation zur Manipulation der Automatisierung (2019) 0.01
    0.012349946 = product of:
      0.04322481 = sum of:
        0.02942481 = weight(_text_:internet in 4996) [ClassicSimilarity], result of:
          0.02942481 = score(doc=4996,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.2609436 = fieldWeight in 4996, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0625 = fieldNorm(doc=4996)
        0.013800003 = product of:
          0.041400008 = sum of:
            0.041400008 = weight(_text_:22 in 4996) [ClassicSimilarity], result of:
              0.041400008 = score(doc=4996,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.30952093 = fieldWeight in 4996, 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=4996)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Content
    "Wir kennen das bereits von Google, Facebook und Amazon: Unser Internet-Verhalten wird automatisch erfasst, damit uns angepasste Inhalte präsentiert werden können. Ob uns diese Inhalte gefallen oder nicht, melden wir direkt oder indirekt zurück (Kauf, Klick etc.). Durch diese Feedbackschleife lernen solche Systeme immer besser, was sie uns präsentieren müssen, um unsere Bedürfnisse anzusprechen, und wissen implizit dadurch auch immer besser, wie sie unsere Bedürfniserfüllung - zur Konsumtion - manipulieren können."
    Date
    19. 2.2019 17:22:00
  13. Bhansali, D.; Desai, H.; Deulkar, K.: ¬A study of different ranking approaches for semantic search (2015) 0.01
    0.010770742 = product of:
      0.037697595 = sum of:
        0.019307088 = weight(_text_:retrieval in 2696) [ClassicSimilarity], result of:
          0.019307088 = score(doc=2696,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.16710453 = fieldWeight in 2696, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2696)
        0.018390507 = weight(_text_:internet in 2696) [ClassicSimilarity], result of:
          0.018390507 = score(doc=2696,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.16308975 = fieldWeight in 2696, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2696)
      0.2857143 = coord(2/7)
    
    Abstract
    Search Engines have become an integral part of our day to day life. Our reliance on search engines increases with every passing day. With the amount of data available on Internet increasing exponentially, it becomes important to develop new methods and tools that help to return results relevant to the queries and reduce the time spent on searching. The results should be diverse but at the same time should return results focused on the queries asked. Relation Based Page Rank [4] algorithms are considered to be the next frontier in improvement of Semantic Web Search. The probability of finding relevance in the search results as posited by the user while entering the query is used to measure the relevance. However, its application is limited by the complexity of determining relation between the terms and assigning explicit meaning to each term. Trust Rank is one of the most widely used ranking algorithms for semantic web search. Few other ranking algorithms like HITS algorithm, PageRank algorithm are also used for Semantic Web Searching. In this paper, we will provide a comparison of few ranking approaches.
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  14. Kaeser, E.: ¬Das postfaktische Zeitalter (2016) 0.01
    0.010318678 = product of:
      0.03611537 = sum of:
        0.011034303 = weight(_text_:internet in 3080) [ClassicSimilarity], result of:
          0.011034303 = score(doc=3080,freq=2.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.09785385 = fieldWeight in 3080, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0234375 = fieldNorm(doc=3080)
        0.025081068 = product of:
          0.037621602 = sum of:
            0.01566593 = weight(_text_:29 in 3080) [ClassicSimilarity], result of:
              0.01566593 = score(doc=3080,freq=2.0), product of:
                0.13436082 = queryWeight, product of:
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.03819578 = queryNorm
                0.11659596 = fieldWeight in 3080, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.0234375 = fieldNorm(doc=3080)
            0.02195567 = weight(_text_:22 in 3080) [ClassicSimilarity], result of:
              0.02195567 = score(doc=3080,freq=4.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.16414827 = fieldWeight in 3080, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0234375 = fieldNorm(doc=3080)
          0.6666667 = coord(2/3)
      0.2857143 = coord(2/7)
    
    Content
    "Es gibt Daten, Informationen und Fakten. Wenn man mir eine Zahlenreihe vorsetzt, dann handelt es sich um Daten: unterscheidbare Einheiten, im Fachjargon: Items. Wenn man mir sagt, dass diese Items stündliche Temperaturangaben der Aare im Berner Marzilibad bedeuten, dann verfüge ich über Information - über interpretierte Daten. Wenn man mir sagt, dies seien die gemessenen Aaretemperaturen am 22. August 2016 im Marzili, dann ist das ein Faktum: empirisch geprüfte interpretierte Daten. Dieser Dreischritt - Unterscheiden, Interpretieren, Prüfen - bildet quasi das Bindemittel des Faktischen, «the matter of fact». Wir alle führen den Dreischritt ständig aus und gelangen so zu einem relativ verlässlichen Wissen und Urteilsvermögen betreffend die Dinge des Alltags. Aber wie schon die Kurzcharakterisierung durchblicken lässt, bilden Fakten nicht den Felsengrund der Realität. Sie sind kritikanfällig, sowohl von der Interpretation wie auch von der Prüfung her gesehen. Um bei unserem Beispiel zu bleiben: Es kann durchaus sein, dass man uns zwei unterschiedliche «faktische» Temperaturverläufe der Aare am 22. August 2016 vorsetzt.
    Date
    24. 8.2016 9:29:24
    Theme
    Internet
  15. Chen, L.-C.: Next generation search engine for the result clustering technology (2012) 0.01
    0.009576717 = product of:
      0.033518508 = sum of:
        0.023168506 = weight(_text_:retrieval in 105) [ClassicSimilarity], result of:
          0.023168506 = score(doc=105,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.20052543 = fieldWeight in 105, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.046875 = fieldNorm(doc=105)
        0.010350002 = product of:
          0.031050006 = sum of:
            0.031050006 = weight(_text_:22 in 105) [ClassicSimilarity], result of:
              0.031050006 = score(doc=105,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.23214069 = fieldWeight in 105, 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=105)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Date
    17. 4.2012 15:22:11
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  16. Chaudiron, S.; Ihadjadene, M.: Studying Web search engines from a user perspective : key concepts and main approaches (2012) 0.01
    0.007980598 = product of:
      0.02793209 = sum of:
        0.019307088 = weight(_text_:retrieval in 109) [ClassicSimilarity], result of:
          0.019307088 = score(doc=109,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.16710453 = fieldWeight in 109, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=109)
        0.008625003 = product of:
          0.025875006 = sum of:
            0.025875006 = weight(_text_:22 in 109) [ClassicSimilarity], result of:
              0.025875006 = score(doc=109,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.19345059 = fieldWeight in 109, 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=109)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Date
    20. 4.2012 13:22:37
    Source
    Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
  17. Lewandowski, D.; Spree, U.: Ranking of Wikipedia articles in search engines revisited : fair ranking for reasonable quality? (2011) 0.01
    0.007980598 = product of:
      0.02793209 = sum of:
        0.019307088 = weight(_text_:retrieval in 444) [ClassicSimilarity], result of:
          0.019307088 = score(doc=444,freq=2.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.16710453 = fieldWeight in 444, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0390625 = fieldNorm(doc=444)
        0.008625003 = product of:
          0.025875006 = sum of:
            0.025875006 = weight(_text_:22 in 444) [ClassicSimilarity], result of:
              0.025875006 = score(doc=444,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.19345059 = fieldWeight in 444, 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=444)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Abstract
    This paper aims to review the fiercely discussed question of whether the ranking of Wikipedia articles in search engines is justified by the quality of the articles. After an overview of current research on information quality in Wikipedia, a summary of the extended discussion on the quality of encyclopedic entries in general is given. On this basis, a heuristic method for evaluating Wikipedia entries is developed and applied to Wikipedia articles that scored highly in a search engine retrieval effectiveness test and compared with the relevance judgment of jurors. In all search engines tested, Wikipedia results are unanimously judged better by the jurors than other results on the corresponding results position. Relevance judgments often roughly correspond with the results from the heuristic evaluation. Cases in which high relevance judgments are not in accordance with the comparatively low score from the heuristic evaluation are interpreted as an indicator of a high degree of trust in Wikipedia. One of the systemic shortcomings of Wikipedia lies in its necessarily incoherent user model. A further tuning of the suggested criteria catalog, for instance, the different weighing of the supplied criteria, could serve as a starting point for a user model differentiated evaluation of Wikipedia articles. Approved methods of quality evaluation of reference works are applied to Wikipedia articles and integrated with the question of search engine evaluation.
    Date
    30. 9.2012 19:27:22
  18. Cornelius, P.; Schneemann, R.; Weisel, L.: SUMA-Kongress 2011 - eine bemerkenswerte Tagung ! (2011) 0.01
    0.007280753 = product of:
      0.05096527 = sum of:
        0.05096527 = weight(_text_:internet in 2097) [ClassicSimilarity], result of:
          0.05096527 = score(doc=2097,freq=6.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.45196757 = fieldWeight in 2097, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0625 = fieldNorm(doc=2097)
      0.14285715 = coord(1/7)
    
    Abstract
    Das Programm stand unter dem Motto "Die Internet Wirtschaft - Geld verdienen im Internet". Den etwa 50 live Teilnehmenden berichteten Experten aus der Internet-Wirtschaft über ihre Geschäftsmodelle sowie die Erfolgsfaktoren. Am Nachmittag ging es unter dem Überbegriff "Netzpolitik" um aktuelle Diskussionen mit wirtschaftspolitischem Hintergrund und in den beiden Podiumssitzungen teils ungewohnt hitzig und persönlich "giftig" aber sehr aktuell um "Anonymität im Netz, ein Bürgerrecht?" und um die netzpolitischen Koalitionsverhandlungen in Berlin.
  19. Averesch, D.: Googeln ohne Google : Mit alternativen Suchmaschinen gelingt ein neutraler Überblick (2010) 0.01
    0.006939136 = product of:
      0.024286974 = sum of:
        0.019111974 = weight(_text_:internet in 3374) [ClassicSimilarity], result of:
          0.019111974 = score(doc=3374,freq=6.0), product of:
            0.11276311 = queryWeight, product of:
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.03819578 = queryNorm
            0.16948783 = fieldWeight in 3374, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.9522398 = idf(docFreq=6276, maxDocs=44218)
              0.0234375 = fieldNorm(doc=3374)
        0.005175001 = product of:
          0.015525003 = sum of:
            0.015525003 = weight(_text_:22 in 3374) [ClassicSimilarity], result of:
              0.015525003 = score(doc=3374,freq=2.0), product of:
                0.13375512 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03819578 = queryNorm
                0.116070345 = fieldWeight in 3374, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0234375 = fieldNorm(doc=3374)
          0.33333334 = coord(1/3)
      0.2857143 = coord(2/7)
    
    Content
    "Googeln hat es bis in den Duden geschafft. Kein Wunder, dass viele das Angebot aus dem kalifornischen Mountain View quasi als amtliche Internet-Suchmaschine betrachten und nutzen. Wegen seiner unzähligen Zusatzdienste vom Webmailer bis hin zu Onlinekarten hat sich Google aber auch den Ruf eines Datenkraken erworben. Auch deshalb wenden sich viele Nutzer den Suchmaschinen der Konkurrenz zu. So propagiert der Verein für freien Wissenszugang (Suma eV) aus Hannover, dass es wichtig sei, "mehrere, unabhängig voneinander arbeitende Suchmaschinen einzusetzen, um einen möglichst neutralen und umfassenden Überblick geeigneter Quellen zu erhalten". Schirmherr des Vereins ist der MP3-Erfinder Karlheinz Brandenburg. Bei einem Quasi-Monopol wie es Google innehat, bestehe "auf Dauer die Gefahr, dass die Ergebnisse der Informationssuche von Einflüssen nicht allgemein erkennbarer Mechanismen der Betreiber geleitet werden." Laut dem Internet-Statistikdienst Hitslink liefen in diesem Jahr bisher knapp 86 Prozent aller Suchanfragen weltweit über Google. Platz zwei belegt weit abgeschlagen Yahoo mit knapp sechs Prozent. Microsofts Suche Bing belegt - noch nicht einmal ein Jahr alt - mit gut drei Prozent bereits den dritten Rang. Vergleichsweise stark genutzt wird rund um den Globus auch noch die globale Suche von Ask. Hindernisse türmen sich vor wechselfreudigen Surfern jedenfalls nicht auf und Probieren kostet nichts. Jeder beliebige Suchdienst lässt sich bei Browsern wie Firefox oder Internet Explorer mühelos einbinden oder als Startseite festlegen.
    Date
    3. 5.1997 8:44:22
  20. Werner, K.: das Confirmation/Disconfirmation-Paradigma der Kundenzufriedenheit im Kontext des Information Retrieval : Größere Zufriedenheit durch bessere Suchmaschinen? (2010) 0.01
    0.0062409933 = product of:
      0.043686952 = sum of:
        0.043686952 = weight(_text_:retrieval in 4016) [ClassicSimilarity], result of:
          0.043686952 = score(doc=4016,freq=4.0), product of:
            0.11553899 = queryWeight, product of:
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.03819578 = queryNorm
            0.37811437 = fieldWeight in 4016, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.024915 = idf(docFreq=5836, maxDocs=44218)
              0.0625 = fieldNorm(doc=4016)
      0.14285715 = coord(1/7)
    
    Abstract
    In der vorgestellten Studie aus dem Bereich des interaktiven Information Retrieval wurde erstmals die Erwartungshaltung von Suchmaschinennutzern als mögliche Determinante der Benutzerzufriedenheit untersucht. Das experimentelle Untersuchungsdesign basiert auf einem betriebswirtschaftlichen Modell, das die Entstehung von Kundenzufriedenheit durch die Bestätigung bzw. Nicht-Bestätigung von Erwartungen erklärt. Ein zentrales Ergebnis dieser Studie ist, das bei der Messung von Benutzerzufriedenheit besonders auf den Messzeitpunkt zu achten ist. Des Weiteren konnte ein von der Systemgüte abhängiger Adaptionseffekt hinsichtlich der Relevanzbewertung der Benutzer nachgewiesen werden.

Languages

  • e 36
  • d 26