[wiki.ifcsoft] push by - classic SOM is "Incremental" SOM on 2011-09-26 01:42 GMT
ifc...@googlecode.com
Author: kyle....@gmail.com
Date: Sun Sep 25 18:42:04 2011
Log: classic SOM is "Incremental" SOM
http://code.google.com/p/ifcsoft/source/detail?r=56aacc09f70f&repo=wiki
Modified:
/SOMAlgorithm.wiki
=======================================
--- /SOMAlgorithm.wiki Thu Feb 24 13:37:22 2011
+++ /SOMAlgorithm.wiki Sun Sep 25 18:42:04 2011
@@ -45,7 +45,7 @@
For a given vector of weights (eg. a data point with its values in each
dimension), the Best Matching Unit (BMU) is the node in the Self-Organizing
Map that is most similar to the input vector. The measure used for
similarity in IFCSoft is [http://mathworld.wolfram.com/Distance.html
Euclidean Distance]. The function _findBMU_ takes a vector as an input and
searches the nodes one by one, finding the node that has the smallest
Euclidean distance to the input vector.
-=== Classic SOM ===
+=== Classic (Incremental) SOM ===
The _calculateSOM_ function in
[http://code.google.com/p/ifcsoft/source/browse/src/ifcSoft/model/som/SOMCalcFns.java
SOMCalcFns.java].
In the classic SOM, the organization is achieved through a large number of
iterations, each with a single data point.