Search (3 results, page 1 of 1)

  • × theme_ss:"Visualisierung"
  • × theme_ss:"Data Mining"
  • × year_i:[2010 TO 2020}
  1. Wattenberg, M.; Viégas, F.; Johnson, I.: How to use t-SNE effectively (2016) 0.03 
    0.031122928 = product of:
  0.062245857 = sum of:
    0.062245857 = product of:
      0.124491714 = sum of:
        0.124491714 = weight(_text_:t in 3887) [ClassicSimilarity], result of:
          0.124491714 = score(doc=3887,freq=8.0), product of:
            0.17876579 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.04537884 = queryNorm
            0.69639564 = fieldWeight in 3887, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.0625 = fieldNorm(doc=3887)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Although extremely useful for visualizing high-dimensional data, t-SNE plots can sometimes be mysterious or misleading. By exploring how it behaves in simple cases, we can learn to use it more effectively. We'll walk through a series of simple examples to illustrate what t-SNE diagrams can and cannot show. The t-SNE technique really is useful-but only if you know how to interpret it.
  2. Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014) 0.03 
    0.03044693 = product of:
  0.06089386 = sum of:
    0.06089386 = product of:
      0.12178772 = sum of:
        0.12178772 = weight(_text_:t in 3886) [ClassicSimilarity], result of:
          0.12178772 = score(doc=3886,freq=10.0), product of:
            0.17876579 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.04537884 = queryNorm
            0.6812697 = fieldWeight in 3886, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              3.9394085 = idf(docFreq=2338, 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.
  3. Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012) 0.02 
    0.020214936 = product of:
  0.04042987 = sum of:
    0.04042987 = product of:
      0.08085974 = sum of:
        0.08085974 = weight(_text_:t in 3884) [ClassicSimilarity], result of:
          0.08085974 = score(doc=3884,freq=6.0), product of:
            0.17876579 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.04537884 = queryNorm
            0.45232224 = fieldWeight in 3884, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.046875 = fieldNorm(doc=3884)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Techniques for multidimensional scaling visualize objects as points in a low-dimensional metric map. As a result, the visualizations are subject to the fundamental limitations of metric spaces. These limitations prevent multidimensional scaling from faithfully representing non-metric similarity data such as word associations or event co-occurrences. In particular, multidimensional scaling cannot faithfully represent intransitive pairwise similarities in a visualization, and it cannot faithfully visualize "central" objects. In this paper, we present an extension of a recently proposed multidimensional scaling technique called t-SNE. The extension aims to address the problems of traditional multidimensional scaling techniques when these techniques are used to visualize non-metric similarities. The new technique, called multiple maps t-SNE, alleviates these problems by constructing a collection of maps that reveal complementary structure in the similarity data. We apply multiple maps t-SNE to a large data set of word association data and to a data set of NIPS co-authorships, demonstrating its ability to successfully visualize non-metric similarities.

Authors

Types