Robust learning of inhomogeneous PMMs

Journal of Machine Learning Research

Volumn 33, Issue , 2014, Pages 229-237

  Eggeling, Ralf ^a   Roos, Teemu ^b   Myllymäki, Petri ^b   Grosse, Ivo ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; MARKOV PROCESSES;

BAYESIAN APPROACHES; CROSS VALIDATION; DNA SEQUENCE ANALYSIS; HYPER-PARAMETER; PARAMETER LEARNING; PRIOR DISTRIBUTION; ROBUST LEARNING; SYMBOLIC SEQUENCE;

DNA SEQUENCES;

EID: 84946570338     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. P.-Y. Bourguignon and D. Robelin. Modèles de Markov parcimonieux. In Proceedings of JOBIM, 2004.
2. W. Buntine. Theory refinement on Bayesian networks. In Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence, pages 52-60. Morgan Kaufmann, 1991.
3. R. Eggeling, A. Gohr, P.-Y. Bourguignon, E. Wingender, and I. Grosse. Inhomogeneous parsimonious Markov models. In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2013, Volume 1, pages 321-336. Springer, 2013.
4. J. Grau, J. Keilwagen, A. Gohr, B. Haldemann, S. Posch, and I. Grosse. Jstacs: A Java framework for statistical analysis and classification of biological sequences. Journal of Machine Learning Research, 13:1967-1971, 2012.
5. P. Grünwald. The Minimum Description Length Principle. MIT Press, June 2007.
6. G. Heckerman, D. Geiger, and D. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20:197-243, 1995.
7. E. Jaynes. Probability Theory: The Logic of Science. Cambridge University Press, 2003.
8. P. Kontkanen and P. Myllymäki. A linear-time algorithm for computing the multinomial stochastic complexity. Information Processing Letters, 103(6): 227-233, September 2007.
9. P. Kontkanen, W. Buntine, P. Myllymäki, J. Rissanen, and H. Tirri. Efficient computation of stochastic complexity. In Proceedings of the Ninth International Conference on Artificial Intelligence and Statistics, 2003.
10. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
11. J. Rissanen. A universal data compression system. IEEE Trans. Inform. Theory, 29(5):656-664, 1983.
12. A. Sandelin, W. Alkema, P. Engström, W. Wasserman, and B. Lenhard. JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research, 32:D91-D94, 2004.
13. G. E. Schwarz. Estimating the dimension of a model. Annals of Statistics, 2:461-464, 1978.
14. Y. Shtarkov. Universal sequential coding of single messages. Problems of Information Transmission, 23: 3-17, 1987.
15. T. Silander, P. Kontkanen, and P. Myllymäki. On sensitivity of the MAP Bayesian network structure to the equivalent sample size parameter. In Proceedings of the The 23rd Conference on Uncertainty in Artificial Intelligence (UAI-2007), pages 360-367, 2007.
16. T. Silander, T. Roos, P. Kontkanen, and P. Myllymäki. Factorized NML criterion for learning Bayesian network structures. In Proceedings of the 4th European Workshop on Probabilistic Graphical Models (PGM-08), 2008.
17. T. Silander, T. Roos, and P. Myllymäki. Locally minimax optimal predictive modeling with Bayesian networks. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, pages 504-511, 2009.
18. T. Silander, T. Roos, and P. Myllymäki. Learning locally minimax optimal Bayesian networks. International Journal of Approximate Reasoning, 51:544-557, 2010.
19. G. Yeo and C. Burge. Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals. Journal of Computational Biology, 11(2/3):377-394, 2004.