This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Robotics Mid‑importance This article is within the scope of WikiProject Robotics, a collaborative effort to improve the coverage of Robotics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.RoboticsWikipedia:WikiProject RoboticsTemplate:WikiProject RoboticsRobotics Mid This article has been rated as Mid-importance on the project's importance scale.

The following appears to contradict what is said in Self-organizing map about topology preservation."A key difference between the GTM and the SOM is that the nodes in the SOM can wander around at will; GTM nodes are constrained by the allowable transformations and the probabilities on those transformations. If the deformations are well-behaved the topology of the latent space is preserved.."

Exactly which passage in SOM do you think contradicts the cited one?

In the SOM the best-matching unit (BMU) is determined in each step/iteration. Consequently it can wander around in the sequence of learning iterations.

Citation from Self-organizing map:

'When a training example is fed to the network, its Euclidean distance to all weight vectors is computed. The neuron with weight vector most similar to the input is called the best matching unit (BMU).' —Preceding unsigned comment added by 134.245.67.180 (talk) 14:45, 11 August 2008 (UTC)Reply

I think that the comparison with SOM is a bit biased. Cited advantages are:

1-it explicitly formulates a density model over the data.

  Does this really constitutes an advantage? Why?

2-it uses a cost function that quantifies how well the map is trained.

  SOM also has its ways to quantify errors, namely the quantization error and the topographical error.

3-it uses a sound optimization procedure (EM algorithm).

  This may be the main (or the only one?) advantage of GTM over SOM. (EPleite (talk) 20:13, 1 November 2010 (UTC))Reply

(seconded - the strict density model may be an advantage in some situations, but an entire class of non-parametric models exists bc some situations are benefitted by a less constrained approach) — Preceding unsigned comment added by 198.233.238.206 (talk) 15:38, 10 November 2015 (UTC)Reply

Hello fellow Wikipedians,

I have just modified one external link on Generative topographic map. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20090204021348/http://www.ncrg.aston.ac.uk/GTM/ to http://www.ncrg.aston.ac.uk/GTM/

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 16:59, 12 October 2017 (UTC)Reply