Forbidden magnification? II
نویسندگان
چکیده
The twin of this paper, “Forbidden Magnification? I.” [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann [2] on data for which the theory does not guarantee success, namely data that are n-D, n > 2 and/or data whose components in the different dimensions are not statistically independent. For the unsupported n = 2 cases that we investigated the simulations show that even though the magnification exponent αachieved achieved by magnification control is not the same as the intended αintended, the direction and sign of αachieved systematically follows αintended with a more or less constant offset. We experimentally showed that for simple synthetic higher dimensional data negative magnification has the desired effect of improving the detectability of rare classes. In this paper we study further theoretically unsupported cases, including experiments with real data. 1 Known limits of SOM magnification control Controlling the magnification of Self-Organizing Neural Maps (i.e. the functional relationship between the pdf of the input data and the density of the SOM weights in the input space) is an extremely attractive possibility because various values of the magnification exponent, denoted by α in this paper, effect desirable quantization properties. For example, α = 1 realizes maximum entropy quantizaton, α = 1/3 and α = 1/2 force minimum distortion quantization for 1and 2-D data, respectively. As is known, the basic Kohonen SOM’s inherent property is a map magnification of α = 2/3. The twin of this paper, [1], and references therein give more details on magnification. The algorithm by Bauer, Der, and Herrmann [2] (referred to as BDH from now on) provided a principled approach to obtaining a desired magnification exponent for 1-D data and for 2-D data whose components are statistically independent. Most real data, of course, do not obey the above conditions, yet it is real data scenarios that would benefit the most from explicit magnification control. After careful verification of known magnification properties on “allowed” data we examined Request color reprint by email. ∗Authors are partially supported by the Applied Information Systems Research Program of NASA, Office of Space Science, NAG9-10432. ESANN'2004 proceedings European Symposium on Artificial Neural Networks Bruges (Belgium), 28-30 April 2004, d-side publi., ISBN 2-930307-04-8, pp. 57-62
منابع مشابه
Forbidden Magnification? I
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control in SOMs refers to the modification of the relationship between the probability density functions of the input samples and their prototypes (SOM weights). The above mentioned algorithm enables explicit control of the m...
متن کاملExplicit Magnification Control of Self-Organizing Maps for "Forbidden" Data
In this paper, we examine the scope of validity of the explicit self-organizing map (SOM) magnification control scheme of Bauer et al. (1996) on data for which the theory does not guarantee success, namely data that are n-dimensional, n > or =2, and whose components in the different dimensions are not statistically independent. The Bauer et al. algorithm is very attractive for the possibility o...
متن کاملThe FERRUM project: Transition probabilities for forbidden lines in [Fe ii] and experimental metastable lifetimes
Context. Accurate transition probabilities for forbidden lines are important diagnostic parameters for low-density astrophysical plasmas. In this paper we present experimental atomic data for forbidden [Fe ii] transitions that are observed as strong features in astrophysical spectra. Aims. To measure lifetimes for the 3d(G)4s a 4G11/2 and 3d (D)4s b 4D1/2 metastable levels in Fe ii and experime...
متن کاملForbidden Directed Minors and Directed Pathwidth
Undirected graphs of pathwidth at most one are characterized by two forbidden minors i.e., (i) K3 the complete graph on three vertices and (ii) S2,2,2 the spider graph with three legs of length two each [BFKL87]. Directed pathwidth is a natural generalization of pathwidth to digraphs. In this paper, we prove that digraphs of directed pathwidth at most one are characterized by a finite number of...
متن کاملApplications of SOM magnification to data mining
Magnification in Self-Organizing Maps refers to the functional relationship between the density of the SOM weights in input space, and the density of the input space. The explicit magnification control scheme proposed by Bauer, Der and Herrmann [1] in 1996 opened the possibility to achieve specific magnifications that have attractive properties for data mining. However, the theoretical support ...
متن کامل