String Averages and Self-Organizing Maps for Strings (2000) [4 citations — 1 self]
Download:
|
|
by Igor Fischer, Andreas Zell
Proceedings of the Neural Computation 2000, Canada / Switzerland, ICSC
http://www-ra.informatik.uni-tuebingen.de/mitarb/zell/../../publikationen/2000/stringSOM.ps.gz
Add To MetaCart
Abstract:
In a recent paper, T. Kohonen and P. Somervuo have shown that selforganizing maps (SOMs) are not restricted to numerical data. They can also be defined for symbol strings, provided that one defines an average function for strings and that the adaptation process is performed off-line (batch). In this paper, we present two different methods for computing averages of strings, as well as an on-line version of the self-organizing map for strings. Both methods for computing averages are faster than the original one used by Kohonen and Somervuo, and one of them is suitable for on-line computation. Keywords---Self-organizing map; String average; String clustering.
Citations
| 996 | Self-Organization and Associated Memory – Kohonen - 1988 |
| 503 | Binary codes capable of correcting deletions, insertions and reversals – Levenshtein - 1966 |
| 230 | A nonlinear mapping for data structure analysis – Sammon - 1969 |
| 139 | Algorithms for Approximate String Matching – Ukkonen - 1985 |
| 130 | Introduction to Computational Molecular Biology – Setubal, Meidanis - 1997 |
| 119 | A faster algorithm for computing string edit distances – Masek, Paterson - 1980 |
| 95 | The string to string correction problem – Wagner, Fischer - 1974 |
| 72 | An improved algorithm for approximate string matching – Galil, Park - 1990 |
| 6 | Self-organizing maps of symbol strings, Neurocomputing 21 – Kohonen, Somervuo - 1998 |
| 3 | String Searching Algorithms – Stepen - 1994 |
| 1 | Statisticka teorija i primjena, Tehnicka knjiga – Pavlic - 1988 |
| 1 | Pattern Recognition Letters 3 – Kohonen, Strings - 1985 |
