Search (196 results, page 3 of 10)

0.010898459 = product of:
  0.06539075 = sum of:
    0.06539075 = weight(_text_:22 in 6835) [ClassicSimilarity], result of:
      0.06539075 = score(doc=6835,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.38690117 = fieldWeight in 6835, 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=6835)
  0.16666667 = coord(1/6)

Date

11.11.2001 17:25:22

0.010898459 = product of:
  0.06539075 = sum of:
    0.06539075 = weight(_text_:22 in 568) [ClassicSimilarity], result of:
      0.06539075 = score(doc=568,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.38690117 = fieldWeight in 568, 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=568)
  0.16666667 = coord(1/6)

Date

9. 5.2002 21:21:22

0.010898459 = product of:
  0.06539075 = sum of:
    0.06539075 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
      0.06539075 = score(doc=668,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.38690117 = fieldWeight in 668, 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=668)
  0.16666667 = coord(1/6)

Signature

77 TWP 3911(2)+22

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 105) [ClassicSimilarity], result of:
      0.05764047 = score(doc=105,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=105)
  0.16666667 = coord(1/6)

Abstract

The rapid development of the Internet and World Wide Web has caused some critical problem for information retrieval. Researchers have made several attempts to solve these problems. Thesauri and subject heading lists as traditional information retrieval tools have been criticised for their efficiency to tackle these newly emerging problems. This paper proposes an information retrieval tool generated by cocitation analysis, comprising keyword clusters with relationships based on the co-occurrences of keywords in the literature. Such a tool can play the role of an associative thesaurus that can provide information about the keywords in a domain that might be useful for information searching and query expansion

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 1005) [ClassicSimilarity], result of:
      0.05764047 = score(doc=1005,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 1005, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=1005)
  0.16666667 = coord(1/6)

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.

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 3494) [ClassicSimilarity], result of:
      0.05764047 = score(doc=3494,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 3494, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=3494)
  0.16666667 = coord(1/6)

Abstract

Wer früher etwas im Web finden wollte, hatte es schwer: Zwar gab es Massen von Material, aber etwas Konkretes zu finden, war aufwändig. Und hatte man endlich etwas gefunden, war es oft von mangelhafter Qualität. Suchen im Web war in der Frühzeit vor allem Wühlen: Sehr viele Seiten anfassen, anschauen und verwerfen, in der Hoffnung irgendwann einmal etwas Nützliches zu finden. Suchmaschinen ändern das: Sie erfassen große Teile des Webs und versorgen den Suchenden mit unendlich viel Material - worin dann auch genau das Problem lag: Aus dem Wühlen wurde Suchen, weiter Suchen und nochmals Suchen. Filtern wurde erforderlich, um aus der riesigen Materialmenge die relevanten Teile auszusortieren. Dann kam Google und brachte das, wonach sich alle sehnten: relevante Suchergebnisse. Internet-Nutzer konnten nun finden, mussten nicht mehr wühlen, sondern nur noch googeln. Aber sind ihre Probleme damit gelöst?

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 3495) [ClassicSimilarity], result of:
      0.05764047 = score(doc=3495,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 3495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=3495)
  0.16666667 = coord(1/6)

Abstract

Not macht erfinderisch, dachte sich wohl der Mann, der auf einen Passanten zustürzte, ihn fragte »Entschuldigen Sie, kennen Sie...« und ihm daraufhin Folgendes vorsang: »Schnief, schnief di schneuf, schnippeldischnief, dischneuf«. Gesucht ist offensichtlich der Titel eines Liedes, von dem weder Interpret noch Komponist, sondern nur die Melodie bekannt ist. Diese Szene, die in einer Folge aus Nonstop-Nonsens mit Dieter Hallervorden zu sehen war, ist längst Fernsehgeschichte. Heute ist es näher liegend, eine Suchmaschine zu befragen. Wer aber eine Suchmaschine wie Google nutzt, trifft auf ein Problem: um den unbekannten Titel zu beschreiben, ist lediglich die Eingabe von Text möglich; andere Eingabevarianten bieten Google & Co. nicht an. Sind Titel und Interpret wie im obigen Szenario aber unbekannt, wird es schwierig, eine Melodie nur in Textform zu beschreiben. Einfacher wäre es, eine Melodie zu singen oder zu summen.

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 4546) [ClassicSimilarity], result of:
      0.05764047 = score(doc=4546,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 4546, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=4546)
  0.16666667 = coord(1/6)

