I am trying to understand the time complexity of a standard SOM algorithm. Given D dimensional Input, a total of N inputs, over a set of E epochs and for an M*M sized map, what would be the complexity?
I am confused about the discussion https://stats.stackexchange.com/questions/147313/what-is-the-computational-complexity-of-the-som-algorithm.
Thanks in advance!