Imposing tree-based topologies onto self organizing maps

详细信息    查看全文

• 作者：Cé ; sar A. Astudillo^a ; ¹ ; ^{castudillo@utalca.cl"" rel=""nofollow} ; B. John Oommen^b ; ² ; ^{oommen@scs.carleton.ca"" rel=""nofollow}
• 关键词：Hierarchical SOM ; Self organizing maps ; Kohonen maps ; Topology-based self-organization
• 刊名：Information Sciences
• 出版年：2011
• 出版时间：15 September 2011
• 年：2011
• 卷：181
• 期：18
• 页码：3798-3815
• 全文大小：2479 K

文摘

The beauty of the Kohonen map is that it has the property of organizing the codebook vectors, which represent the data points, both with respect to the underlying distribution and topologically. This topology is traditionally linear, even though the underlying lattice could be a grid, and this has been used in a variety of applications [23], [35] and [40]. The most prominent efforts to render the topology to be structured involves the Evolving Tree (ET) due to Pakkanen et al. [36], and the Self-Organizing Tree Maps (SOTM) due to Guan et al. [18], among others. In this paper we propose a strategy, the Tree-Based Topology-Oriented SOM (TTOSOM) by which we can impose an arbitrary, user-defined, tree-like topology onto the codebooks. Such an imposition enforces a neighborhood phenomenon which is based on the user-defined tree, and consequently renders the so-called bubble of activity to be drastically different from the ones defined in the prior literature. The map learned as a consequence of training with the TTOSOM is able to infer both the distribution of the data and its structured topology interpreted via the perspective of the user-defined tree. The TTOSOM also reveals multi-resolution capabilities, which are helpful for representing the original data set with different numbers of points, and this can be obtained without the necessity of recomputing the whole tree. The ability to extract an skeleton, which is a “stick-like” representation of the image in a lower dimensional space, is discussed as well. These properties has been confirmed by our experimental results on a variety of data sets.