Search (3 results, page 1 of 1)

0.026496232 = product of:
  0.052992463 = sum of:
    0.052992463 = product of:
      0.15897739 = sum of:
        0.15897739 = weight(_text_:objects in 3884) [ClassicSimilarity], result of:
          0.15897739 = score(doc=3884,freq=4.0), product of:
            0.31904724 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.060026903 = queryNorm
            0.49828792 = fieldWeight in 3884, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.046875 = fieldNorm(doc=3884)
      0.33333334 = coord(1/3)
  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.

0.021858275 = product of:
  0.04371655 = sum of:
    0.04371655 = product of:
      0.13114965 = sum of:
        0.13114965 = weight(_text_:objects in 3886) [ClassicSimilarity], result of:
          0.13114965 = score(doc=3886,freq=2.0), product of:
            0.31904724 = queryWeight, product of:
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.060026903 = queryNorm
            0.41106653 = fieldWeight in 3886, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.315071 = idf(docFreq=590, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3886)
      0.33333334 = coord(1/3)
  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.

0.008132817 = product of:
  0.016265634 = sum of:
    0.016265634 = product of:
      0.03253127 = sum of:
        0.03253127 = weight(_text_:22 in 5234) [ClassicSimilarity], result of:
          0.03253127 = score(doc=5234,freq=2.0), product of:
            0.21020399 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.060026903 = queryNorm
            0.15476047 = fieldWeight in 5234, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=5234)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 1.2018 11:33:49