Abstract
Protein fold recognition is the problem of determining whether a given protein sequence folds into a previously observed structure. An uncertainty complication is that it is not always true that the structure has been previously observed. Markov logic networks (MLNs) are a powerful representation that combines first-order logic and probability by attaching weights to first-order formulas and using these as templates for features of Markov networks. In this chapter, we describe a simple temporal extension of MLNs that is able to deal with sequences of logical atoms. We also propose iterated robust tabu search (IRoTS) for maximum a posteriori (MAP) inference and Markov Chain-IRoTS (MC-IRoTS) for conditional inference in the new framework. We show how MC-IRoTS can also be used for discriminative weight learning. We describe how sequences of protein secondary structure can be modeled through the proposed language and show through some preliminary experiments the promise of our approach for the problem of protein fold recognition from these sequences.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Besag, J. Statistical Analysis of Non-lattice Data. Statistician, 24:179–195, 1975
Biba, M., Ferilli, S., and Esposito, F. Structure Learning of Markov Logic Networks through Iterated Local Search. In Proc. 18th European Conference on Artificial Intelligence, 2008
Biba, M., Ferilli, S., and Esposito, F. Discriminative Structure Learning of Markov Logic Networks. In Proceedings of 18th International Conference on Inductive Logic Programming (ILP 2008), LNCS 5194, pp. 59–76. Berlin: Springer, 2008
Collins, M. Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms. In Proc. of the 2002 Conference on Empirical Methods in Natural Language Processing, pp. 1–8. Philadelphia, PA: ACL, 2002
Della Pietra, S., Pietra, V. D., and Laferty, J. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19:380–392, 1997
Dick, U. and Kersting, K. Fisher Kernels for Relational Data. In J. Fuernkranz, T. Scheffer, M. Spiliopoulou, editors, Proc. 17th ECML, pp. 114–125, 2006
Dietterich, T., Ashenfelter, A., and Bulatov, Y. Training conditional random fields via gradient tree boosting. ICML 2004
Genesereth, M. R. and Nilsson, N. J. Logical foundations of artificial intelligence. San Mateo, CA: Morgan Kaufmann, 1987
Getoor, L. and Taskar, B. Introduction to statistical relational learning. MA: MIT, 2007
Gutmann, B. and Kersting, K. TildeCRF: Conditional Random Fields for Logical Sequences. In J. Fuernkranz, T. Scheffer, M. Spiliopoulou, editors, Proc. of the 17th ECML, pp. 174–185, 2006
Hoos, H. H. and Stutzle, T. Stochastic local search: Foundations and applications. San Francisco: Morgan Kaufmann, 2005
Laferty, J., McCallum, A., and Pereira, F. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Proc. 18th Int’l Conf. on Machine Learning, pp. 282–289, 2001
Loureno, H. R., Martin, O., and Stutzle, T. Iterated local search. In Handbook of metaheuristics, pp. 321–353. Dordrecht: Kluwer, 2002
Mihalkova, L. and Mooney, R. J. Bottom-Up Learning of Markov Logic Network Structure. In Proc. 24th Int’l Conf. on Machine Learning, pp. 625–632, 2007
Lowd, D. and Domingos, P. Efficient Weight Learning for Markov Logic Networks. In Proc. of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 200–211, 2007
Kersting, K., De Raedt, L., and Raiko, T. Logial Hidden Markov Models. Journal of Artificial Intelligence Research (JAIR), 25:425–456, 2006
Kok, S. and Domingos, P. Learning the Structure of Markov Logic Networks. In Proc. 22nd Int’l Conf. on Machine Learning, pp. 441–448, 2005
Kok, S., Singla, P., Richardson, M., and Domingos, P. The alchemy system for statistical relational ai (Technical Report). Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2005. http://alchemy.cs.washington.edu/
Manna Z. and Pnueli, A. The temporal logic of reactive and concurrent systems. Berlin: Springer, 1992
Moller, M. A scaled conjugate gradient algorithm for fast supervised learning. NeuralNetworks, 6:525–533, 1993
Poon, H. and Domingos, P. Sound and Efficient Inference with Probabilistic and Deterministic Dependencies. In Proc. 21st Nat’l Conf. on Artificial Intelligence, pp. 458–463. Chicago, IL: AAAI Press, 2006
Poon, H., Domingos, P., and Sumner, M. A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC. In Proc. 23rd Nat’l Conf. on Artificial Intelligence. Chicago, IL: AAAI Press, 2008
Richardson, M. and Domingos, P. Markov logic networks. Machine Learning, 62:107–236, 2006
Selman, B., Kautz, H., and Cohen, B. Local search strategies for satisfiability testing. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, American Mathematical Society, pp. 521–532, 1996
Singla, P. and Domingos, P. Discriminative Training of Markov Logic Networks. In Proc. 20th Nat’l Conf. on Artificial Intelligence, pp. 868–873. Chicago, IL: AAAI Press, 2005
Smyth, K., Hoos, H., and Stutzle, T. Iterated Robust Tabu Search for MAX-SAT. Canadian Conference on AI, pp. 129–144, 2003
Taillard, E. D. Robust taboo search for the quadratic assignment problem. Parallel Computing, 17:443–455, 1991
Wei, W., Erenrich, J., and Selman, B. Towards Efficient Sampling: Exploiting Random Walk Strategies. National Conference on Artificial Intelligence, AAAI Press, 2004
Roth, D. On the hardness of approximate reasoning. Artificial Intelligence, 82:273–302, 1996
Liu, D. C. and Nocedal, J. On the limited memory BFGS method for large scale optimization, Mathematical Programming, 45:503–528, 1989
M. Moller. A scaled conjugate gradient algorithm for fast supervised learning. NeuralNetworks, 6:525–533, 1993
Acknowledgements
This work was partially funded by project DM19410 – Laboratorio di Bioinformatica per la Biodiversità Molecolare. We thank Kristian Kersting for providing us the dataset on protein sequences.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer New York
About this chapter
Cite this chapter
Biba, M., Ferilli, S., Esposito, F. (2011). Protein Fold Recognition Using Markov Logic Networks. In: Bruni, R. (eds) Mathematical Approaches to Polymer Sequence Analysis and Related Problems. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-6800-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6800-5_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-6799-2
Online ISBN: 978-1-4419-6800-5
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)