String taxonomy using learning automata

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 27, Issue 2, 1997, Pages 354-365

  Oommen, B John ^a   De St Croix, Edward V ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Dictionary partitioning; String clustering; String taxonomy; Syntactic pattern recognition

Indexed keywords

ALGORITHMS; IMAGE PROCESSING; LEARNING SYSTEMS; PATTERN RECOGNITION; SET THEORY;

DICTIONARY PARTITIONING; LEARNING AUTOMATA; OBJECT MIGRATING AUTOMATON; STRING CLUSTERING; STRING TAXONOMY PROBLEM; SYNTACTIC PATTERN RECOGNITION;

AUTOMATA THEORY;

EID: 0031117851     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.558849     Document Type: Article

References (46)

1. A. V. Aho, D. S. Hirschberg, and J. D. Ullman, "Bounds on the complexity of the longest common subsequence problem," J. Assoc. Comput. Mach., vol. 23, pp. 1-12, 1976.
2. R. L. Bahl and F. Jelinek, "Decoding with channels with insertions, deletions and substitutions with applications to speech recognition," IEEE Trans. Inform. Theory, vol. IT-21, pp. 404-411, 1975.
3. M. O. Dayhoff, Atlas of Protein Sequence and Structure. Washington, D.C.: National Biomedical Res. Found., 1971.
4. L. Devroye, Non-Uniform Random Variate Generation. Berlin: Springer-Verlag, 1986.
5. L. Devroye, W. Szpankowski, and B. Rais, "A note on the height of suffix trees," SIAM J. Comput., vol. 21, pp. 48-54, 1992.
6. G. Dewey, Relative Frequency of English Speech Sounds. Cambridge, MA: Harvard Univ. Press, 1923.
7. R. Dubes and A. K. Jain, "Validity studies in clustering methodologies," Pattern Recognit., vol. 8, pp. 235-254, 1976.
8. A. Ehrenfeucht, "Plenary lecture," in 3rd Int. Symp. Combinatorial Pattern Matching, Tucson, AZ, May 1992.
9. P. A. V. Hall and G. R. Dowling, "Approximate string matching," Comput. Surveys, vol. 12, pp. 381-402, 1980.
10. J. A. Hartigan, Clustering Algorithms. New York: Wiley, 1975.
11. D. S. Hirschberg, "Algorithms for longest common subsequence problem," J. Assoc. Comput. Mach., vol. 24, pp. 664-675, 1977.
12. J. W. Hunt and T. G. Szymanski, "A fast algorithm for computing longest common subsequences," Comm. Assoc. Comput. Mach., vol. 20, pp. 350-353, 1977.
13. P. Jacquet and W. Szpankowski, "Analysis of digital tries with markovian dependencies," IEEE Trans. Inform. Theory, vol. 37, pp. 1470-1475, 1991.
14. R. L. Kashyap and B. J. Oommen, "A common basis for similarity and dissimilarity measures involving two strings," Int. J. Comput. Math., vol. 13, pp. 17-40, 1983.
15. _, "Similarity measures for sets of strings," Int. J. Comput. Math., vol. 13, pp. 95-104, 1983.
16. _, "The noisy substring matching problem," IEEE Trans. Software Eng., vol. SE-9, pp. 365-370, 1983.
17. _, "An effective algorithm for string correction using generalized edit distances - I. Description of the algorithm and its optimality," Inf. Sci., vol. 23, no. 2, pp. 123-142, 1981.
18. _, "String correction using probabilistic methods," Pattern Recognit. Lett., pp. 147-154, 1984.
19. A. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Phys. Dokl., vol. 10, pp. 707-710, 1966.
20. S. H. Levine, "An adaptive approach to optimal keyboard design for nonvocal communication," in Proc. Int. Conf. Cybernetics and Society, 1985, pp. 334-337.
21. S. H. Levine, S. L. Minneman, C. O. Getschow, and C. Goodenough-Trepagnier, "Computer disambiguation of multi-character text entry: An adaptive design approach," in Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, 1986, pp. 298-301.
22. R. Lowrance and R. A. Wagner, "An extension of the string to string correction problem," J. Assoc. Comput. Mach., vol. 22, pp. 177-183, 1975.
23. D. Maier, "The complexity of some problems on subsequences and supersequences," J. Assoc. Comput. Mach., vol. 25, pp. 322-336, 1978.
24. W. J. Masek and M. S. Paterson, "A faster algorithm computing string edit distances," J. Comput. Syst. Sci., vol. 20, pp. 18-31, 1980.
25. S. L. Minneman, "A simplified Touch-Tone telecommunication aid for deaf and hearing impaired individuals," in Proc. 8th. RESNA Conf., Memphis, TN, 1985, pp. 209-211.
26. _, "Keyboard optimization technique to improve output rate of disabled individuals," in Proc. 9th. RESNA Conf., Minneapolis, MN, 1986, pp. 402-404.
27. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1989.
28. S. B. Needleman and C. D. Wunsch, "A general method applicable to the search for similarities in the amino acid sequence of two proteins," J. Mol. Biol., pp. 443-453, 1970.
29. D. L. Neuhoff, "The Viterbi algorithm as an aid in text recognition," IEEE Trans. Inform. Theory, pp. 222-226, 1975.
30. N. J. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
31. T. Okuda, E. Tanaka, and T. Kasai, "A method of correction of garbled words based on the Levenshtein metric," IEEE Trans. Comput., vol. C-25, pp. 172-177, 1976.
32. B. J. Oommen, "Recognition of noisy subsequences using constrained edit distances," IEEE Trans. Pattern Anal. Machine Intel., vol. 9, pp. 676-685, 1987.
33. B. J. Oommen and C. Fothergill, "Fast learning automaton-based image examination and retrieval," Comput. J., vol. 36, no. 6, pp. 542-553, 1993.
34. B. J. Oommen and R. L. Kashyap, "Symbolic channel modeling for noisy channels which permit arbitrary noise distributions," in Proc. 1993 Int. Symp. Computer and Information Sciences, Istanbul, Turkey, Nov. 1993, pp. 492-499.
35. B. J. Oommen and D. C. Y. Ma, "Deterministic learning automata solutions to the equipartitioning problem," IEEE Trans. Comput., vol. 37, no. 1, pp. 2-13, 1988.
36. _, "Stochastic automata solutions to the object partitioning problem," Comput. J., vol. 35, pp. A105-A120, 1992.
37. J. L. Peterson, "Computer programs for detecting and correcting spelling errors," Comm. Assoc. Comput. Mach., vol. 23, pp. 676-687, 1980.
38. M. Regnier, "A language approach to string searching evaluation," in Proc. 3rd Symp. Combinatorial Pattern Matching, 1992, pp. 15-26.
39. D. Sankoff and J. B. Kruskal, Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, MA: Addison-Wesley, 1983.
40. R. Shinghal and G. T. Toussaint, "Experiments in text recognition with the modified viterbi algorithm," IEEE Trans. Pattern Anal. Machine Intel., vol. 1, pp. 184-192, 1979.
41. S. Srihari, Computer Text Recognition and Error Correction. New York: IEEE Computer Society Press, 1984.
42. W. Szpankowski, "Probabilistic analysis of generalized suffix trees," in 3rd Symp. Combinatorial Pattern Matching, 1992, pp. 1-14.
43. M. L. Tsetlin, Automaton Theory and the Modeling of Biological Systems. New York: Academic, 1973.
44. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimal decoding algorithm," IEEE Trans. Inform. Theory, pp. 260-26, 1967.
45. R. A. Wagner and M. J. Fisher, "The string to string correction problem," J. Assoc. Comput. Mach., vol. 21, pp. 168-173, 1974.
46. C. T. Yu, M. D. Siu, D. Lam, and F. Tai, "Adaptive clustering schemes: General framework," in Proc. IEEE COMPSAC Conf., 1981, pp. 81-89.