The Hierarchical Hidden Markov Model: Analysis and Applications
Machine Learning
Statistical Language Learning
Statistical Abduction with Tabulation
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The Art of Software Testing
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
| Hi-index | 0.00 |
Programs for gene prediction in computational biology are examples of systems for which the acquisition of authentic test data is difficult as these require years of extensive research. This has lead to test methods based on semiartificially produced test data, often produced by ad hoctechniques complemented by statistical models such as Hidden Markov Models (HMM). The quality of such a test method depends on how well the test data reflect the regularities in known data and how well they generalize these regularities. So far only very simplified and generalized, artificial data sets have been tested, and a more thorough statistical foundation is required.We propose to use logic-statistical modelling methods for machine-learning for analyzing existing and manually marked up data, integrated with the generation of new, artificial data. More specifically, we suggest to use the PRISM system developed by Sato and Kameya. Based on logic programming extended with random variables and parameter learning, PRISM appears as a powerful modelling environment, which subsumes HMMs and a wide range of other methods, all embedded in a declarative language. We illustrate these principles here, showing parts of a model under development for genetic sequences and indicate first initial experiments producing test data for evaluation of existing gene finders, exemplified by GENSCAN, HMMGene and genemark.hmm.