Dealing with small data: On the generalization of context trees

32nd International Conference on Machine Learning, ICML 2015

Volumn 2, Issue , 2015, Pages 1245-1253

  Eggeling, Ralf ^a   Koivisto, Mikko ^b   Grosse, Ivo ^a,c  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

^c GERMAN CENTRE FOR INTEGRATIVE BIODIVERSITY RESEARCH IDIV HALLE JENA LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; EFFICIENCY; LEARNING SYSTEMS; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

CONDITIONAL PROBABILITY DISTRIBUTIONS; CONTEXT SPECIFIC INDEPENDENCE; EFFICIENT LEARNING; EMPIRICAL STUDIES; STATISTICAL EFFICIENCY; STRUCTURAL FLEXIBILITIES; STRUCTURE-LEARNING; TREE-DEPTH;

LEARNING ALGORITHMS;

EID: 84969832907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Akaike, H. A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19: 716-723,1974.
2. Bacardit, J., Stout, M., Hirst, J.D., Valencia, A., Smith, R.E., and Krasnogor, N. Automated alphabet reduction for protein datasets. BMC Bioinformatics, 10:6, 2009.
3. Begleiter, R., El-Yaniv, R., and Yona, G. On prediction using variable order Markov models. J. Artif. Intell. Res., 22:385-421,2004.
4. Ben-Gal, I., Shani, A., Gohr, A., Grau, J., Arviv, S., Shmilovici, A., Posch, S., and Grosse, I. Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics, 21:2657-2666, 2005.
5. Bourguignon, P.-Y. and Robelin, D. Modeles de Markov parcimonieux. In Proc. JOBIM, 2004.
6. Boutilier, C., Friedman, N., Goldszmidt, M., and Koller, D. Context-specific independence in Bayesian networks. In Proc. UAI, pp. 115-123, 1996.
7. Bryant, Randal E. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35:677-691, 1986.
8. Bühlmann, P. and Wyner, AJ. Variable length Markov chains. Annals of Statistics, 27:480-513, 1999.
9. Edmonds, J. Paths, trees, and flowers. Canad. J. Math., 17: 449-467,1965.
10. Eggeling, R., Gohr, A., Bourguignon, P.-Y., Wingender, E., and Grosse, I. Inhomogeneous parsimonious Markov models. In Proc. ECMLPKDD, volume 1, pp. 321-336. Springer, 2013.
11. Eggeling, R., Gohr, A., Keilwagen, J., Mohr, M., Posch, S., Smith, A.D., and Grosse, I. On the value of intra-motif dependencies of human insulator protein CTCF. PLoS ONE, 9:e85629,2014a.
12. Eggeling, R., Roos, T., Myllymaki, P., and Grosse, I. Robust learning of inhomogeneous PMMs. In Proc. AISTATS, volume 33 of JMLR: W&CP, pp. 229-237,2014b.
13. Grau, J., Keilwagen, J., Gohr, A., Haldemann, B., Posch, S., and Grosse, I. Jstacs: A Java framework for statistical analysis and classification of biological sequences. J. Mach. Learn. Res., 13:1967-1971, 2012.
14. Li, T., Fan, K., Wang, J., and Wang, W. Reduction of protein sequence complexity by residue grouping. Protein Engineering, 16:323-330, 2003.
15. Peterson, E.L., Kondev, J., Theriot, J.A., and Phillips, R. Reduced amino acid alphabets exhibit an improved sensitivity and selectivity in fold assignment. Bioinformatics, 25:1356-1362, 2009.
16. Quinlan, J. Ross. Induction of decision trees. Machine Learning, 1:81-106, 1986.
17. Rissanen, J. A universal data compression system. IEEE Trans. Inform. Theory, 29:656-664, 1983.
18. Rota, G.C. The number of partitions of a set. Amer. Math. Monthly, 71:498-504, 1964.
19. Sandelin, A., Alkema, W., Engström, P., Wasserman, W.W., and Lenhard, B. JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucleic Acids Research, 32:D91-D94, 2004.
20. Schwarz, G. E. Estimating the dimension of a model. Annals of Statistics, 2:461-464, 1978.
21. Seifert, M., Gohr, A., Strickert, M., and Grosse, I. Parsimonious higher-order hidden Markov models for improved array-CGH analysis with applications to Arabidopsis thaliana. PLoS Computational Biology, 8:el002286, 2012.
22. Silander, T., Roos, T., Kontkanen, P., and Myllymaki, P. Factorized NML criterion for learning Bayesian network structures. In Proc. PGM, pp. 257-264, 2008.
23. Silander, T., Roos, T., and Myllymaki, P. Locally minimax optimal predictive modeling with Bayesian networks. In Proc. AISTATS, volume 5 of JMLR: W&CP, pp. 504-511,2009.
24. The Uni Prot Consortium. Update on activities at the Universal Protein Resource (Uni Prot) in 2013. Nucleic Acids Research, 41:D43-D47, 2013.
25. Volf, P. and Willems, F. Context maximizing: Finding MDL decision trees. In Proc. 15th Symp. Inform. Theory Benelux, pp. 192-200, May 1994.
26. Wilcoxon, F. Individual comparisons by ranking methods. Biometrics Bulletin, 1(6):80-83, 1945.
27. Zhao, X., Huang, H., and Speed, T.P. Finding short DNA motifs using permuted Markov models. Journal of Computational Biology, 12:894-906, 2005.