Conversion to one dimension can be done with a one-dimensional self-organizing map, and hierarchical clustering can also be done with a little ingenuity.

pseudo code

  • Merging close data points
    • At this time, points with a rank of 2 are removed from the annexation target.

Changing the rank limit from 2 to N results in a tree with at most N-1 children.

Related chain-effect.


This page is auto-translated from /nishio/多次元からツリーへ using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.