Search (4 results, page 1 of 1)

0.03567564 = product of:
  0.07135128 = sum of:
    0.07135128 = product of:
      0.14270256 = sum of:
        0.14270256 = weight(_text_:t in 3887) [ClassicSimilarity], result of:
          0.14270256 = score(doc=3887,freq=8.0), product of:
            0.20491594 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.05201693 = 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.

0.034900755 = product of:
  0.06980151 = sum of:
    0.06980151 = product of:
      0.13960302 = sum of:
        0.13960302 = weight(_text_:t in 3886) [ClassicSimilarity], result of:
          0.13960302 = score(doc=3886,freq=10.0), product of:
            0.20491594 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.05201693 = 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.

0.02317201 = product of:
  0.04634402 = sum of:
    0.04634402 = product of:
      0.09268804 = sum of:
        0.09268804 = weight(_text_:t in 3884) [ClassicSimilarity], result of:
          0.09268804 = score(doc=3884,freq=6.0), product of:
            0.20491594 = queryWeight, product of:
              3.9394085 = idf(docFreq=2338, maxDocs=44218)
              0.05201693 = 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.

0.008958076 = product of:
  0.017916152 = sum of:
    0.017916152 = product of:
      0.07166461 = sum of:
        0.07166461 = weight(_text_:authors in 3704) [ClassicSimilarity], result of:
          0.07166461 = score(doc=3704,freq=2.0), product of:
            0.2371355 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05201693 = 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.