Abstract

The literature of the evaluation of Internet search engines is reviewed. Although there have been many studies, there has been little consistency in the way such studies have been carried out. This problem is exacerbated by the fact that recall is virtually impossible to calculate in the fast changing Internet environment, and therefore the traditional Cranfield type of evaluation is not usually possible. A variety of alternative evaluation methods has been suggested to overcome this difficulty. The authors recommend that a standardised set of tools is developed for the evaluation of web search engines so that, in future, comparisons can be made between search engines more effectively, and that variations in performance of any given search engine over time can be tracked. The paper itself does not provide such a standard set of tools, but it investigates the issues and makes preliminary recommendations of the types of tools needed

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 6111) [ClassicSimilarity], result of:
      0.05764047 = score(doc=6111,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 6111, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=6111)
  0.16666667 = coord(1/6)

Abstract

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method that derives extraction rules for identifying the anchor elements forming the link chains. We applied the proposed method to two well-structured Web sites and found that its performance in terms of precision and recall is good, even with a small number of training examples.

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 3185) [ClassicSimilarity], result of:
      0.05764047 = score(doc=3185,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 3185, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=3185)
  0.16666667 = coord(1/6)

Abstract

Query suggestion is generally an integrated part of web search engines. In this study, we first redefine and reduce the query suggestion problem as "comparison of queries". We then propose a general modular framework for query suggestion algorithm development. We also develop new query suggestion algorithms which are used in our proposed framework, exploiting query, session and user features. As a case study, we use query logs of a real educational search engine that targets K-12 students in Turkey. We also exploit educational features (course, grade) in our query suggestion algorithms. We test our framework and algorithms over a set of queries by an experiment and demonstrate a 66-90% statistically significant increase in relevance of query suggestions compared to a baseline method.

