title: Spherical self-organizing map using efficient indexed geodesic data structure.
abstract: The two-dimensional (2D) Self-Organizing Map (SOM) has a well-known "border effect". Several spherical SOMs which use lattices of the tessellated icosahedron have been proposed to solve this problem. However, existing data structures for such SOMs are either not space efficient or are time consuming when searching the neighborhood. We introduce a 2D rectangular grid data structure to store the icosahedron-based geodesic dome. Vertices relationships are maintained by their positions in the data structure rather than by immediate neighbor pointers or an adjacency list. Increasing the number of neurons can be done efficiently because the overhead caused by pointer updates is reduced. Experiments show that the spherical SOM using our data structure, called a GeoSOM, runs with comparable speed to the conventional 2D SOM. The GeoSOM also reduces data distortion due to removal of the boundaries. Furthermore, we developed an interface to project the GeoSOM onto the 2D plane using a cartographic approach, which gives users a global view of the spherical data map. Users can change the center of the 2D data map interactively. In the end, we compare the GeoSOM to the other spherical SOMs by space complexity and time complexity.
authors.affiliation: School of Information Technologies, The University of Sydney, Australia. chwu@it.usyd.edu.au
authors.forename: Yingxin
authors.initials: Y
authors.lastname: Wu
authors.forename: Masahiro
authors.initials: M
authors.lastname: Takatsuka
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D006801:Humans; D016247:Information Storage and Retrieval; D016571:Neural Networks, Computer; D012815:Signal Processing, Computer-Assisted