Sign in to follow this  

SOM optimization...

This topic is 4861 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I'm working with 2D torroidal or rectangular SOMs on the order of 50x50 and larger. Obviously, this creates 2500 comparisons in order to find the node with weights closest to a training example. Considering I have 400,000+ training examples, this becomes computationally demanding. Does anyone have any experience with optimizing this process? I've considered BSP trees, but I don't see a way to ensure that I'll find the closest node without searching all of them. -Kirk

Share this post


Link to post
Share on other sites

This topic is 4861 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this