Skip to main content
100%

t-SNE with Levenshtein distances, colored by K-means (work in progress)

✓ Published0🌍 Public
PPhilippe Rivière
Last edited Dec 26, 2016
Created on Dec 23, 2016

This example visualizes 800 city names on a plane, positioned by t-SNE using a weighted Levenshtein distance that compares the first four letters of each name. The positions are colored by a K-means clustering algorithm into 18 groups, highlighting phonetic or orthographic similarities among city names. It uses d3.v4 with `d3.forceSimulation`, `d3.forceCollide`, and `d3.queue` to run t-SNE computations in a worker thread, with the result rendered as an SVG of circles and text. The code is based on the tsnejs library and demonstrates an ongoing work-in-progress, as indicated by the title.

AI-generated description

800 city names, grouped according to their first 4 letters:

  • Levenshtein-based distance

  • t-SNE

Original work by Philippe Rivière for Visionscarto.net. Comments and variants very welcome!

Forked from <a href='http://bl.ocks.org/Fil/b07d09162377827f1b3e266c43de6d2a'>tsne world</a>

forked from <a href='http://bl.ocks.org/Fil/'>Fil</a>'s block: <a href='http://bl.ocks.org/Fil/e1bee9aca287986cf41695adf530424d'>t-SNE with Levenshtein distances</a>

mit Licensed

Similar vizzes