Search (6 results, page 1 of 1)

  • × theme_ss:"Automatisches Indexieren"
  • × theme_ss:"Internet"
  • × year_i:[1990 TO 2000}
  1. Lepsky, K.: Im Heuhaufen suchen - und finden : Automatische Erschließung von Internetquellen: Möglichkeiten und Grenzen (1998) 0.01
    0.012104556 = product of:
      0.064557634 = sum of:
        0.0235067 = weight(_text_:und in 4655) [ClassicSimilarity], result of:
          0.0235067 = score(doc=4655,freq=14.0), product of:
            0.060470656 = queryWeight, product of:
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.027283683 = queryNorm
            0.38872904 = fieldWeight in 4655, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.046875 = fieldNorm(doc=4655)
        0.004732762 = weight(_text_:in in 4655) [ClassicSimilarity], result of:
          0.004732762 = score(doc=4655,freq=4.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.12752387 = fieldWeight in 4655, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.046875 = fieldNorm(doc=4655)
        0.03631817 = weight(_text_:bibliotheken in 4655) [ClassicSimilarity], result of:
          0.03631817 = score(doc=4655,freq=4.0), product of:
            0.10280822 = queryWeight, product of:
              3.768121 = idf(docFreq=2775, maxDocs=44218)
              0.027283683 = queryNorm
            0.35326135 = fieldWeight in 4655, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.768121 = idf(docFreq=2775, maxDocs=44218)
              0.046875 = fieldNorm(doc=4655)
      0.1875 = coord(3/16)
    
    Abstract
    Das Internet wird immer unübersichtlicher - auch eine Binsenweisheit, aber wohl mehr ein handfestes Problem. Abhilfe versprechen die diversen Suchmaschinen und Verzeichnisse der kommerziellen Anbieter, zu denen sich thematische Link-Sammlungen anderer Institutionen - etwas Bibliotheken - gesellen. Während die Suchmaschinen mit dem Anspruch arbeiten, das gesamte Netz zu erschließen (und diesen damit einlösen, daß sie ihre Kundschaft teilweise mit mehreren hundert Treffern nach einer Anfrage konfrontieren), haben die Anbieter ausgewählter und intellektuelle erschlossener Quellen häufig mit dem Problem mangelnder Aktualität und der Beschränktheit ihres Angebots zu kämpfen. - Der folgende Beitrag diskutiert verschiedene Verfahren, die in erheblich stärkerem Maße sowohl die Vollständigkeit als auch die Relevanz der durchsuchten beziehungsweise gefundenen Internetquellen sicherstellen sollen. In diesem Zusammenhang wird auch die Frage erörtert, welche Rolle den Bibliotheken bei der Entwicklung und Anwendung solcher Techniken zukommen könnte
  2. Wolfekuhler, M.R.; Punch, W.F.: Finding salient features for personal Web pages categories (1997) 0.00
    0.0024625582 = product of:
      0.019700466 = sum of:
        0.0067624967 = weight(_text_:in in 2673) [ClassicSimilarity], result of:
          0.0067624967 = score(doc=2673,freq=6.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.1822149 = fieldWeight in 2673, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2673)
        0.012937969 = product of:
          0.025875937 = sum of:
            0.025875937 = weight(_text_:22 in 2673) [ClassicSimilarity], result of:
              0.025875937 = score(doc=2673,freq=2.0), product of:
                0.09554281 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.027283683 = queryNorm
                0.2708308 = fieldWeight in 2673, 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=2673)
          0.5 = coord(1/2)
      0.125 = coord(2/16)
    
    Abstract
    Examines techniques that discover features in sets of pre-categorized documents, such that similar documents can be found on the WWW. Examines techniques which will classifiy training examples with high accuracy, then explains why this is not necessarily useful. Describes a method for extracting word clusters from the raw document features. Results show that the clustering technique is successful in discovering word groups in personal Web pages which can be used to find similar information on the WWW
    Date
    1. 8.1996 22:08:06
  3. Cheng, K.-H.: Automatic identification for topics of electronic documents (1997) 0.00
    4.880411E-4 = product of:
      0.007808658 = sum of:
        0.007808658 = weight(_text_:in in 1811) [ClassicSimilarity], result of:
          0.007808658 = score(doc=1811,freq=8.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.21040362 = fieldWeight in 1811, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1811)
      0.0625 = coord(1/16)
    
    Abstract
    With the rapid rise in numbers of electronic documents on the Internet, how to effectively assign topics to documents become an important issue. Current research in this area focuses on the behaviour of nouns in documents. Proposes, however, that nouns and verbs together contribute to the process of topic identification. Constructs a mathematical model taking into account the following factors: word importance, word frequency, word co-occurence, and word distance. Preliminary experiments ahow that the performance of the proposed model is equivalent to that of a human being
    Footnote
    [In Chinesisch]
  4. Hirawa, M.: Role of keywords in the network searching era (1998) 0.00
    3.943968E-4 = product of:
      0.006310349 = sum of:
        0.006310349 = weight(_text_:in in 3446) [ClassicSimilarity], result of:
          0.006310349 = score(doc=3446,freq=4.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.17003182 = fieldWeight in 3446, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.0625 = fieldNorm(doc=3446)
      0.0625 = coord(1/16)
    
    Footnote
    [In Japanisch]
  5. Pfeifer, U.; Fuhr, N.; Huynh, T.: Searching structured documents with the enhanced retrieval functionality of freeWAIS-sf and SFgate (1995) 0.00
    3.450972E-4 = product of:
      0.0055215554 = sum of:
        0.0055215554 = weight(_text_:in in 2214) [ClassicSimilarity], result of:
          0.0055215554 = score(doc=2214,freq=4.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.14877784 = fieldWeight in 2214, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2214)
      0.0625 = coord(1/16)
    
    Abstract
    The original WAIS implementation by Thinking Machines and others treats documents as uniform bags of terms. Since most documents exhibit some internal structure, it is desirable to provide the user means to exploit this structure in his queries. Presents extensions to the freeWAIS indexer and server, which allows access to document structures using the original WAIS protocol. Major extensions include: arbitrary document formats, search in individual structure elements, stemming and phonetic search, support of 8-bit character sets, numeric concepts and operators. combination of Boolean and linear retrieval. Presents a WWW-WAIS gateway specially tailored for usage with freeWAIS-sf which transforms filled out HTML forms to the new query syntax
  6. MacDougall, S.: Rethinking indexing : the impact of the Internet (1996) 0.00
    2.0916048E-4 = product of:
      0.0033465677 = sum of:
        0.0033465677 = weight(_text_:in in 704) [ClassicSimilarity], result of:
          0.0033465677 = score(doc=704,freq=2.0), product of:
            0.037112754 = queryWeight, product of:
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.027283683 = queryNorm
            0.09017298 = fieldWeight in 704, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.3602545 = idf(docFreq=30841, maxDocs=44218)
              0.046875 = fieldNorm(doc=704)
      0.0625 = coord(1/16)
    
    Abstract
    Considers the challenge to professional indexers posed by the Internet. Indexing and searching on the Internet appears to have a retrograde step, as well developed and efficient information retrieval techniques have been replaced by cruder techniques, involving automatic keyword indexing and frequency ranking, leading to large retrieval sets and low precision. This is made worse by the apparent acceptance of this poor perfromance by Internet users and the feeling, on the part of indexers, that they are being bypassed by the producers of these hyperlinked menus and search engines. Key issues are: how far 'human' indexing will still be required in the Internet environment; how indexing techniques will have to change to stay relevant; and the future role of indexers. The challenge facing indexers is to adapt their skills to suit the online environment and to convince publishers of the need for efficient indexes on the Internet