Search (2 results, page 1 of 1)

  • × theme_ss:"Data Mining"
  • × theme_ss:"Visualisierung"
  • × year_i:[2010 TO 2020}
  1. Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014) 0.02 
    0.018619968 = product of:
  0.037239935 = sum of:
    0.037239935 = product of:
      0.07447987 = sum of:
        0.07447987 = weight(_text_:n in 3886) [ClassicSimilarity], result of:
          0.07447987 = score(doc=3886,freq=2.0), product of:
            0.22335295 = queryWeight, product of:
              4.3116565 = idf(docFreq=1611, maxDocs=44218)
              0.05180212 = queryNorm
            0.33346266 = fieldWeight in 3886, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.3116565 = idf(docFreq=1611, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3886)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The paper investigates the acceleration of t-SNE-an embedding technique that is commonly used for the visualization of high-dimensional data in scatter plots-using two tree-based algorithms. In particular, the paper develops variants of the Barnes-Hut algorithm and of the dual-tree algorithm that approximate the gradient used for learning t-SNE embeddings in O(N*logN). Our experiments show that the resulting algorithms substantially accelerate t-SNE, and that they make it possible to learn embeddings of data sets with millions of objects. Somewhat counterintuitively, the Barnes-Hut variant of t-SNE appears to outperform the dual-tree variant.
  2. Leydesdorff, L.; Persson, O.: Mapping the geography of science : distribution patterns and networks of relations among cities and institutes (2010) 0.01 
    0.008921083 = product of:
  0.017842166 = sum of:
    0.017842166 = product of:
      0.071368665 = sum of:
        0.071368665 = weight(_text_:authors in 3704) [ClassicSimilarity], result of:
          0.071368665 = score(doc=3704,freq=2.0), product of:
            0.23615624 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05180212 = queryNorm
            0.30220953 = fieldWeight in 3704, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046875 = fieldNorm(doc=3704)
      0.25 = coord(1/4)
  0.5 = coord(1/2)
    Abstract
    Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices (Thomson Reuters) and Scopus (Elsevier), on the one hand, and these various visualization tools on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI databases and with Scopus. Pajek enables a combination of visualization and statistical analysis, whereas the Google Maps and its derivatives provide superior tools on the Internet.

Authors

Types