Fischer, I. and Zell, A. (2000), "String averages and self-organizing maps for strings," in Proc. 2nd ICSC Symposium on Neural Computation, pp. 208--215.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....which a distance measure is defined. Based on distance measures for strings and relying on the above mentioned properties of mean and median, neural networks for strings have been defined. Self organizing map and learning vector quantization have been defined both in the batch [11] and on line [12] form. As is often the case, the on line version has been shown to be significantly faster than the batch form. Finding the mean or the median of a set of strings is not quite easy. The first algorithms [13] performed an extensive search through many artificially generated strings in order to ....

....than the batch form. Finding the mean or the median of a set of strings is not quite easy. The first algorithms [13] performed an extensive search through many artificially generated strings in order to find the one with the smallest sum of (squared) distances. A later and much faster algorithm [12] used a by product of computing the distance the edit transcript for finding the prototype string. The edit transcript is a list of operations needed to transform one string into another. It is not actually needed for computing the distance, but it can be directly deduced by backtracing ....

Fischer, I., Zell, A.: String averages and self-organizing maps for strings. In Bothe, H., Rojas, R., eds.: Proceedings of the Neural Computation 2000, Canada / Switzerland, ICSC Academic Press (2000) 208--215

No context found.

Fischer, I. and Zell, A. (2000), "String averages and self-organizing maps for strings," in Proc. 2nd ICSC Symposium on Neural Computation, pp. 208--215.

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