Hub
Pricing About
NodeNode / Manipulator

t-SNE (L. Jonsson)

KNIME LabsStatistics
Drag & drop
Like

t-SNE is a manifold learning technique, which learns low dimensional embeddings for high dimensional data. It is most often used for visualization purposes because it exploits the local relationships between datapoints and can subsequently capture nonlinear structures in the data. Unlike other dimension reduction techniques like PCA, a learned t-SNE model can't be applied to new data. The t-SNE algorithm can be roughly summarized as two steps:

  1. Create a probability distribution capturing the relationships between points in the high dimensional space
  2. Find a low dimensional space that resembles the probability dimension as well as possible
For further details check out this blog post or the original paper . The implementation of this node is based on T-SNE-Java by Leif Jonsson.

Disclaimer:

Depending on the size of the input table, the computation of t-SNE can be very expensive both in terms of runtime as well as memory. If you experience problems with memory, try to reduce the size of your data by e.g. using the Row Sampling node. If you have very high-dimensional data, it is also advisable to first reduce the number of dimensions to around 50 using e.g. a PCA.

Node details

Input ports
  1. Type: Table
    Data
    Input port for the data for which a low dimensional embedding should be learned
Output ports
  1. Type: Table
    Embedded Data
    The low dimensional embedding

Extension

The t-SNE (L. Jonsson) node is part of this extension:

  1. Go to item

Related workflows & nodes

  1. Go to item
  2. Go to item
  3. Go to item

KNIME
Open for Innovation

KNIME AG
Talacker 50
8001 Zurich, Switzerland
  • Software
  • Getting started
  • Documentation
  • Courses + Certification
  • Solutions
  • KNIME Hub
  • KNIME Forum
  • Blog
  • Events
  • Partner
  • Developers
  • KNIME Home
  • Careers
  • Contact us
Download KNIME Analytics Platform Read more about KNIME Business Hub
© 2025 KNIME AG. All rights reserved.
  • Trademarks
  • Imprint
  • Privacy
  • Terms & Conditions
  • Data Processing Agreement
  • Credits