0.009606745 = product of:
  0.05764047 = sum of:
    0.05764047 = weight(_text_:problem in 5363) [ClassicSimilarity], result of:
      0.05764047 = score(doc=5363,freq=2.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.28137225 = fieldWeight in 5363, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.046875 = fieldNorm(doc=5363)
  0.16666667 = coord(1/6)

Abstract

This study applies Kuhlthau's Information Search Process stage (ISP) model to understand bilingual users' Internet search experience. We conduct a quasi-field experiment with 30 bilingual searchers and the results suggested that the ISP model was applicable in studying searchers' information retrieval behavior in search tasks. The ISP model was applicable in studying searchers' information retrieval behavior in simple tasks. However, searchers' emotional responses differed from those of the ISP model for a complex task. By testing searchers using different search strategies, the results suggested that search engines with multilanguage search functions provide an advantage for bilingual searchers in the Internet's multilingual environment. The findings showed that when searchers used a search engine as a tool for problem solving, they might experience different feelings in each ISP stage than in searching for information for a term paper using a library. The results echo other research findings that indicate that information seeking is a multifaceted phenomenon.

0.009510802 = product of:
  0.057064813 = sum of:
    0.057064813 = weight(_text_:seele in 3224) [ClassicSimilarity], result of:
      0.057064813 = score(doc=3224,freq=2.0), product of:
        0.35304275 = queryWeight, product of:
          7.314861 = idf(docFreq=79, maxDocs=44218)
          0.04826377 = queryNorm
        0.16163711 = fieldWeight in 3224, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.314861 = idf(docFreq=79, maxDocs=44218)
          0.015625 = fieldNorm(doc=3224)
  0.16666667 = coord(1/6)

Content

Google produziert weiterhin fleißig seine kleinen Perlen: Google Voice, das gesprochene Mailbox-Nachrichten in Emails umwandelt; Chrome, ein schneller und intelligenter Webbrowser und Android, das neue Handy-Betriebssystem. Eines der neuesten Projekte ist die Espresso Book Machine, die Bücher on Demand ausdruckt und bindet. Aber vielleicht wird hier zu viel auf einem Gelände produziert; vielleicht werden die Leute es bald leid, dass überall "Google" draufsteht. Googles berühmter Slogan "Don´t be evil" klingt mehr und mehr wie eine düstere Prophezeiung. Als sie noch an der Uni waren, wetterten Page und Brin gegen Suchmaschinen, die zu viel Werbung hatten. "Die waren strikt gegen Werbung", zitiert Auletta Ram Shriram, einer der ersten Google-Investoren, "das waren Puristen." Inzwischen sehen sie das nicht mehr so eng. Jetzt geht es darum, ständig neues Futter für ein hungriges, 180 Milliarden schweres Monstrum aufzutreiben. Auletta berichtet von einem ungewöhnlichen Einstellungstest, den Brin einmal mit einer Bewerberin für eine Anwaltsposition machte: "Setzen Sie mir einen Vertrag auf", sagte Brin zu der Anwältin, "und zwar für den Verkauf meiner Seele an den Teufel." Das war 2002, dem Jahr, als Google die interne Arbeit an einem Projekt aufgenommen hatte, das später mal AdSense werden sollte. Mittlerweile fliegen Page und Brin in ihrer privaten Boing 767 herum und sprechen ganz ernsthaft über Green IT, während der Strom für die Gratis-Videos auf YouTube Berge von Kohle verbraucht. Noch ist ihnen keine Idee gekommen, wie sie das Verlustgeschäft YouTube "monetisieren" - d.h. also Profit damit erwirtschaften - können. Allerdings ist mir schon aufgefallen, dass auf Philip DeFrancos beliebten YouTube-Videos inzwischen Werbebanner von Samsung laufen. "Der Vorteil, etwas gratis anzubieten, besteht darin, dass man 100 Prozent Marktanteile hat", erklärt Googles Geschäftsführer Eric Schmidt. "Gratis ist das richtige Konzept." Vielleicht eine Weile lang - aber die Frage ist, ob es auf Dauer funktioniert. "Für Zeitungen", schreibt Auletta, "bedeutet das Gratis-Konzept den Untergang." Vielleicht bekommt man am Ende - sogar im Internet - nur noch das, wofür man auch bezahlt hat."

0.009057326 = product of:
  0.054343957 = sum of:
    0.054343957 = weight(_text_:problem in 1160) [ClassicSimilarity], result of:
      0.054343957 = score(doc=1160,freq=4.0), product of:
        0.20485485 = queryWeight, product of:
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.04826377 = queryNorm
        0.2652803 = fieldWeight in 1160, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.244485 = idf(docFreq=1723, maxDocs=44218)
          0.03125 = fieldNorm(doc=1160)
  0.16666667 = coord(1/6)

RSWK

Suchmaschine / Problem

Subject

Suchmaschine / Problem

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 4738) [ClassicSimilarity], result of:
      0.052312598 = score(doc=4738,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 4738, 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=4738)
  0.16666667 = coord(1/6)

Date

1. 8.1996 22:39:31

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 6597) [ClassicSimilarity], result of:
      0.052312598 = score(doc=6597,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = 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.16666667 = coord(1/6)

Source

Journal of library and information science. 22(1996) no.1, S.15-36

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 7268) [ClassicSimilarity], result of:
      0.052312598 = score(doc=7268,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 7268, 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=7268)
  0.16666667 = coord(1/6)

Date

6. 3.1997 16:22:15

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 205) [ClassicSimilarity], result of:
      0.052312598 = score(doc=205,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 205, 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=205)
  0.16666667 = coord(1/6)

Pages

S.18-22

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 2414) [ClassicSimilarity], result of:
      0.052312598 = score(doc=2414,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 2414, 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=2414)
  0.16666667 = coord(1/6)

Date

29.12.1998 11:22:34

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 3278) [ClassicSimilarity], result of:
      0.052312598 = score(doc=3278,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 3278, 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=3278)
  0.16666667 = coord(1/6)

Source

Online. 22(1998) no.2, S.73-76

0.008718766 = product of:
  0.052312598 = sum of:
    0.052312598 = weight(_text_:22 in 3595) [ClassicSimilarity], result of:
      0.052312598 = score(doc=3595,freq=2.0), product of:
        0.1690115 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04826377 = queryNorm
        0.30952093 = fieldWeight in 3595, 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=3595)
  0.16666667 = coord(1/6)

Source

Online. 22(1998) no.3, S.37-38,40-42