Search (2 results, page 1 of 1)

0.073703736 = product of:
  0.1105556 = sum of:
    0.074017175 = weight(_text_:reference in 2564) [ClassicSimilarity], result of:
      0.074017175 = score(doc=2564,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = queryNorm
        0.35959643 = fieldWeight in 2564, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.0625 = fieldNorm(doc=2564)
    0.036538422 = product of:
      0.073076844 = sum of:
        0.073076844 = weight(_text_:database in 2564) [ClassicSimilarity], result of:
          0.073076844 = score(doc=2564,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.35730496 = fieldWeight in 2564, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.0625 = fieldNorm(doc=2564)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The classification of documents from a bibliographic database is a task that is linked to processes of information retrieval based on partial matching. A method is described of vectorizing reference documents from LISA which permits their topological organization using Kohonen's algorithm. As an example a map is generated of 202 documents from LISA, and an analysis is made of the possibilities of this type of neural network with respect to the development of information retrieval systems based on graphical browsing.

0.0131846685 = product of:
  0.039554004 = sum of:
    0.039554004 = product of:
      0.07910801 = sum of:
        0.07910801 = weight(_text_:database in 3335) [ClassicSimilarity], result of:
          0.07910801 = score(doc=3335,freq=6.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.38679397 = fieldWeight in 3335, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3335)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Using the Scopus dataset (1996-2007) a grand matrix of aggregated journal-journal citations was constructed. This matrix can be compared in terms of the network structures with the matrix contained in the Journal Citation Reports (JCR) of the Institute of Scientific Information (ISI). Because the Scopus database contains a larger number of journals and covers the humanities, one would expect richer maps. However, the matrix is in this case sparser than in the case of the ISI data. This is because of (a) the larger number of journals covered by Scopus and (b) the historical record of citations older than 10 years contained in the ISI database. When the data is highly structured, as in the case of large journals, the maps are comparable, although one may have to vary a threshold (because of the differences in densities). In the case of interdisciplinary journals and journals in the social sciences and humanities, the new database does not add a lot to what is possible with the ISI databases.