Search (81 results, page 1 of 5)

  • × theme_ss:"Suchmaschinen"
  • × type_ss:"el"
  1. Sander, M.; Cronimund, C.: Google anonym nutzen? : Wie ein Zürcher den Tech-Giganten austrickst (2021) 0.05 
    0.04788312 = product of:
  0.07182468 = sum of:
    0.0066366266 = weight(_text_:a in 130) [ClassicSimilarity], result of:
      0.0066366266 = score(doc=130,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.12739488 = fieldWeight in 130, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=130)
    0.06518805 = product of:
      0.1303761 = sum of:
        0.1303761 = weight(_text_:de in 130) [ClassicSimilarity], result of:
          0.1303761 = score(doc=130,freq=4.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.6714827 = fieldWeight in 130, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.078125 = fieldNorm(doc=130)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Source
    https://www.nzz.ch/technologie/google-anonym-nutzen-wie-ein-zuercher-den-tech-giganten-austrickst-ld.1592202?utm_source=pocket-newtab-global-de-DE
    Type
    a
  2. Meineck, S.: Gesichter-Suchmaschine PimEyes bricht das Schweigen : Neuer Chef (2022) 0.05 
    0.04788312 = product of:
  0.07182468 = sum of:
    0.0066366266 = weight(_text_:a in 418) [ClassicSimilarity], result of:
      0.0066366266 = score(doc=418,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.12739488 = fieldWeight in 418, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=418)
    0.06518805 = product of:
      0.1303761 = sum of:
        0.1303761 = weight(_text_:de in 418) [ClassicSimilarity], result of:
          0.1303761 = score(doc=418,freq=4.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.6714827 = fieldWeight in 418, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.078125 = fieldNorm(doc=418)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Source
    https://netzpolitik.org/2022/neuer-chef-gesichter-suchmaschine-pimeyes-bricht-das-schweigen/?utm_source=pocket-newtab-global-de-DE
    Type
    a
  3. Leisinger, C.: Sobald die Konkurrenten eine faire Chance haben, wird Google auf einen Schlag 20 Prozent seines Marktanteils verlieren (2020) 0.04 
    0.038306497 = product of:
  0.05745974 = sum of:
    0.0053093014 = weight(_text_:a in 44) [ClassicSimilarity], result of:
      0.0053093014 = score(doc=44,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.10191591 = fieldWeight in 44, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=44)
    0.05215044 = product of:
      0.10430088 = sum of:
        0.10430088 = weight(_text_:de in 44) [ClassicSimilarity], result of:
          0.10430088 = score(doc=44,freq=4.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.53718615 = fieldWeight in 44, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.0625 = fieldNorm(doc=44)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Source
    https://www.nzz.ch/wirtschaft/sobald-die-regulierung-kommt-wird-google-auf-einen-schlag-20-prozent-seines-marktanteils-verlieren-ld.1586835?utm_source=pocket-newtab-global-de-DE
    Type
    a
  4. Dunning, A.: Do we still need search engines? (1999) 0.04 
    0.037325956 = product of:
  0.05598893 = sum of:
    0.013139851 = weight(_text_:a in 6021) [ClassicSimilarity], result of:
      0.013139851 = score(doc=6021,freq=4.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.25222903 = fieldWeight in 6021, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=6021)
    0.04284908 = product of:
      0.08569816 = sum of:
        0.08569816 = weight(_text_:22 in 6021) [ClassicSimilarity], result of:
          0.08569816 = score(doc=6021,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.5416616 = fieldWeight in 6021, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=6021)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Source
    Ariadne. 1999, no.22
    Type
    a
  5. Birmingham, J.: Internet search engines (1996) 0.03 
    0.029794488 = product of:
  0.04469173 = sum of:
    0.007963953 = weight(_text_:a in 5664) [ClassicSimilarity], result of:
      0.007963953 = score(doc=5664,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.15287387 = fieldWeight in 5664, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.09375 = fieldNorm(doc=5664)
    0.03672778 = product of:
      0.07345556 = sum of:
        0.07345556 = weight(_text_:22 in 5664) [ClassicSimilarity], result of:
          0.07345556 = score(doc=5664,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.46428138 = fieldWeight in 5664, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5664)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Basically a good listing in table format of features from the major search engines
    Date
    10.11.1996 16:36:22
  6. Bensman, S.J.: Eugene Garfield, Francis Narin, and PageRank : the theoretical bases of the Google search engine (2013) 0.02 
    0.021329116 = product of:
  0.031993672 = sum of:
    0.0075084865 = weight(_text_:a in 1149) [ClassicSimilarity], result of:
      0.0075084865 = score(doc=1149,freq=4.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.14413087 = fieldWeight in 1149, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=1149)
    0.024485188 = product of:
      0.048970375 = sum of:
        0.048970375 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
          0.048970375 = score(doc=1149,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.30952093 = fieldWeight in 1149, 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=1149)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    This paper presents a test of the validity of using Google Scholar to evaluate the publications of researchers by comparing the premises on which its search engine, PageRank, is based, to those of Garfield's theory of citation indexing. It finds that the premises are identical and that PageRank and Garfield's theory of citation indexing validate each other.
    Date
    17.12.2013 11:02:22
    Type
    a
  7. Schaat, S.: Von der automatisierten Manipulation zur Manipulation der Automatisierung (2019) 0.02 
    0.019862993 = product of:
  0.029794488 = sum of:
    0.0053093014 = weight(_text_:a in 4996) [ClassicSimilarity], result of:
      0.0053093014 = score(doc=4996,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.10191591 = fieldWeight in 4996, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=4996)
    0.024485188 = product of:
      0.048970375 = sum of:
        0.048970375 = weight(_text_:22 in 4996) [ClassicSimilarity], result of:
          0.048970375 = score(doc=4996,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = 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.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Date
    19. 2.2019 17:22:00
    Type
    a
  8. Baeza-Yates, R.; Boldi, P.; Castillo, C.: Generalizing PageRank : damping functions for linkbased ranking algorithms (2006) 0.02 
    0.016838789 = product of:
  0.025258183 = sum of:
    0.0099549405 = weight(_text_:a in 2565) [ClassicSimilarity], result of:
      0.0099549405 = score(doc=2565,freq=18.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.19109234 = fieldWeight in 2565, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2565)
    0.015303242 = product of:
      0.030606484 = sum of:
        0.030606484 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.030606484 = score(doc=2565,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.19345059 = fieldWeight in 2565, 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=2565)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that PageRank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank's using a fixed small number of iterations; comparisons were performed using Kendall's tau on large domain datasets.
    Date
    16. 1.2016 10:22:28
    Type
    a
  9. Boldi, P.; Santini, M.; Vigna, S.: PageRank as a function of the damping factor (2005) 0.02 
    0.016459234 = product of:
  0.024688851 = sum of:
    0.009385608 = weight(_text_:a in 2564) [ClassicSimilarity], result of:
      0.009385608 = score(doc=2564,freq=16.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.18016359 = fieldWeight in 2564, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2564)
    0.015303242 = product of:
      0.030606484 = sum of:
        0.030606484 = weight(_text_:22 in 2564) [ClassicSimilarity], result of:
          0.030606484 = score(doc=2564,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.19345059 = fieldWeight in 2564, 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=2564)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor alpha that spreads uniformly part of the rank. The choice of alpha is eminently empirical, and in most cases the original suggestion alpha=0.85 by Brin and Page is still used. Recently, however, the behaviour of PageRank with respect to changes in alpha was discovered to be useful in link-spam detection. Moreover, an analytical justification of the value chosen for alpha is still missing. In this paper, we give the first mathematical analysis of PageRank when alpha changes. In particular, we show that, contrarily to popular belief, for real-world graphs values of alpha close to 1 do not give a more meaningful ranking. Then, we give closed-form formulae for PageRank derivatives of any order, and an extension of the Power Method that approximates them with convergence O(t**k*alpha**t) for the k-th derivative. Finally, we show a tight connection between iterated computation and analytical behaviour by proving that the k-th iteration of the Power Method gives exactly the PageRank value obtained using a Maclaurin polynomial of degree k. The latter result paves the way towards the application of analytical methods to the study of PageRank.
    Date
    16. 1.2016 10:22:28
    Type
    a
  10. ¬Der Google Hummingbird Algorithmus : semantisch-holistische Suche (2013) 0.01 
    0.012291977 = product of:
  0.03687593 = sum of:
    0.03687593 = product of:
      0.07375186 = sum of:
        0.07375186 = weight(_text_:de in 2521) [ClassicSimilarity], result of:
          0.07375186 = score(doc=2521,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.37984797 = fieldWeight in 2521, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.0625 = fieldNorm(doc=2521)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    http://www.searchmetrics.com/de/knowledge-base/hummingbird/
  11. Sander-Beuermann, W.: Schürfrechte im Informationszeitalter : Google hin, Microsoft her v das Internet braucht eine freie Suchkultur (2005) 0.01 
    0.00878859 = product of:
  0.013182885 = sum of:
    0.0016591566 = weight(_text_:a in 3245) [ClassicSimilarity], result of:
      0.0016591566 = score(doc=3245,freq=2.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.03184872 = fieldWeight in 3245, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.01953125 = fieldNorm(doc=3245)
    0.011523728 = product of:
      0.023047457 = sum of:
        0.023047457 = weight(_text_:de in 3245) [ClassicSimilarity], result of:
          0.023047457 = score(doc=3245,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.11870249 = fieldWeight in 3245, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.01953125 = fieldNorm(doc=3245)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Artikel als Reaktion auf das Angebot von Google: http://scholar.google.com/. Begleitkommentar des Verfassers: Der "Google-Scholar" (http://scholar.google.com/) ist durchaus eine bemerkenswerte Entwicklung von Google, welche die Internet-Suchtechnik voranbringt - zumindest vordergruendig. Der Satz auf der Scholar Startseite "Stand on the shoulders of giants" drueckt es treffend aus: derart gigantische Ressourcen hat eben im Suchmaschinenbereich sonst niemand. Und genau DAS ist der Punkt: das Quasi-Monopol von Google (spaeter u.U. Microsoft) wird dadurch NOCH staerker werden. Ich halte diese Entwicklung fuer bedrohlich. An dieser Stelle ist kein Vorwurf an Google zu richten: dort verhaelt man sich nur so, wie es der Markt verlangt. Der Vorwurf ist dorthin zu richten, wo diese Entwicklung gesehen und ignoriert wird. Ich erlebe es immer wieder, auch in "hochrangigen" Gespraechen, dass als "Argument" gegen alternative Enticklungen vorgebracht wird "was wollt ihr da eigentlich - es gibt doch Google und die sind doch gut". Solche Kurzsichtigkeit ist kaum uebertreffbar. Von der Zeitschrift "Technology Review" des Heise-Verlages (das deutsche Pendant zum MIT-Review) wurde ich gebeten, hierzu einen Artikel zu schreiben. Sie finden diesen Artikel bei Interesse im WWW unter http://suma-ev.de/tech-rev1.html Daraus hat sich eine Diskussion ueber unabhaengige Suchmaschinen ergeben, die ich hier kurz skizzieren moechte: ----------------------------------------------------------------------- Unabhaengige Suchmaschinen sind in einem weiten Spektrum von Moeglichkeiten denkbar: 1. von voellig freien, nicht strukturierten, losen Zusammenschluessen, z.B. auf Peer-to-Peer Basis (a la YACY: http://suma-lab.de/) 2. bis hin zu staatlich gewollter Unabhaengigkeit durch gesetzliche Regelungen (aehnlich der Intention beim oeffentlich-rechtlichen Rundfunk und Fernsehen); Stichwort: oeffentlich-rechtliche Suchmaschine 3. Dazwischen sind Optionen denkbar, die beides kombinieren: eine Vielzahl von Betreibern kleinerer Suchmaschinen (Mini-Sucher), die sich zu Verbuenden organisieren, in denen Organisationen des oeffentlich-rechtlichen Raumes, wie z.B. Bibliotheken und Universitaeten als klassische Wissensvermittler, eine tragende Rolle spielen. 4. Und moeglicherweise sehen SIE noch ganz andere Moeglichkeiten ...?
    Content
    Text des Artikels: "Wenn der Rohstoff des 21. Jahrhunderts wirklich Information ist, dann unterscheidet er sich grundlegend von seinen Vorgängern Eisenerz und Erdöl: Er verbraucht sich nicht, kann endlos wiederverwertet werden, ist einfach um die ganze Welt transportierbar, und kann sich sogar durch Neuzusammensetzung vermehren. Letztere Eigenschaft, so schön sie zunächst scheint, wird allmählich zur Plage. Die Menge der weltweit vorliegenden Information wächst seit Jahrhunderten stetig. Laut einem Bericht der University of California in Berkeley schafft die Menschheit derzeit ein bis zwei Exabyte (Milliarden Gigabyte) an Information pro Jahr. Dargestellt als Text entspricht das einem Stapel von rund einer Billion dicker Bücher - dessen Höhe etwa die 130-fachen Entfernung Erde-Mond erreichen würde. Die große Herausforderung ist, aus solch gigantischen Informationsmengen das subjektiv Wesentliche - also das Wissen - herauszusuchen. Die Wissensextraktion wird im digitalen Zeitalter zunehmend von Internet-Suchmaschinen übernommen. Sie verarbeiten den Rohstoff Information zu Wissen, kontrollieren und verteilen ihn. Es kann keinem Nutzer ganz geheuer sein, dass diese Schlüsselfunktion der Informationsgesellschaft in die Hände weniger Konzerne gerät: Google hat mit einem Marktanteil von mehr als 80 Prozent in Deutschland ein De-facto-Monopol erreicht, das nun Microsoft mit seiner "MSN Search" angreifen will. Aber diese Alternative weckt schwerlich mehr Vertrauen.
  12. bbu/c't: Ask Jeeves mit verbesserten Suchfunktionen (2005) 0.01 
    0.0061459886 = product of:
  0.018437965 = sum of:
    0.018437965 = product of:
      0.03687593 = sum of:
        0.03687593 = weight(_text_:de in 3453) [ClassicSimilarity], result of:
          0.03687593 = score(doc=3453,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.18992399 = fieldWeight in 3453, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.03125 = fieldNorm(doc=3453)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Mit nicht völlig neuen, aber überarbeiteten Suchfunktionen erweitert das zum Firmenimperium des US-Medienzaren Barry Diller gehörende Unternehmen Ask Jeeves das Leistungsspektrum seiner Suchmaschine. Mit der Ergebnisverfeinerungsfunktion Focus erhält der Suchende auf der rechten oberen Bildschirmseite eine Liste, die das Thema seiner Suche thematisch aufgliedern soll. Eine zweite Neuerung verspricht präzise Antworten auf als Fragen formulierte Sucheinträge. So ergibt der Eintrag "Lady Diana" zum Beispiel eine Liste mit den Items Princess Di, Princess Dianas Life, Princess Diana's Wedding. Interessant dabei ist, dass diese Liste nicht einfach aus einem monolithischen Block von Schlüsselwörtern besteht, sondern in drei Kategorien aufgeteilt ist: "Narrow Your Search", "Expand Your Search" und "Related Names". Waren die eben genannten Beispiele aus der ersten Kategorie, finden sich unter Expand Your Search Einträge wie Royal Family, Princess Di Ring, Princess Di Prince Charles History oder Prince William Harry, allerdings auch Who Is Louis De Funes? "Related Names" verweist auf Einträge wie Diana Spencer, Prince Harry oder Imran Khan. Die Suchfunktion soll also die thematische Verfeinerung oder Ausweitung gleichermaßen wie die Fortsetzung der Suche mit einem verwandten Thema ermöglichen. Auf die Frage "who invented the telephone" erhält der Suchende als ersten Eintrag die Antwort "The telephone was invented by Alexander Graham Bell" mit dem roten Vermerk "Web Answer'. Bemerkenswert ist hier, dass auf eine Frage nicht nur eine passende Webseite mit der Antwort angezeigt wird, sondern die ausformulierte Antwort direkt aus der vorgeschlagenen Webseite zitiert wird. Die Frage "who is the mother of Albert Einstein" gibt immerhin einen Eintrag unter "Narrow Your Search" mit "Albert Einstein Family tree". Ask Jeeves wird wohl noch eine weitere Neuerung bevorstehen: Auf einer Pressekonferenz in San Francisco bemerkte Chief Executive Barry Diller, dass das Unternehmen über eine Namensänderung von Ask Jeeves nachdenke. Wahrscheinlich werde auf eines der beiden Worte verzichtet werden. Mit dem Sucheintrag "How will Ask Jeeves be called in the future" erhält man bislang jedoch noch keine "Web Answer". (26.05.2005 15:30)
  13. Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999) 0.01 
    0.0061212964 = product of:
  0.01836389 = sum of:
    0.01836389 = product of:
      0.03672778 = sum of:
        0.03672778 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
          0.03672778 = score(doc=4189,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = 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.33333334 = coord(1/3)
    Date
    22. 6.2002 19:35:09
  14. Page, A.: ¬The search is over : the search-engines secrets of the pros (1996) 0.00 
    0.00494665 = product of:
  0.014839949 = sum of:
    0.014839949 = weight(_text_:a in 5670) [ClassicSimilarity], result of:
      0.014839949 = score(doc=5670,freq=10.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.28486365 = fieldWeight in 5670, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=5670)
  0.33333334 = coord(1/3)
    Abstract
    Covers 8 of the most popular search engines. Gives a summary of each and has a nice table of features that also briefly lists the pros and cons. Includes a short explanation of Boolean operators too
    Type
    a
  15. Mandalka, M.: Open semantic search zum unabhängigen und datenschutzfreundlichen Erschliessen von Dokumenten (2015) 0.00 
    0.004609491 = product of:
  0.013828473 = sum of:
    0.013828473 = product of:
      0.027656946 = sum of:
        0.027656946 = weight(_text_:de in 2133) [ClassicSimilarity], result of:
          0.027656946 = score(doc=2133,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.14244299 = fieldWeight in 2133, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.0234375 = fieldNorm(doc=2133)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Footnote
    Vgl. auch: http://www.opensemanticsearch.org/de/.
  16. Bauckhage, C.: Marginalizing over the PageRank damping factor (2014) 0.00 
    0.004424418 = product of:
  0.013273253 = sum of:
    0.013273253 = weight(_text_:a in 928) [ClassicSimilarity], result of:
      0.013273253 = score(doc=928,freq=8.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.25478977 = fieldWeight in 928, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=928)
  0.33333334 = coord(1/3)
    Abstract
    In this note, we show how to marginalize over the damping parameter of the PageRank equation so as to obtain a parameter-free version known as TotalRank. Our discussion is meant as a reference and intended to provide a guided tour towards an interesting result that has applications in information retrieval and classification.
    Type
    a
  17. Gillitzer, B.: Yewno (2017) 0.00 
    0.0040808646 = product of:
  0.012242594 = sum of:
    0.012242594 = product of:
      0.024485188 = sum of:
        0.024485188 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
          0.024485188 = score(doc=3447,freq=2.0), product of:
            0.15821345 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045180224 = queryNorm
            0.15476047 = fieldWeight in 3447, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=3447)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    22. 2.2017 10:16:49
  18. Powell, J.; Fox, E.A.: Multilingual federated searching across heterogeneous collections (1998) 0.00 
    0.00395732 = product of:
  0.01187196 = sum of:
    0.01187196 = weight(_text_:a in 1250) [ClassicSimilarity], result of:
      0.01187196 = score(doc=1250,freq=10.0), product of:
        0.05209492 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.045180224 = queryNorm
        0.22789092 = fieldWeight in 1250, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=1250)
  0.33333334 = coord(1/3)
    Abstract
    This article describes a scalable system for searching heterogeneous multilingual collections on the World Wide Web. It details a markup language for describing the characteristics of a search engine and its interface, and a protocol for requesting word translations between languages.
    Type
    a
  19. Patalong, F.: Life after Google : II. Hilfreiche Geister (2002) 0.00 
    0.0038412428 = product of:
  0.011523728 = sum of:
    0.011523728 = product of:
      0.023047457 = sum of:
        0.023047457 = weight(_text_:de in 1163) [ClassicSimilarity], result of:
          0.023047457 = score(doc=1163,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.11870249 = fieldWeight in 1163, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.01953125 = fieldNorm(doc=1163)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Footnote
    Zum Thema: Im Internet: · Searchbots: Copernic http://www.copernic.com · Searchbots: Bingoo http://www.bingoo.de · Searchbots: BullsEye http://www.intelliseek.com/ · Searchbots: WebFerret http://www.ferretsoft.com · Seartchbots: Lexibot http://www.lexibot.com/ · Searchbot-Verzeichnis bei Searchenginewatch http://www.searchenginewatch.com/links/utilities.html · CNet Download: die Site, die alles hat http://www.download.com · August Kopisch: "Wie war zu Köln es doch vordem..." http://www.gutenberg2000.de/autoren/kopisch.htm
  20. Patalong, F.: Life after Google : I. Besser suchen, wirklich finden (2002) 0.00 
    0.0038412428 = product of:
  0.011523728 = sum of:
    0.011523728 = product of:
      0.023047457 = sum of:
        0.023047457 = weight(_text_:de in 1165) [ClassicSimilarity], result of:
          0.023047457 = score(doc=1165,freq=2.0), product of:
            0.19416152 = queryWeight, product of:
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.045180224 = queryNorm
            0.11870249 = fieldWeight in 1165, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.297489 = idf(docFreq=1634, maxDocs=44218)
              0.01953125 = fieldNorm(doc=1165)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Footnote
    Zum Thema: Im Internet: · Searchenginewatch http://www.searchenginewatch.com · Searchenginewatch: Spezialsuchdienste http://www.searchenginewatch.com/links/specialty.html · Ixquick Metasuche http://www.ixquick.com/ · Pandia Metasearchdienst http://www.pandia.com · Ithaki: Metasuchdienst für Kinderthemen http://www.ithaki.net/kids/ · Metaspinner: Deutscher Metasuchdienst mit vielen speziellen Suchmöglichkeiten http://www.metaspinner.de · AlltheWeb: Googles Herausforderer http://www.alltheweb.com/ · AltaVista: Der ehemalige Marktführer hat mächtig aufgerüstet http://www.altavista.com/ · Inktomi: Suchdienstleister im Hintergrund http://www.inktomi.com/ · Wisenut: Viel versprechender Newcomer, der dringend ein Update gebrauchen könnte http://www.wisenut.com · Teoma sucht anders: Im Doppel mit AskJeeves ein Klasse-Angebot, bisher ohne die nötige Masse http://www.teoma.com · Hotbot: Einst intelligenteste Searchengine, bis heute guter Service http://www.hotbot.lycos.com · ...und natürlich der Dienst, an dem sich alle messen müssen: Google http://www.google.com/intl/de/

Authors

Years

Languages

  • e 52
  • d 27

Types

  • a 44
  • x 1
  • More… Less…

Themes