Search (72 results, page 1 of 4)

  • × theme_ss:"Suchmaschinen"
  • × type_ss:"a"
  • × year_i:[2010 TO 2020}
  1. Das, A.; Jain, A.: Indexing the World Wide Web : the journey so far (2012) 0.08 
    0.08297856 = product of:
  0.124467835 = sum of:
    0.093428686 = weight(_text_:wide in 95) [ClassicSimilarity], result of:
      0.093428686 = score(doc=95,freq=4.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.4153836 = fieldWeight in 95, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=95)
    0.031039147 = product of:
      0.062078293 = sum of:
        0.062078293 = weight(_text_:web in 95) [ClassicSimilarity], result of:
          0.062078293 = score(doc=95,freq=6.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.37471575 = fieldWeight in 95, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=95)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    In this chapter, the authors describe the key indexing components of today's web search engines. As the World Wide Web has grown, the systems and methods for indexing have changed significantly. The authors present the data structures used, the features extracted, the infrastructure needed, and the options available for designing a brand new search engine. Techniques are highlighted that improve relevance of results, discuss trade-offs to best utilize machine resources, and cover distributed processing concepts in this context. In particular, the authors delve into the topics of indexing phrases instead of terms, storage in memory vs. on disk, and data partitioning. Some thoughts on information organization for the newly emerging data-forms conclude the chapter.
  2. Berri, J.; Benlamri, R.: Context-aware mobile search engine (2012) 0.07 
    0.07075695 = product of:
  0.10613542 = sum of:
    0.06606405 = weight(_text_:wide in 104) [ClassicSimilarity], result of:
      0.06606405 = score(doc=104,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 104, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=104)
    0.04007137 = product of:
      0.08014274 = sum of:
        0.08014274 = weight(_text_:web in 104) [ClassicSimilarity], result of:
          0.08014274 = score(doc=104,freq=10.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.48375595 = fieldWeight in 104, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=104)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    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.
  3. Chen, L.-C.: Next generation search engine for the result clustering technology (2012) 0.06 
    0.057798248 = product of:
  0.08669737 = sum of:
    0.06606405 = weight(_text_:wide in 105) [ClassicSimilarity], result of:
      0.06606405 = score(doc=105,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=105)
    0.020633321 = product of:
      0.041266643 = sum of:
        0.041266643 = weight(_text_:22 in 105) [ClassicSimilarity], result of:
          0.041266643 = score(doc=105,freq=2.0), product of:
            0.17776565 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050763648 = 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.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Result clustering has recently attracted a lot of attention to provide the users with a succinct overview of relevant search results than traditional search engines. This chapter proposes a mixed clustering method to organize all returned search results into a hierarchical tree structure. The clustering method accomplishes two main tasks, one is label construction and the other is tree building. This chapter uses precision to measure the quality of clustering results. According to the results of experiments, the author preliminarily concluded that the performance of the system is better than many other well-known commercial and academic systems. This chapter makes several contributions. First, it presents a high performance system based on the clustering method. Second, it develops a divisive hierarchical clustering algorithm to organize all returned snippets into hierarchical tree structure. Third, it performs a wide range of experimental analyses to show that almost all commercial systems are significantly better than most current academic systems.
    Date
    17. 4.2012 15:22:11
  4. Alqaraleh, S.; Ramadan, O.; Salamah, M.: Efficient watcher based web crawler design (2015) 0.04 
    0.039622243 = product of:
  0.11886673 = sum of:
    0.11886673 = sum of:
      0.08447786 = weight(_text_:web in 1627) [ClassicSimilarity], result of:
        0.08447786 = score(doc=1627,freq=16.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.5099235 = fieldWeight in 1627, product of:
            4.0 = tf(freq=16.0), with freq of:
              16.0 = termFreq=16.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1627)
      0.03438887 = weight(_text_:22 in 1627) [ClassicSimilarity], result of:
        0.03438887 = score(doc=1627,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.19345059 = fieldWeight in 1627, 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=1627)
  0.33333334 = coord(1/3)
    Abstract
    Purpose The purpose of this paper is to design a watcher-based crawler (WBC) that has the ability of crawling static and dynamic web sites, and can download only the updated and newly added web pages. Design/methodology/approach In the proposed WBC crawler, a watcher file, which can be uploaded to the web sites servers, prepares a report that contains the addresses of the updated and the newly added web pages. In addition, the WBC is split into five units, where each unit is responsible for performing a specific crawling process. Findings Several experiments have been conducted and it has been observed that the proposed WBC increases the number of uniquely visited static and dynamic web sites as compared with the existing crawling techniques. In addition, the proposed watcher file not only allows the crawlers to visit the updated and newly web pages, but also solves the crawlers overlapping and communication problems. Originality/value The proposed WBC performs all crawling processes in the sense that it detects all updated and newly added pages automatically without any human explicit intervention or downloading the entire web sites.
    Date
    20. 1.2015 18:30:22
  5. Lewandowski, D.: Query understanding (2011) 0.03 
    0.03427003 = product of:
  0.102810085 = sum of:
    0.102810085 = sum of:
      0.04778789 = weight(_text_:web in 344) [ClassicSimilarity], result of:
        0.04778789 = score(doc=344,freq=2.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.2884563 = fieldWeight in 344, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0625 = fieldNorm(doc=344)
      0.05502219 = weight(_text_:22 in 344) [ClassicSimilarity], result of:
        0.05502219 = score(doc=344,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = 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)
    Date
    18. 9.2018 18:22:18
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
  6. Chaudiron, S.; Ihadjadene, M.: Studying Web search engines from a user perspective : key concepts and main approaches (2012) 0.03 
    0.03372483 = product of:
  0.10117448 = sum of:
    0.10117448 = sum of:
      0.06678561 = weight(_text_:web in 109) [ClassicSimilarity], result of:
        0.06678561 = score(doc=109,freq=10.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.40312994 = fieldWeight in 109, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=109)
      0.03438887 = weight(_text_:22 in 109) [ClassicSimilarity], result of:
        0.03438887 = score(doc=109,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = 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)
    Abstract
    This chapter shows that the wider use of Web search engines, reconsidering the theoretical and methodological frameworks to grasp new information practices. Beginning with an overview of the recent challenges implied by the dynamic nature of the Web, this chapter then traces the information behavior related concepts in order to present the different approaches from the user perspective. The authors pay special attention to the concept of "information practice" and other related concepts such as "use", "activity", and "behavior" largely used in the literature but not always strictly defined. The authors provide an overview of user-oriented studies that are meaningful to understand the different contexts of use of electronic information access systems, focusing on five approaches: the system-oriented approaches, the theories of information seeking, the cognitive and psychological approaches, the management science approaches, and the marketing approaches. Future directions of work are then shaped, including social searching and the ethical, cultural, and political dimensions of Web search engines. The authors conclude considering the importance of Critical theory to better understand the role of Web Search engines in our modern society.
    Date
    20. 4.2012 13:22:37
  7. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.03 
    0.028706929 = product of:
  0.086120784 = sum of:
    0.086120784 = sum of:
      0.05173191 = weight(_text_:web in 1605) [ClassicSimilarity], result of:
        0.05173191 = score(doc=1605,freq=6.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.3122631 = fieldWeight in 1605, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1605)
      0.03438887 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
        0.03438887 = score(doc=1605,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.19345059 = fieldWeight in 1605, 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=1605)
  0.33333334 = coord(1/3)
    Abstract
    Numerous studies have explored the possibility of uncovering information from web search queries but few have examined the factors that affect web query data sources. We conducted a study that investigated this issue by comparing Google Trends and Baidu Index. Data from these two services are based on queries entered by users into Google and Baidu, two of the largest search engines in the world. We first compared the features and functions of the two services based on documents and extensive testing. We then carried out an empirical study that collected query volume data from the two sources. We found that data from both sources could be used to predict the quality of Chinese universities and companies. Despite the differences between the two services in terms of technology, such as differing methods of language processing, the search volume data from the two were highly correlated and combining the two data sources did not improve the predictive power of the data. However, there was a major difference between the two in terms of data availability. Baidu Index was able to provide more search volume data than Google Trends did. Our analysis showed that the disadvantage of Google Trends in this regard was due to Google's smaller user base in China. The implication of this finding goes beyond China. Google's user bases in many countries are smaller than that in China, so the search volume data related to those countries could result in the same issue as that related to China.
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22
  8. Sachse, J.: ¬The influence of snippet length on user behavior in mobile web search (2019) 0.03 
    0.028706929 = product of:
  0.086120784 = sum of:
    0.086120784 = sum of:
      0.05173191 = weight(_text_:web in 5493) [ClassicSimilarity], result of:
        0.05173191 = score(doc=5493,freq=6.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.3122631 = fieldWeight in 5493, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5493)
      0.03438887 = weight(_text_:22 in 5493) [ClassicSimilarity], result of:
        0.03438887 = score(doc=5493,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.19345059 = fieldWeight in 5493, 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=5493)
  0.33333334 = coord(1/3)
    Abstract
    Purpose Web search is more and more moving into mobile contexts. However, screen size of mobile devices is limited and search engine result pages face a trade-off between offering informative snippets and optimal use of space. One factor clearly influencing this trade-off is snippet length. The purpose of this paper is to find out what snippet size to use in mobile web search. Design/methodology/approach For this purpose, an eye-tracking experiment was conducted showing participants search interfaces with snippets of one, three or five lines on a mobile device to analyze 17 dependent variables. In total, 31 participants took part in the study. Each of the participants solved informational and navigational tasks. Findings Results indicate a strong influence of page fold on scrolling behavior and attention distribution across search results. Regardless of query type, short snippets seem to provide too little information about the result, so that search performance and subjective measures are negatively affected. Long snippets of five lines lead to better performance than medium snippets for navigational queries, but to worse performance for informational queries. Originality/value Although space in mobile search is limited, this study shows that longer snippets improve usability and user experience. It further emphasizes that page fold plays a stronger role in mobile than in desktop search for attention distribution.
    Date
    20. 1.2015 18:30:22
  9. Haubner, S.: Was uns Google vorenthält : Alternativen zum Marktführer gibt es beim Suchen im Internet kaum - Wir erklären, wie der Suchmaschinen-Gigant "Google" funktioniert. (2012) 0.03 
    0.026973113 = product of:
  0.04045967 = sum of:
    0.027526692 = weight(_text_:wide in 6) [ClassicSimilarity], result of:
      0.027526692 = score(doc=6,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.122383565 = fieldWeight in 6, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.01953125 = fieldNorm(doc=6)
    0.012932978 = product of:
      0.025865955 = sum of:
        0.025865955 = weight(_text_:web in 6) [ClassicSimilarity], result of:
          0.025865955 = score(doc=6,freq=6.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.15613155 = fieldWeight in 6, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.01953125 = fieldNorm(doc=6)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Content
    "Ganze "230 Adressen im World Wide Web, 250 Server und 100 per E-Mail zugängliche Informationsquellen". So stand es 1995 in der "Updated Internet Services List". Die manuell zusammengetragene Adressliste, nach ihrem Urheber auch als "Yanoff-Liste" bekannt, war einer der ersten Versuche, die anschwellende Informationsflut des Internet zu kanalisieren. Aus einem dieser Verzeichnisse, das zunächst von Studenten zusammengetragen wurde, entstand kurze Zeit später mit Yahoo die Mutter aller Suchmaschinen. Die englische Wortkombination "Search Engine" ist allerdings irreführend. Denn dahinter steckt in Wahrheit eine Software, die automatisch einen Index der Internetinhalte erstellt. Denn der Fleiß einer Handvoll Studenten reichte schon bald nicht mehr aus, das sich explosionsartig ausbreitende Web auch nur ansatzweise zu erfassen.
    Und natürlich schlägt Microsoft in die gleiche Kerbe wie Google. Denn auch die Bing-Suche steht ganz im Zeichen der "Individualisierung" der Ergebnisse. "Social Search" nennt sich die (noch) optionale Möglichkeit, Facebook-Einträge von Freunden als Suchkriterien zu verwenden. Schließlich, so die Meinung des Konzerns, beeinflusse der "Freunde-Effekt" die Entscheidung von Menschen in der Regel mehr als andere Faktoren. Die Entwicklung zeigt eindrucksvoll, wie schnell sich die beiden letzten Großen im Suchmaschinen-Geschäft neue Entwicklungen im Netz aneignen. Im Web 2.0 bildeten Blogs und Soziale Netzwerke bislang gewissermaßen ein demokratisches Gegengewicht zum Meinungsmonopol. Doch auch hier ist der Internet-Goliath bereits am Start. Wer sich schon immer mal gefragt hat, warum der Such-Gigant praktisch monatlich mit neuen Angeboten wie etwa Google+ aufwartet, findet hier eine Antwort. Mit dem kostenlosen Smartphone-Betriebssystem Android sicherte man sich eine gewichtige Position auf dem expandieren Markt für mobile Plattformen. Trotz ihrer momentanen Allmacht erkennen die Konzernlenker also durchaus die Gefahr, irgendwann einmal selbst vom Zug der Zeit überrollt zu werden. Für die meisten Konkurrenten kommt diese Einsicht zu spät."
  10. Fu, T.; Abbasi, A.; Chen, H.: ¬A focused crawler for Dark Web forums (2010) 0.01 
    0.014933716 = product of:
  0.044801146 = sum of:
    0.044801146 = product of:
      0.08960229 = sum of:
        0.08960229 = weight(_text_:web in 3471) [ClassicSimilarity], result of:
          0.08960229 = score(doc=3471,freq=18.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.5408555 = fieldWeight in 3471, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3471)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    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.
  11. Averesch, D.: Googeln ohne Google : Mit alternativen Suchmaschinen gelingt ein neutraler Überblick (2010) 0.01 
    0.012851261 = product of:
  0.03855378 = sum of:
    0.03855378 = sum of:
      0.017920459 = weight(_text_:web in 3374) [ClassicSimilarity], result of:
        0.017920459 = score(doc=3374,freq=2.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.108171105 = fieldWeight in 3374, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0234375 = fieldNorm(doc=3374)
      0.020633321 = weight(_text_:22 in 3374) [ClassicSimilarity], result of:
        0.020633321 = score(doc=3374,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = 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)
    Content
    Unzählige kleinere und Spezial-Suchmaschinen bieten Einblicke in Ecken des Netzes, zu denen man mit den Großen eher nicht gelangt wä- re. Nach wie vor gibt es auch Verzeichnisdienste. die Seiten in genau beschriebenen Kategorien auflisten. Dazu gehört www.dmoz.org. Um mehrere Maschinen und Verzeichnisdienste gleichzeitig abzufragen, empfehlen sich Metasuchmaschinen. Eine der bekanntesten ist MetaGer, ein Projekt der Universität Hannover. Eine weitere interessante Metasuchmaschine, deren Ergebnisse aber auf Nordamerika zugeschnitten sind, ist www.clusty.com. Wie der Name andeutet, bündelt sie die Suchergebnisse zu logischen Clustern. Auch praktisch: Beim Klick auf die Lupensymbole hinter den Suchergebnissen öffnen sich beliebig viele Vorschauen direkt in der Web- seite. Ob das Googeln ohne Google irgendwann nichts besonderes mehr ist, hängt maßgeblich von den Surfern ab - davon ist man beim Verein für freien Wissenszugang überzeugt: Änderungen seien ,;weniger durch neue Technologien, sondern vor allem durch verändertes Nutzerverhalten aufgrund steigender Informationskompetenz zu erwarten."
    Date
    3. 5.1997 8:44:22
  12. Spree, U.; Feißt, N.; Lühr, A.; Piesztal, B.; Schroeder, N.; Wollschläger, P.: Semantic search : State-of-the-Art-Überblick zu semantischen Suchlösungen im WWW (2011) 0.01 
    0.012070779 = product of:
  0.036212336 = sum of:
    0.036212336 = product of:
      0.07242467 = sum of:
        0.07242467 = weight(_text_:web in 345) [ClassicSimilarity], result of:
          0.07242467 = score(doc=345,freq=6.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.43716836 = fieldWeight in 345, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0546875 = fieldNorm(doc=345)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    In diesem Kapitel wird ein Überblick über bestehende semantische Suchmaschinen gegeben. Insgesamt werden 95 solcher Suchdienste identifiziert und im Rahmen einer Inhaltsanalyse verglichen. Es kann festgestellt werden, dass die Semantische Suche sich wesentlich von den im Rahmen des Semantic Web propagierten Technologien unterscheidet und Semantik in den betrachteten Suchmaschinen weiter zu fassen ist. Die betrachteten Suchmaschinen werden in ein Stufenmodell, welches nach dem Grad der Semantik unterscheidet, eingeordnet. Das Kapitel schließt mit 8 Thesen zum aktuellen Stand der semantischen Suche.
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
    Theme
    Semantic Web
  13. Hoeber, O.: Human-centred Web search (2012) 0.01 
    0.011946972 = product of:
  0.035840917 = sum of:
    0.035840917 = product of:
      0.071681835 = sum of:
        0.071681835 = weight(_text_:web in 102) [ClassicSimilarity], result of:
          0.071681835 = score(doc=102,freq=8.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.43268442 = fieldWeight in 102, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=102)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    People commonly experience difficulties when searching the Web, arising from an incomplete knowledge regarding their information needs, an inability to formulate accurate queries, and a low tolerance for considering the relevance of the search results. While simple and easy to use interfaces have made Web search universally accessible, they provide little assistance for people to overcome the difficulties they experience when their information needs are more complex than simple fact-verification. In human-centred Web search, the purpose of the search engine expands from a simple information retrieval engine to a decision support system. People are empowered to take an active role in the search process, with the search engine supporting them in developing a deeper understanding of their information needs, assisting them in crafting and refining their queries, and aiding them in evaluating and exploring the search results. In this chapter, recent research in this domain is outlined and discussed.
  14. Makris, C.; Plegas, Y.; Stamou, S.: Web query disambiguation using PageRank (2012) 0.01 
    0.011946972 = product of:
  0.035840917 = sum of:
    0.035840917 = product of:
      0.071681835 = sum of:
        0.071681835 = weight(_text_:web in 378) [ClassicSimilarity], result of:
          0.071681835 = score(doc=378,freq=8.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.43268442 = fieldWeight in 378, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=378)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    In this article, we propose new word sense disambiguation strategies for resolving the senses of polysemous query terms issued to Web search engines, and we explore the application of those strategies when used in a query expansion framework. The novelty of our approach lies in the exploitation of the Web page PageRank values as indicators of the significance the different senses of a term carry when employed in search queries. We also aim at scalable query sense resolution techniques that can be applied without loss of efficiency to large data sets such as those on the Web. Our experimental findings validate that the proposed techniques perform more accurately than do the traditional disambiguation strategies and improve the quality of the search results, when involved in query expansion.
  15. Vaughan, L.; Romero-Frías, E.: Web search volume as a predictor of academic fame : an exploration of Google trends (2014) 0.01 
    0.011946972 = product of:
  0.035840917 = sum of:
    0.035840917 = product of:
      0.071681835 = sum of:
        0.071681835 = weight(_text_:web in 1233) [ClassicSimilarity], result of:
          0.071681835 = score(doc=1233,freq=8.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.43268442 = fieldWeight in 1233, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=1233)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Searches conducted on web search engines reflect the interests of users and society. Google Trends, which provides information about the queries searched by users of the Google web search engine, is a rich data source from which a wealth of information can be mined. We investigated the possibility of using web search volume data from Google Trends to predict academic fame. As queries are language-dependent, we studied universities from two countries with different languages, the United States and Spain. We found a significant correlation between the search volume of a university name and the university's academic reputation or fame. We also examined the effect of some Google Trends features, namely, limiting the search to a specific country or topic category on the search volume data. Finally, we examined the effect of university sizes on the correlations found to gain a deeper understanding of the nature of the relationships.
  16. Peters, I.: Folksonomies und kollaborative Informationsdienste : eine Alternative zur Websuche? (2011) 0.01 
    0.011263715 = product of:
  0.033791143 = sum of:
    0.033791143 = product of:
      0.06758229 = sum of:
        0.06758229 = weight(_text_:web in 343) [ClassicSimilarity], result of:
          0.06758229 = score(doc=343,freq=4.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.4079388 = fieldWeight in 343, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0625 = fieldNorm(doc=343)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    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.
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
  17. Roy, R.S.; Agarwal, S.; Ganguly, N.; Choudhury, M.: Syntactic complexity of Web search queries through the lenses of language models, networks and users (2016) 0.01 
    0.0111309355 = product of:
  0.033392806 = sum of:
    0.033392806 = product of:
      0.06678561 = sum of:
        0.06678561 = weight(_text_:web in 3188) [ClassicSimilarity], result of:
          0.06678561 = score(doc=3188,freq=10.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.40312994 = fieldWeight in 3188, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3188)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Across the world, millions of users interact with search engines every day to satisfy their information needs. As the Web grows bigger over time, such information needs, manifested through user search queries, also become more complex. However, there has been no systematic study that quantifies the structural complexity of Web search queries. In this research, we make an attempt towards understanding and characterizing the syntactic complexity of search queries using a multi-pronged approach. We use traditional statistical language modeling techniques to quantify and compare the perplexity of queries with natural language (NL). We then use complex network analysis for a comparative analysis of the topological properties of queries issued by real Web users and those generated by statistical models. Finally, we conduct experiments to study whether search engine users are able to identify real queries, when presented along with model-generated ones. The three complementary studies show that the syntactic structure of Web queries is more complex than what n-grams can capture, but simpler than NL. Queries, thus, seem to represent an intermediate stage between syntactic and non-syntactic communication.
  18. Flores-Herr, N.; Sack, H.; Bossert, K.: Suche in Multimediaarchiven von Kultureinrichtungen (2011) 0.01 
    0.010346383 = product of:
  0.031039147 = sum of:
    0.031039147 = product of:
      0.062078293 = sum of:
        0.062078293 = weight(_text_:web in 346) [ClassicSimilarity], result of:
          0.062078293 = score(doc=346,freq=6.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.37471575 = fieldWeight in 346, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=346)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    In diesem Kapitel werden Vorschläge für neue Suchparadigmen nach multimedialen Inhalten in Archiven von Kultureinrichtungen vorgestellt. Um die Notwendigkeit für eine Integration dieser neuen Technologien zu zeigen, werden zunächst Einschränkungen der klassischen katalogbasierten Bibliothekssuche im Zeitalter von immer weiter wachsenden Multimediasammlungen beschrieben. Im Anschluss werden die Vor- und Nachteile zweier Suchparadigmen dargestellt, mit deren Hilfe in Zukunft für Wissenschaftler und Kulturschaffende die Suche nach multimedialen Inhalten erleichtert werden könnte. Zunächst werden die Perspektiven einer semantischen Suche auf Basis von Semantic-Web-Technologien in Bibliotheken beschrieben. Im Anschluss werden Suchmöglichkeiten für Multimediainhalte auf Basis von automatischer inhaltsbasierter Medienanalyse gezeigt. Das Kapitel endet mit einem Ausblick auf eine mögliche Vereinigung der beiden neuen Ansätze mit katalogbasierter Bibliothekssuche.
    Source
    Handbuch Internet-Suchmaschinen, 2: Neue Entwicklungen in der Web-Suche. Hrsg.: D. Lewandowski
    Theme
    Semantic Web
  19. Rieh, S.Y.; Kim, Y.-M.; Markey, K.: Amount of invested mental effort (AIME) in online searching (2012) 0.01 
    0.00995581 = product of:
  0.029867431 = sum of:
    0.029867431 = product of:
      0.059734862 = sum of:
        0.059734862 = weight(_text_:web in 2726) [ClassicSimilarity], result of:
          0.059734862 = score(doc=2726,freq=8.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.36057037 = fieldWeight in 2726, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2726)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    This research investigates how people's perceptions of information retrieval (IR) systems, their perceptions of search tasks, and their perceptions of self-efficacy influence the amount of invested mental effort (AIME) they put into using two different IR systems: a Web search engine and a library system. It also explores the impact of mental effort on an end user's search experience. To assess AIME in online searching, two experiments were conducted using these methods: Experiment 1 relied on self-reports and Experiment 2 employed the dual-task technique. In both experiments, data were collected through search transaction logs, a pre-search background questionnaire, a post-search questionnaire and an interview. Important findings are these: (1) subjects invested greater mental effort searching a library system than searching the Web; (2) subjects put little effort into Web searching because of their high sense of self-efficacy in their searching ability and their perception of the easiness of the Web; (3) subjects did not recognize that putting mental effort into searching was something needed to improve the search results; and (4) data collected from multiple sources proved to be effective for assessing mental effort in online searching.
  20. Hurz, S.: Google verfolgt Nutzer, auch wenn sie explizit widersprechen (2018) 0.01 
    0.00995581 = product of:
  0.029867431 = sum of:
    0.029867431 = product of:
      0.059734862 = sum of:
        0.059734862 = weight(_text_:web in 4404) [ClassicSimilarity], result of:
          0.059734862 = score(doc=4404,freq=2.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.36057037 = fieldWeight in 4404, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.078125 = fieldNorm(doc=4404)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Wenn Google-Nutzer den Standortverlauf ausschalten, speichert das Unternehmen trotzdem Bewegungsdaten. Betroffen sind mehr als zwei Milliarden Menschen, die Android-Smartphones oder iPhones mit Google-Diensten verwenden. Wer das Tracking verhindern will, muss die "Web- und App-Aktivitäten" komplett deaktivieren.

Authors

Languages

  • e 48
  • d 24

Themes