Search (368 results, page 1 of 19)

  • × theme_ss:"Suchmaschinen"
  1. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.10 
    0.098269366 = product of:
  0.14740404 = sum of:
    0.019565428 = weight(_text_:science in 1605) [ClassicSimilarity], result of:
      0.019565428 = score(doc=1605,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.1455159 = fieldWeight in 1605, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1605)
    0.12783861 = sum of:
      0.09325992 = weight(_text_:index in 1605) [ClassicSimilarity], result of:
        0.09325992 = score(doc=1605,freq=6.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.418113 = fieldWeight in 1605, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1605)
      0.034578685 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
        0.034578685 = score(doc=1605,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = 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.6666667 = coord(2/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
  2. Hancock, B.: Subject-specific search engines : using the Harvest system to gather and maintain information on the Internet (1998) 0.06 
    0.05965802 = product of:
  0.17897406 = sum of:
    0.17897406 = sum of:
      0.1305639 = weight(_text_:index in 3238) [ClassicSimilarity], result of:
        0.1305639 = score(doc=3238,freq=6.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.5853582 = fieldWeight in 3238, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3238)
      0.04841016 = weight(_text_:22 in 3238) [ClassicSimilarity], result of:
        0.04841016 = score(doc=3238,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.2708308 = fieldWeight in 3238, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3238)
  0.33333334 = coord(1/3)
    Abstract
    The increasing expansion of the Internet has made resources available to users in sometimes unmanageable abundance. To help users manage this proliferation of information, librarians have begun to add URLs to their home pages. As well, specialized search engines are being used to retrieve information from selected sources in aneffort to return pertinent results. Describes the Harvest system which has been used to develop Index Antiquus, a specialized engine, for the classics and mediaeval studies. Presents a working example of how to search Index Antiquus
    Date
    6. 3.1997 16:22:15
    Object
    Index Antiquus
  3. Hüskes, R.; Kleber, D.: ¬Den Server im Griff (1999) 0.06 
    0.058948215 = product of:
  0.17684464 = sum of:
    0.17684464 = sum of:
      0.10768727 = weight(_text_:index in 4008) [ClassicSimilarity], result of:
        0.10768727 = score(doc=4008,freq=2.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.48279524 = fieldWeight in 4008, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.078125 = fieldNorm(doc=4008)
      0.06915737 = weight(_text_:22 in 4008) [ClassicSimilarity], result of:
        0.06915737 = score(doc=4008,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.38690117 = fieldWeight in 4008, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.078125 = fieldNorm(doc=4008)
  0.33333334 = coord(1/3)
    Date
    22. 8.1999 21:21:10
    Object
    Microsoft Index Server
  4. Price, A.: Five new Danish subject gateways under development (2000) 0.05 
    0.049139693 = product of:
  0.07370954 = sum of:
    0.039130855 = weight(_text_:science in 4878) [ClassicSimilarity], result of:
      0.039130855 = score(doc=4878,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.2910318 = fieldWeight in 4878, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.078125 = fieldNorm(doc=4878)
    0.034578685 = product of:
      0.06915737 = sum of:
        0.06915737 = weight(_text_:22 in 4878) [ClassicSimilarity], result of:
          0.06915737 = score(doc=4878,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.38690117 = fieldWeight in 4878, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=4878)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Content
    Subject gateways zu den Bereichen: Business economics - The virtual music library - clinical information - food science and food technology - energy technology
    Date
    22. 6.2002 19:41:31
  5. Fordahl, M.: Mit Google den PC durchforsten : Kleines Programm erstellt in rechenfreien Zeiten einen Index (2004) 0.05 
    0.04738719 = product of:
  0.14216156 = sum of:
    0.14216156 = sum of:
      0.09325992 = weight(_text_:index in 4209) [ClassicSimilarity], result of:
        0.09325992 = score(doc=4209,freq=6.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.418113 = fieldWeight in 4209, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.0390625 = fieldNorm(doc=4209)
      0.048901644 = weight(_text_:22 in 4209) [ClassicSimilarity], result of:
        0.048901644 = score(doc=4209,freq=4.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.27358043 = fieldWeight in 4209, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=4209)
  0.33333334 = coord(1/3)
    Content
    "Die Google-Suche nach Dateien im Internet kann nun auch auf en eigenen PC ausgedehnt werden. Ein kleines kostenloses Programm, das sich am unteren Bildschirmrand einnistet, startet die Volltextsuche auf der Festplatte. Google erfasst den Inhalt aller Web-Seiten und Dokumente im Microsoft-Office-Format sowie die Namen sonstiger Dateien und zeigt die Trefferliste im Browser in der vertrauten Liste an - allerdings nur auf Computern mit Windows 2000 oder Windows XE Bei der Entwicklung dieses Werkzeugs hat Google sowohl die eigene Suchtechnologie als auch eine Schwäche von Windows ausgenutzt. Bei der "Desktop-Suche" kommt der gleiche Algorithmus zum Einsatz wie bei der Internet-Suche. Für die dazu benötigte Datenbank wird der Index-Dienst von Windows verwendet, der nur wenigen Anwendern bekannt ist, weil er etwas kompliziert und obendrein ziemlich langsam ist. Das neue Google Tool erstellt selbst diesen Suchindex für die Dateien in der Zeit, wenn der Computer gerade untätig ist. Sobald das 400 KB große Programm heruntergeladen und installiert ist, fängt es damit an, den PC zu durchforsten. Bei gut gefüllten Festplatten dauert es ein paar Stunden oder auch ein paar Tage, bis dieser Vorgang abgeschlossen ist. Sobald der Prozessor 30 Sekunden nichts zu tun hat, wird die Arbeit am Index aufgenommen beziehungsweise fortgesetzt. Ist er fertig, bietet diese Datenbank das Material, auf den sich der Google- Algorithmus stürzt, sobald eine Suchanfrage gestartet wird. Die meisten Google-Tricks für die Suche nach Web-Seiten, Bildern oder Beiträgen in Newsgroups funktionieren auch bei der Desktop-Suche."
    Date
    3. 5.1997 8:44:22
    Source
    Bergische Landeszeitung. Nr.247 vom 21.10.2004, S.22
  6. Publishers go head-to-head over search tools : Elsevier's Scopus (2004) 0.05 
    0.046640776 = product of:
  0.06996116 = sum of:
    0.043309923 = weight(_text_:science in 2496) [ClassicSimilarity], result of:
      0.043309923 = score(doc=2496,freq=20.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.32211322 = fieldWeight in 2496, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2496)
    0.026651239 = product of:
      0.053302478 = sum of:
        0.053302478 = weight(_text_:index in 2496) [ClassicSimilarity], result of:
          0.053302478 = score(doc=2496,freq=4.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.23897146 = fieldWeight in 2496, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2496)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Content
    "Will there ever be a science equivalent of Google? Two of the world's biggest science publishing and information firms seem to think that there will. They are about to compete head-to-head to create the most popular tool for searching the scientific literature. Elsevier, the Amsterdam-based publisher of more than 1,800 journals, has announced that this autumn it will launch Scopus, an online search engine covering abstracts and references from 14,000 scientific journals. Scopus will arrive as a direct competitor for the established Web of Science, owned by Thomson ISI of Philadelphia, the scientific information specialist. "Scopus will definitely be a threat to ISI," says one science publishing expert, who asked not to be named. "But ISI will not just let this happen. There will be some kind of arms race in terms of adding new features." Many researchers are already wedded to subject-specific databases of scientific information, such as PubMed, for biomedical research. But Web of Science is currently the only service to cover the full spectrum of scientific disciplines and publications. It can also generate the citation statistics that are sometimes used to measure the quality ofjournals and individual papers. ISI, which is widely used by libraries worldwide, may be hard to displace. It covers fewer than 9,000 journals, but it has been available in its present form since 1997 and includes a 60-year archive of papers. Thomson ISI says it will extend this to 105 years by the end of 2005. The company also owns the only extensive database an patent abstracts.
    Elsevier cannot hope to match this coverage in the short term. The company has been able to draw an its experience of running biomedical and pharmaceutical databases, and developers began compiling a multidisciplinary index two years ago. Even so, when it launches, Scopus will index only five years of references far some journals, rising to ten years during 2005. Data an abstracts will go back further, in some cases to the mid-1960s. Because Scopus has been built from scratch, Elsevier has been able to work with librarians to develop an alternative to the Web of Science interface, which has been criticized by some users. "Users are very happy with Scopus," says Steven Gheyselinck, a librarian at the University of Lausanne in Switzerland who has been testing it. Although Scopus and Web of Science are the only products aiming to cover all of science, other search engines are also under development. The Google of science could end up being Google itself the company has collaborated with nine publishers, including Nature Publishing Group, to create an engine called CrossRef Search. This service, a pilot of which appeared last month, allows users to search digital versions of all papers held by the publishers involved and returns links to articles an their websites. Unlike Web of Science and Scopus, which scan through the titles and abstracts of articles, CrossRef Search also searches the full text of papers. Many of the other 300 or so members of CrossRef - a publishers' collaboration established to allow easier linking between citations - are likely to join the service if the pilot is successful."
  7. Ding, Y.; Yan, E.; Frazho, A.; Caverlee, J.: PageRank for ranking authors in co-citation networks (2009) 0.05 
    0.0461109 = product of:
  0.06916635 = sum of:
    0.023478512 = weight(_text_:science in 3161) [ClassicSimilarity], result of:
      0.023478512 = score(doc=3161,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.17461908 = fieldWeight in 3161, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=3161)
    0.04568784 = product of:
      0.09137568 = sum of:
        0.09137568 = weight(_text_:index in 3161) [ClassicSimilarity], result of:
          0.09137568 = score(doc=3161,freq=4.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.40966535 = fieldWeight in 3161, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=3161)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculated the ranks of these 108 authors based on PageRank with the damping factor ranging from 0.05 to 0.95. In order to test the relationship between different measures, we compared PageRank and weighted PageRank results with the citation ranking, h-index, and centrality measures. We found that in our author co-citation network, citation rank is highly correlated with PageRank with different damping factors and also with different weighted PageRank algorithms; citation rank and PageRank are not significantly correlated with centrality measures; and h-index rank does not significantly correlate with centrality measures but does significantly correlate with other measures. The key factors that have impact on the PageRank of authors in the author co-citation network are being co-cited with important authors.
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.11, S.2229-2243
  8. Ardo, A.; Lundberg, S.: ¬A regional distributed WWW search and indexing service : the DESIRE way (1998) 0.04 
    0.044290036 = product of:
  0.13287011 = sum of:
    0.13287011 = sum of:
      0.09137568 = weight(_text_:index in 4190) [ClassicSimilarity], result of:
        0.09137568 = score(doc=4190,freq=4.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.40966535 = fieldWeight in 4190, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.046875 = fieldNorm(doc=4190)
      0.04149442 = weight(_text_:22 in 4190) [ClassicSimilarity], result of:
        0.04149442 = score(doc=4190,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.23214069 = fieldWeight in 4190, 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=4190)
  0.33333334 = coord(1/3)
    Abstract
    Creates an open, metadata aware system for distributed, collaborative WWW indexing. The system has 3 main components: a harvester (for collecting information), a database (for making the collection searchable), and a user interface (for making the information available). all components can be distributed across networked computers, thus supporting scalability. The system is metadata aware and thus allows searches on several fields including title, document author and URL. Nordic Web Index (NWI) is an application using this system to create a regional Nordic Web-indexing service. NWI is built using 5 collaborating service points within the Nordic countries. The NWI databases can be used to build additional services
    Date
    1. 8.1996 22:08:06
    Object
    Nordic Web Index
  9. Nicholson, S.: Raising reliability of Web search tool research through replication and chaos theory (2000) 0.04 
    0.043388095 = product of:
  0.06508214 = sum of:
    0.027391598 = weight(_text_:science in 4806) [ClassicSimilarity], result of:
      0.027391598 = score(doc=4806,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.20372227 = fieldWeight in 4806, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4806)
    0.037690543 = product of:
      0.075381085 = sum of:
        0.075381085 = weight(_text_:index in 4806) [ClassicSimilarity], result of:
          0.075381085 = score(doc=4806,freq=2.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.33795667 = fieldWeight in 4806, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4806)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Because the WWW is a dynamic collection of information, the Web search tools (or 'search engines') that index the Web are dynamic. Traditional information retrieval evaluation techniques may not provide reliable results when applied to the Web search tools. This study is the result of 10 replications of the 1996 classic Ding and Marchionini Web search tool research. It explores the effects that replication can have on transforming unreliable results from one iteration into replicable and therefore reliable results following multile iterations
    Source
    Journal of the American Society for Information Science. 51(2000) no.8, S.724-729
  10. Ding, C.; Patra, J.C.: User modeling for personalized Web search with Self-Organizing Map (2007) 0.04 
    0.043388095 = product of:
  0.06508214 = sum of:
    0.027391598 = weight(_text_:science in 429) [ClassicSimilarity], result of:
      0.027391598 = score(doc=429,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.20372227 = fieldWeight in 429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0546875 = fieldNorm(doc=429)
    0.037690543 = product of:
      0.075381085 = sum of:
        0.075381085 = weight(_text_:index in 429) [ClassicSimilarity], result of:
          0.075381085 = score(doc=429,freq=2.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.33795667 = fieldWeight in 429, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0546875 = fieldNorm(doc=429)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The widely used Web search engines index and recommend individual Web pages in response to a few keywords queries to assist users in locating relevant documents. However, the Web search engines give different users the same answer set, although the users may have different preferences. A personalized Web search would carry out the search for each user according to his or her preferences. To conduct the personalized Web search, the authors provide a novel approach to model the user profile with a self-organizing map (SOM). Their results indicate that SOM is capable of helping the user to find the related category for each query used in the Web search to make a personalized Web search effective.
    Source
    Journal of the American Society for Information Science and Technology. 58(2007) no.4, S.494-504
  11. Internet: The editor's choice (2004) 0.04 
    0.04126375 = product of:
  0.12379125 = sum of:
    0.12379125 = sum of:
      0.075381085 = weight(_text_:index in 2090) [ClassicSimilarity], result of:
        0.075381085 = score(doc=2090,freq=2.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.33795667 = fieldWeight in 2090, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2090)
      0.04841016 = weight(_text_:22 in 2090) [ClassicSimilarity], result of:
        0.04841016 = score(doc=2090,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.2708308 = fieldWeight in 2090, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2090)
  0.33333334 = coord(1/3)
    Abstract
    Googeln Sie zuweilen, um wissenschaftliche Publikationen zu finden? Dazu waren bislang recht präzise Suchanfragen nötig. um den hermeneutischen Aufwand, Spreu von Weizen zu trennen, in Grenzen zu halten - Namen alleine reichten etwa nicht. Seit neuestem bietet Google, in Zusammenarbeit rnit Verlagen, unter http://scholar.google.com/ eine auf wissenschaftliche Publikationen spezialisierte Version seiner Suchmaschine an. Das Motto: "Stand an the shoulders of giants." Obwohl noch als "beta" ausgewiesen. fallen erste Tests beeindruckend aus: umfassend und tatsächlich ausschliesslich auf wissenschaftliche Arbeiten beschränkt. Sortiert wird nach einem aus gegenseitiger Zitation gewonnenen Index, ähnlich zu Googles "Page Rank". Wenn sich diese Qualität halten und ausbauen lässt, haben wir die Geburtsstunde eines weiteren wichtigen Instruments wissenschaftlicher Literaturrecherche und -Versorgung erlebt.
    Date
    3. 1.2005 12:03:22
  12. Fong, W.W.: Searching the World Wide Web (1996) 0.04 
    0.039311755 = product of:
  0.05896763 = sum of:
    0.031304684 = weight(_text_:science in 6597) [ClassicSimilarity], result of:
      0.031304684 = score(doc=6597,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.23282544 = fieldWeight in 6597, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0625 = fieldNorm(doc=6597)
    0.027662948 = product of:
      0.055325896 = sum of:
        0.055325896 = weight(_text_:22 in 6597) [ClassicSimilarity], result of:
          0.055325896 = score(doc=6597,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.30952093 = fieldWeight in 6597, 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=6597)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Source
    Journal of library and information science. 22(1996) no.1, S.15-36
  13. Gorbunov, A.L.: Relevance of Web documents : ghosts consensus method (2002) 0.04 
    0.037189797 = product of:
  0.05578469 = sum of:
    0.023478512 = weight(_text_:science in 1005) [ClassicSimilarity], result of:
      0.023478512 = score(doc=1005,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.17461908 = fieldWeight in 1005, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=1005)
    0.03230618 = product of:
      0.06461236 = sum of:
        0.06461236 = weight(_text_:index in 1005) [ClassicSimilarity], result of:
          0.06461236 = score(doc=1005,freq=2.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.28967714 = fieldWeight in 1005, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.046875 = fieldNorm(doc=1005)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The dominant method currently used to improve the quality of Internet search systems is often called "digital democracy." Such an approach implies the utilization of the majority opinion of Internet users to determine the most relevant documents: for example, citation index usage for sorting of search results (google.com) or an enrichment of a query with terms that are asked frequently in relation with the query's theme. "Digital democracy" is an effective instrument in many cases, but it has an unavoidable shortcoming, which is a matter of principle: the average intellectual and cultural level of Internet users is very low- everyone knows what kind of information is dominant in Internet query statistics. Therefore, when one searches the Internet by means of "digital democracy" systems, one gets answers that reflect an underlying assumption that the user's mind potential is very low, and that his cultural interests are not demanding. Thus, it is more correct to use the term "digital ochlocracy" to refer to Internet search systems with "digital democracy." Based an the well-known mathematical mechanism of linear programming, we propose a method to solve the indicated problem.
    Source
    Journal of the American Society for Information Science and technology. 53(2002) no.10, S.783-788
  14. Alte Zeitschriften in Googles Buchsuche : Suchmaschine (2009) 0.04 
    0.03596723 = product of:
  0.053950842 = sum of:
    0.03320363 = weight(_text_:science in 2619) [ClassicSimilarity], result of:
      0.03320363 = score(doc=2619,freq=4.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.24694869 = fieldWeight in 2619, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=2619)
    0.02074721 = product of:
      0.04149442 = sum of:
        0.04149442 = weight(_text_:22 in 2619) [ClassicSimilarity], result of:
          0.04149442 = score(doc=2619,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.23214069 = fieldWeight in 2619, 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=2619)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Content
    "Nach Büchern folgen jetzt auch Zeitschriften: Google digitalisiert gedruckte Magazine und macht sie über die Buchsuche zugänglich. Möglich ist das durch eine Partnerschaft des Suchmaschinenbetreibers mit mehreren Zeitschriftenverlagen in den USA. Anders als viele von Google digitalisierte Bücher können die Zeitschriftenartikel auch in Deutschland gelesen werden. Unter den Magazinen finden sich zum Beispiel das New York Magazine, Popular Mechanics oder Ebony, aber auch Popular Science und Bulletin of Atomic Science. Auch Men's Health ist dabei. Andere Titel sollen noch folgen. In Googles Buchsuche kann man die indexierten Zeitschriften nach verschiedenen Begriffen durchsuchen. Für die Magazine selbst gibt es allerdings kein Verzeichnis: Eine gezielte Suche nach einer bestimmten Zeitschrift ist deshalb nicht möglich. Die einzelnen Ausgaben stehen als vollständige farbige Scans zur Verfügung. Neben einem Inhaltsverzeichnis wird auch eine Liste mit Schlüsselbegriffen der jeweiligen Edition angezeigt. Eine Unterteilung nach Jahreszahlen gibt es ebenfalls."
    Date
    7. 2.2009 11:22:39
  15. Duval, B.K.; Main, L.: Searching the Internet : part 2 trail-blazers (1997) 0.04 
    0.035368927 = product of:
  0.10610678 = sum of:
    0.10610678 = sum of:
      0.06461236 = weight(_text_:index in 858) [ClassicSimilarity], result of:
        0.06461236 = score(doc=858,freq=2.0), product of:
          0.22304957 = queryWeight, product of:
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.05104385 = queryNorm
          0.28967714 = fieldWeight in 858, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.369764 = idf(docFreq=1520, maxDocs=44218)
            0.046875 = fieldNorm(doc=858)
      0.04149442 = weight(_text_:22 in 858) [ClassicSimilarity], result of:
        0.04149442 = score(doc=858,freq=2.0), product of:
          0.17874686 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05104385 = queryNorm
          0.23214069 = fieldWeight in 858, 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=858)
  0.33333334 = coord(1/3)
    Abstract
    Presents a guide to searching for information on the Internet covering Research-It; familiar quotations: a collection of passages, phrases and proverbs traced to their sources in ancient and modern literature by John Bartlett; the Internet Public Library Reference Center; SearchERIC Database; Britannica Online; Britannica's Lives; The complete works of William Shakespeare; Flicks/Movie Schedules and Reviews; the Electronic Newsstand; CNN Interactive; Time Warner's Pathfinder; Electronic Newspapers from all 50 States; Yahoo, News; Newspapers; Techweb; ZDNet; the On-line Books Page; Columbia University Bartleby Library; the Children's Literature Web Guide; National Institutes of Health; US Census Bureau; Earthquake Info; US Postal Service Zip+4 Lookup; the Federal Web Locator; World Wide Web Virtual Library; US Government Information Sources; Index of the Constitution of the US; US States Code; Find California Code; Dearch for Bills; California Tenant's Rights; The Online Career Center; QuickAID Home Page; City.Net; Netscape's Destinations Button; International Telephone Directory; World Alumni Net; Archives of Adoptees and Birth Parents; and World Wide Registry Matching Adoptees with Birth Parents
    Date
    6. 3.1997 16:22:15
  16. Rose, D.E.: Reconciling information-seeking behavior with search user interfaces for the Web (2006) 0.03 
    0.03439779 = product of:
  0.05159668 = sum of:
    0.027391598 = weight(_text_:science in 5296) [ClassicSimilarity], result of:
      0.027391598 = score(doc=5296,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.20372227 = fieldWeight in 5296, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5296)
    0.02420508 = product of:
      0.04841016 = sum of:
        0.04841016 = weight(_text_:22 in 5296) [ClassicSimilarity], result of:
          0.04841016 = score(doc=5296,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.2708308 = fieldWeight in 5296, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5296)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Date
    22. 7.2006 17:58:06
    Source
    Journal of the American Society for Information Science and Technology. 57(2006) no.6, S.797-799
  17. Chen, Z.; Meng, X.; Fowler, R.H.; Zhu, B.: Real-time adaptive feature and document learning for Web search (2001) 0.03 
    0.030991498 = product of:
  0.046487246 = sum of:
    0.019565428 = weight(_text_:science in 5209) [ClassicSimilarity], result of:
      0.019565428 = score(doc=5209,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.1455159 = fieldWeight in 5209, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5209)
    0.026921818 = product of:
      0.053843636 = sum of:
        0.053843636 = weight(_text_:index in 5209) [ClassicSimilarity], result of:
          0.053843636 = score(doc=5209,freq=2.0), product of:
            0.22304957 = queryWeight, product of:
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.05104385 = queryNorm
            0.24139762 = fieldWeight in 5209, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.369764 = idf(docFreq=1520, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5209)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Chen et alia report on the design of FEATURES, a web search engine with adaptive features based on minimal relevance feedback. Rather than developing user profiles from previous searcher activity either at the server or client location, or updating indexes after search completion, FEATURES allows for index and user characterization files to be updated during query modification on retrieval from a general purpose search engine. Indexing terms relevant to a query are defined as the union of all terms assigned to documents retrieved by the initial search run and are used to build a vector space model on this retrieved set. The top ten weighted terms are presented to the user for a relevant non-relevant choice which is used to modify the term weights. Documents are chosen if their summed term weights are greater than some threshold. A user evaluation of the top ten ranked documents as non-relevant will decrease these term weights and a positive judgement will increase them. A new ordering of the retrieved set will generate new display lists of terms and documents. Precision is improved in a test on Alta Vista searches.
    Source
    Journal of the American Society for Information Science and technology. 52(2001) no.8, S.655-665
  18. Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999) 0.03 
    0.029483816 = product of:
  0.044225723 = sum of:
    0.023478512 = weight(_text_:science in 4189) [ClassicSimilarity], result of:
      0.023478512 = score(doc=4189,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.17461908 = fieldWeight in 4189, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=4189)
    0.02074721 = product of:
      0.04149442 = sum of:
        0.04149442 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
          0.04149442 = score(doc=4189,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.23214069 = fieldWeight in 4189, 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=4189)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Eine ganze Anzahl von Bibliotheken in Europa befaßt sich mit der Entwicklung von Internet Subject Gateways - einer Serviceleistung, die den Nutzern helfen soll, qualitativ hochwertige Internetquellen zu finden. Subject Gateways wie SOSIG (The Social Science Information Gateway) sind bereits seit einigen Jahren im Internet verfügbar und stellen eine Alternative zu Internet-Suchmaschinen wie AltaVista und Verzeichnissen wie Yahoo dar. Bezeichnenderweise stützen sich Subject Gateways auf die Fertigkeiten, Verfahrensweisen und Standards der internationalen Bibliothekswelt und wenden diese auf Informationen aus dem Internet an. Dieses Referat will daher betonen, daß Bibliothekare/innen idealerweise eine vorherrschende Rolle im Aufbau von Suchservices für Internetquellen spielen und daß Information Gateways eine Möglichkeit dafür darstellen. Es wird einige der Subject Gateway-Initiativen in Europa umreißen und die Werkzeuge und Technologien beschreiben, die vom Projekt DESIRE entwickelt wurden, um die Entwicklung neuer Gateways in anderen Ländern zu unterstützen. Es wird auch erörtert, wie IMesh, eine Gruppe für Gateways aus der ganzen Welt eine internationale Strategie für Gateways anstrebt und versucht, Standards zur Umsetzung dieses Projekts zu entwickeln
    Date
    22. 6.2002 19:35:09
  19. Large, A.; Beheshti, J.; Rahman, T.: Design criteria for children's Web portals : the users speak out (2002) 0.03 
    0.029483816 = product of:
  0.044225723 = sum of:
    0.023478512 = weight(_text_:science in 197) [ClassicSimilarity], result of:
      0.023478512 = score(doc=197,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.17461908 = fieldWeight in 197, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=197)
    0.02074721 = product of:
      0.04149442 = sum of:
        0.04149442 = weight(_text_:22 in 197) [ClassicSimilarity], result of:
          0.04149442 = score(doc=197,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.23214069 = fieldWeight in 197, 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=197)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Date
    2. 6.2005 10:34:22
    Source
    Journal of the American Society for Information Science and technology. 53(2002) no.2, S.79-94
  20. Bilal, D.: Children's use of the Yahooligans! Web search engine : III. Cognitive and physical behaviors on fully self-generated search tasks (2002) 0.03 
    0.029483816 = product of:
  0.044225723 = sum of:
    0.023478512 = weight(_text_:science in 5228) [ClassicSimilarity], result of:
      0.023478512 = score(doc=5228,freq=2.0), product of:
        0.13445559 = queryWeight, product of:
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.05104385 = queryNorm
        0.17461908 = fieldWeight in 5228, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.6341193 = idf(docFreq=8627, maxDocs=44218)
          0.046875 = fieldNorm(doc=5228)
    0.02074721 = product of:
      0.04149442 = sum of:
        0.04149442 = weight(_text_:22 in 5228) [ClassicSimilarity], result of:
          0.04149442 = score(doc=5228,freq=2.0), product of:
            0.17874686 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05104385 = queryNorm
            0.23214069 = fieldWeight in 5228, 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=5228)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Bilal, in this third part of her Yahooligans! study looks at children's performance with self-generated search tasks, as compared to previously assigned search tasks looking for differences in success, cognitive behavior, physical behavior, and task preference. Lotus ScreenCam was used to record interactions and post search interviews to record impressions. The subjects, the same 22 seventh grade children in the previous studies, generated topics of interest that were mediated with the researcher into more specific topics where necessary. Fifteen usable sessions form the basis of the study. Eleven children were successful in finding information, a rate of 73% compared to 69% in assigned research questions, and 50% in assigned fact-finding questions. Eighty-seven percent began using one or two keyword searches. Spelling was a problem. Successful children made fewer keyword searches and the number of search moves averaged 5.5 as compared to 2.4 on the research oriented task and 3.49 on the factual. Backtracking and looping were common. The self-generated task was preferred by 47% of the subjects.
    Source
    Journal of the American Society for Information Science and technology. 53(2002) no.13, S.1170-1183

Authors

Years

Languages

Types

  • a 322
  • el 28
  • m 21
  • s 7
  • x 4
  • p 2
  • r 1
  • More… Less…

Themes

Subjects

Classifications