Recursive learning for sparse Markov models

Bayesian Analysis

Volumn 11, Issue 1, 2016, Pages 247-263

  Xiong, Jie ^a   Jääskinen, Väinö ^a   Corander, Jukka ^a,b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Clustering; Delaunay triangulation; Recursive learning; Sequence analysis; Sparse Markov chains

Indexed keywords

EID: 84964204528     PISSN: 19360975     EISSN: 19316690     Source Type: Journal    
DOI: 10.1214/15-BA949     Document Type: Article

References (18)

1. Begleiter, R., El-Yaniv, R., and Yona, G. (2004). "On prediction using variable order Markov models." Journal of Artificial Intelligence Research, 22: 385-421. MR2129473.
2. Bishop, C. M. (2007). Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, 1st edition. MR2247587. doi: http://dx.doi.org/10.1007/978-0-387-45528-0.
3. Bühlmann, P., Wyner, A. J., et al. (1999). "Variable length Markov chains." The Annals of Statistics, 27(2): 480-513. MR1714720. doi: http://dx.doi.org/10.1214/aos/1018031204.
4. Corander, J., Connor, T. R., O'Dwyer, C. A., Kroll, J. S., and Hanage, W. P. (2012). "Population structure in the Neisseria, and the biological significance of fuzzy species." Journal of The Royal Society Interface, 9(71): 1208-1215.
5. Dahl, D. B., et al. (2009). "Modal clustering in a class of product partition models." Bayesian Analysis, 4(2): 243-264. MR2507363. doi: http://dx.doi.org/10.1214/09-BA409.
6. De Berg, M., Van Kreveld, M., Overmars, M., and Schwarzkopf, O. C. (2000). Computational geometry. Springer. MR1763734. doi: http://dx.doi.org/10.1007/978-3-662-04245-8.
7. Deng, M., Liu, Q., Cheng, T., and Shi, Y. (2011). "An adaptive spatial clustering algorithm based on Delaunay triangulation." Computers, Environment and Urban Systems, 35(4): 320-332.
8. Farcomeni, A. (2011). "Hidden Markov partition models." Statistics & Probability Letters, 81(12): 1766-1770. MR2845887. doi: http://dx.doi.org/10.1016/j.spl.2011.07.012.
9. Gonzalez-Lopez, J. E., et al. (2010). "Minimal Markov Models." arXiv http://arxiv.org/abs/1002.0729:1002.0729
10. Hubert, L. and Arabie, P. (1985). "Comparing partitions." Journal of Classification, 2(1): 193-218.
11. Jääskinen, V., Xiong, J., Corander, J., and Koski, T. (2013). "Sparse Markov Chains for Sequence Data." Scandinavian Journal of Statistics.
12. Koski, T. (2001). Hidden Markov models for bioinformatics, volume 2. Springer. MR1888250. doi: http://dx.doi.org/10.1007/978-94-010-0612-5.
13. Lee, D.-T. and Schachter, B. J. (1980). "Two algorithms for constructing a Delaunay triangulation." International Journal of Computer & Information Sciences, 9(3): 219-242. MR0585950. doi: http://dx.doi.org/10.1007/BF00977785.
14. Liu, D., Nosovskiy, G. V., and Sourina, O. (2008). "Effective clustering and boundary detection algorithm based on Delaunay triangulation." Pattern Recognition Letters, 29(9): 1261-1273.
15. Marttinen, P., Myllykangas, S., and Corander, J. (2009). "Bayesian clustering and feature selection for cancer tissue samples." BMC Bioinformatics, 10(1): 90.
16. Rissanen, J., et al. (1983). "A universal data compression system." IEEE Transactions on Information Theory, 29(5): 656-664. MR0730903. doi: http://dx.doi.org/10.1109/TIT.1983.1056741.
17. Xiong, J., Jääskinen, V., and Corander, J. (2015). "Appendix of article by Xiong, Jääskinen, and Corander." Bayesian Analysis. doi: http://dx.doi.org/10.1214/15-BA949SUPP.
18. Yang, X. and Cui, W. (2008). "A novel spatial clustering algorithm based on Delaunay triangulation." In: International Conference on Earth Observation Data Processing and Analysis, 728530. International Society for Optics and Photonics.