Dynamic programming inference of Markov networks from finite sets of sample strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Step Towards Unification of Syntactic and Statistical Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
| Hi-index | 0.14 |
Markov networks are inferred automatically for different classes of learning strings. In subsequent string-to-network alignments for test samples, the networks are used to deduce structural characteristics and to provide similarity measures. By processing the similarity measures as numerical-value features, standard nonparametric decision-theoretic pattern classifiers may be applied to determine class membership. The nearest-neighbor rule and linear discriminant-function classifiers are discussed, and their performances are compared with that of a maximum-likelihood classifier. The hybrid system's ability to determine string orientation correctly is investigated. Experiments with several thousand human banded chromosomes are reported.