Search (2 results, page 1 of 1)

  • × author_ss:"Maaten, L. van den"
  • × theme_ss:"Data Mining"
  • × year_i:[2010 TO 2020}
  1. Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012) 0.01 
    0.005125329 = product of:
  0.015375986 = sum of:
    0.015375986 = weight(_text_:in in 3884) [ClassicSimilarity], result of:
      0.015375986 = score(doc=3884,freq=12.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.22087781 = fieldWeight in 3884, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=3884)
  0.33333334 = coord(1/3)
    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.
  2. Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014) 0.00 
    0.0042281803 = product of:
  0.012684541 = sum of:
    0.012684541 = weight(_text_:in in 3886) [ClassicSimilarity], result of:
      0.012684541 = score(doc=3886,freq=6.0), product of:
        0.069613084 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.051176514 = queryNorm
        0.1822149 = fieldWeight in 3886, 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=3886)
  0.33333334 = coord(1/3)
    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.

Types