R. Dybowski, T.D. Collins, and P.R. Weller. Visualiza- tion of binary string convergence by samtach mapping. In L.J. Fogel, P.J. Angeline, and T. Baeck, editors, Evolutionary Programming V, pages 377-383. MIT Press, 1996. http://kmi. open. ac. uk/people/trevor/publications/ EP96. ps. gz.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....with visualising the GA s sampling of the search space. Because a non ambiguous mapping is not possible beyond 2d problems, the early work concentrated on this [Nassersharif et al. 1994] Other studies used Principal Component Analysis [Harvey and Thompson, 1996] see figure 1. 7) Sammon Mapping [Dybowski et al. 1996] or other projection tech niques. They project the genotypic space onto a 2d or 3d space, and draw a scatterplot of all individuals, or those in the current generation. For some of the visualisations that are described in this thesis, I use techniques to cluster the individuals in a generation ....

R. Dybowski, T.D. Collins, and P.R. Weller. Visualiza- tion of binary string convergence by samtach mapping. In L.J. Fogel, P.J. Angeline, and T. Baeck, editors, Evolutionary Programming V, pages 377-383. MIT Press, 1996. http://kmi. open. ac. uk/people/trevor/publications/ EP96. ps. gz.

....in local optima, thus multiple runs using different initializations were performed. After comparing the results the best configuration was chosen. Several papers on the use of multidimensional scaling for the visualization of evolutionary algorithm have been published recently ( 1] [3] and [13] 3.2 VISUALIZATION EXAMPLES OF MULTIDIMENSIONAL SCALING This section presents visualization examples that use multidimensional scaling to map data to a low dimensional domain for visualization. visualization examples of individuals of a population, visualization examples of ....

Dybowski, R., Collins, T. D. and Weller, P. D.: Visualization of Binary String Convergence by Sammon Mapping. in Fogel, D. B.: Evolutionary Programming V, Proceedings of the Fifth Annual Conference on Evolutionary Programming. Cambridge, Massachusetts: MIT Press, 1996.

....evenly populated space (figure 2, left) to a set of solution indicating clusters (figure 2, right) Although this method does visualize the exploration of a search space, it is limited to problems of only two dimensions. Finally the most recent effort to visualize population data is that of Dybowski, Collins and Weller (1996). This uses Sammon Mapping (Sammon, 1969) to translate high dimensional binary chromosomes into two or three dimensional co ordinates suitable for showing on a scatter plot (see figure 3) The advantage of this technique is that it is not restricted to two dimensional problems. However, this ....

....00111 11011 01011 10011 00011 11101 01101 10101 00101 11001 01001 10001 00001 11110 01110 10110 00110 11010 01010 10010 00010 11100 01100 10100 00100 11000 01000 10000 00000 Figure 3. An example of Sammon Mapping used to map a five dimensional binary string into a two dimensional space (figure 3 Dybowski, Collins Weller, 1996). Sammon Mapping is founded on the high dimensional and low dimensional data sets maintaining equivalent Euclidean distances between the considered points in each space. A mapping is constructed by guessing an initial position for each point y pq (m) in the two dimensional space (i.e. random) and ....

[Article contains additional citation context not shown here]

Dybowski R, Collins TD, Weller PD (1996). Visualization of Binary String Convergence by Sammon mapping. In: Proceedings of the Fifth Annual Conference on Evolutionary Programming - EP'96, 1996, San Diego CA. In Press.

.... human computer interaction technology to facilitate the human understanding and effective use of computer software [19] The application of SV techniques to facilitate the design and application of EAs has been receiving growing attention during the last few years; 2] 12] 20] 16] 7] [9], 21] and [5] A widely recognized framework for understanding human memory, known as the Levels of processing framework, was proposed by Craik and Lockhart in 1972 [6] They suggested that the level or depth of processing of a stimulus has a substantial effect on its memorability, and that ....

R. Dybowski, T.D. Collins, and P.R. Weller. Visualization of binary string convergence by sammon mapping. In L.J. Fogel, P.J. Angeline, and T. Baeck, editors, , pages 377--383, San Diego, CA., 1996. MIT Press.

....being considered. Resulting Design: Complementary Views Perhaps this view along with some form of population chromosome view (i.e. a view of the population s sample points in the search space, see figure 9) could be used to gain a more complete representation of an algorithm s evolution (e.g. [6] , 3] The strength of the fitness rating versus generation graph may be it s ability to highlighting important points in a solution s evolution which the user could then take a closer look at using a population chromosome view. Figure 9 An example population chromosome view showing the ....

R. Dybowski, T. D. Collins, and P. R. Weller, "Visualization of Binary String Convergence by Sammon Mapping," presented at The Fifth Annual Conference on Evolutionary Programming - EP96, San Diego, CA., 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC