SOM Bound to Realize Euclidean and Relational Outputs
Impute values from prototype information
Create an empty grid
Initialize parameters for the SOM algorithm
Methods for 'myGrid' objects.
Plot a somRes class object
Predict the classification of a new observation
Compute the projection of a graph on a grid
Compute distances between prototypes
Compute SOM algorithm quality criteria
Self Organizing Maps Bound to Realize Euclidean and Relational Outputs
Graphical Web User Interface for SOMbrero
Plotting somRes results
Create super-clusters from SOM results
Run the SOM algorithm
The stochastic (also called on-line) version of the Self-Organising Map (SOM) algorithm is provided. Different versions of the algorithm are implemented, for numeric and relational data and for contingency tables as described, respectively, in Kohonen (2001) <isbn:3-540-67921-9>, Olteanu & Villa-Vialaneix (2005) <doi:10.1016/j.neucom.2013.11.047> and Cottrell et al (2004) <doi:10.1016/j.neunet.2004.07.010>. The package also contains many plotting features (to help the user interpret the results), can handle (and impute) missing values and is delivered with a graphical user interface based on 'shiny'.