The block diagonal infinite hidden Markov model

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 552-559

  Stepleton, Thomas ^a   Ghahramani, Zoubin ^a,b   Gordon, Geoffrey ^a   Lee, Tai Sing ^a  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL DATA; BLOCK DIAGONAL; CLASSIFICATION TASKS; DATA SEQUENCES; GRAPH SEGMENTATION; HIDDEN STATE; INFINITE HIDDEN MARKOV MODEL (IHMM); INFINITE NUMBERS; SEQUENCE DATA;

HIDDEN MARKOV MODELS;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. Antoniak, C. (1974). Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems. Ann. Statist., 2, 1152-1174.
2. Beal, M., Ghahramani, Z., & Rasmussen, C. (2002). The infinite hidden Markov model. NIPS 14.
3. Childers, D., Skinner, D., & Kemerait, R. (1977). The cepstrum: A guide to processing. Proceedings of the IEEE, 65, 1428-1443.
4. Collective Soul (1993). "Shine". Hints Allegations and Things Left Unsaid. CD. Atlantic.
5. Edwards, R., & Sokal, A. (1988). Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Physical Review D, 38, 2009.
6. Escobar, M., & West, M. (1995). Bayesian density estima- tion and inference using mixtures. J. Amer. Stat. Assoc., 90, 577-588.
7. Fox, E., Sudderth, E., Jordan, M., & Willsky, A. (2008). An HDP-HMM for systems with state persistence. Pro- ceedings of the 25th International Conference on Machine Learning.
8. Fox, E., Sudderth, E., & Willsky, A. (2007). Hierarchical Dirichlet processes for tracking maneuvering targets. Proceedings of the 2007 International Conference on Information Fusion.
9. Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193-218.
10. Ishwaran, H., & James, L. (2002). Approximate Dirichlet process computing in finite normal mixtures: Smoothing and prior information. Journal of Computational and Graphical Statistics, 11, 508-532.
11. Liu, J., Liang, F., & Wong, W. (2000). The multiple-try method and local optimization in Metropolis sampling. J. Amer. Stat. Assoc., 96, 561-573.
12. Ni, K., & Dunson, D. (2007). Multi-task learning for sequential data via iHMMs and the nested Dirichlet process. Proceedings of the 24th International Conference on Machine Learning.
13. Pekergin, N., Dayar, T., & Alparslan, D. (2005). Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. European Journal of Operational Research, 165, 810-825.
14. Rasmussen, C. (2000). The infinite Gaussian mixture model. NIPS 12.
15. Sethuraman, J. (1994). A constructive definition of Dirichlet priors. Statistica Sinica, 4, 639-650.
16. Teh, Y., Jordan, M., Beal, M., & Blei, D. (2006). Hierarchical Dirichlet processes. J. Amer. Stat. Assoc., 101, 1566-1581.
17. United States Census Bureau (2000). MCD/county- to-MCD/county worker ow files. Online, http://www.census.gov/population/www/cen2000/commuting/ mcdworkerflow.html. Retrieved 26 September 2008.