This is a t-SNE representation of an array of (random) circles : red, green, blue, opacity and radius are 5 independent dimensions.
A force is created that tries to:
follow the positions given by t-SNE
collide the centers.
The result is displayed with an Urquhart graph.
On the left: the Urquhart graph eliminates links that have the longest projected distances;
On the right: using the original distances. (This algorithm doesn’t connect dots just because they’re projected together.)
I find it interesting that sites that are far apart (on the edge of the graph) are closer in the original space than it seems on the projected space. Also, closely related colours in the center are more connected.
Forked from t-SNE, a force, and voronoi.