That's interesting and I will read up on it as I get time.



It is an interesting problem isn't it?



What I might try is having each LatinRoot object visit each other one and by some heuristic, have them determine if they are "close" to each other.



For giggles, I can randomly assign an integer weight to each one, and if the absolute value of their difference is within X, then they are close.



That in itself is an interesting problem in itself. How to efficiently (or not)  have 800 objects visit the other 799 objects.

How to store the set of "other close objects" in an object.


Then, as other heuristics of "close" are developed, I can re-use that 




Thanks for your reply!


---- On Fri, 03 Apr 2020 17:12:31 -0400 Stéphane Rollandin <lecteur at zogotounga.net> wrote ----


Just a wild guess: self-organizing maps?

https://en.wikipedia.org/wiki/Self-organizing_map

Stef
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.squeakfoundation.org/pipermail/squeak-dev/attachments/20200403/48c7f241/attachment.html>