A survey on latent tree models and applications

Journal of Artificial Intelligence Research

Volumn 47, Issue , 2013, Pages 157-203

  Mourad, Raphaël ^a   Sinoquet, Christine ^a   Zhang, Nevin L ^b   Liu, Tengfei ^b   Leray, Philippe ^a  

^a UNIVERSITÉ DE NANTES   (France)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONICS ENGINEERING;

COMPLEX RELATIONSHIPS; HUMAN SCIENCE; LATENT STRUCTURES; LATENT VARIABLE; MULTIDIMENSIONAL CLUSTERING; PROBABILISTIC GRAPHICAL MODELS; PROBABILISTIC INFERENCE; SIMPLE STRUCTURES;

ARTIFICIAL INTELLIGENCE;

EID: 84879912869     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3879     Document Type: Review

References (80)

1. Aggarwal, J., & Cai, Q. (1999). Human motion analysis: A review. Computer Vision and Image Understanding, 73(3), 428-440.
2. Akaike, H. (1970). Statistical predictor identification. Annals of the Institute of Statistical Mathematics, 22(1), 203-217.
3. Anandkumar, A., Chaudhuri, K., Hsu, D., Kakade, S. M., Song, L., & Zhang, T. (2011). Spectral methods for learning multivariate latent tree structure. In Twenty-Fifth Conference in Neural Information Processing Systems (NIPS-11).
4. Atteson, K. (1999). The performance of neighbor-joining methods of phylogenetic reconstruction. Algorithmica, 25(2), 251-278. (Pubitemid 129674400)
5. Attias, H. (1999). Inferring parameters and structure of latent variable models by variational Bayes. In Proceedings of the 15th Conference on Uncertainty and Artificial Intelligence (UAI-99), pp. 21-30.
6. Barrett, J. C., Fry, B., Maller, J., & Daly, M. J. (2005). Haploview: analysis and visualization of LD and haplotype maps. Bioinformatics, 21(2), 263-265. (Pubitemid 40202029)
7. Binder, J., Koller, D., Russel, S., & Kanazawa, K. (1997). Adaptive probabilistic networks with hidden variables. Machine Learning, 29(2-3), 213-244. (Pubitemid 127510039)
8. Cavender, J. A. (1978). Taxonomy with confidence. Mathematical Biosciences, 40(3-4), 271-280. (Pubitemid 9045615)
9. Chen, T., & Zhang, N. L. (2006). Quartet-based learning of hierarchical latent class models: Discovery of shallow latent variables. In Proceedings of 9th International Symposium on Artificial Intelligence and Mathematics.
10. Chen, T. (2008). Search-based learning of latent tree models. Ph.D. thesis, The Hong Kong University of Science and Technology.
11. Chen, T., Zhang, N. L., Liu, T., Poon, K. M., & Wang, Y. (2012). Model-based multidimensional clustering of categorical data. Artificial Intelligence, 176(1), 2246-2269.
12. Chen, T., Zhang, N. L., & Wang, Y. (2008). Efficient model evaluation in the searchbased approach to latent structure discovery. In Proceedings of the Fourth European Workshop on Probabilistic Graphical Models (PGM-08), pp. 57-64.
13. Chickering, D. M., & Heckerman, D. (1997). Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29(2-3), 181-212. (Pubitemid 127510038)
14. Choi, M. J., Tan, V. Y., Anandkumar, A., & Willsky, A. S. (2011). Learning latent tree graphical models. Journal of Machine Learning Research, 12, 1771-1812.
15. Chow, C. K., & Liu, C. N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3), 462-467.
16. Cooper, G. F. (1990). The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42(2-3), 393-405.
17. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. Wiley-Interscience.
18. Daskalakis, C., Mossel, E., & Roch, S. (2009). Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture. Probability Theory and Related Fields, 149(1-2), 149-189.
19. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39, 1-38.
20. Elidan, G., & Friedman, N. (2001). Learning the dimensionality of hidden variables. In Proceedings of the 17th Conference on Uncertainty and Artificial Intelligence (UAI-01), pp. 144-151.
21. Erdos, P. L., Szekely, L. A., Steel, M. A., & Warnow, T. J. (1999). A few logs suffice to build (almost) all trees: Part II. Theoretical Computer Science, 221(1-2), 77-118. (Pubitemid 129608962)
22. Ezawa, K. J., & Norton, S. W. (1996). Constructing Bayesian networks to predict uncollectible telecommunications accounts. IEEE Expert, 11(5), 45-51. (Pubitemid 126796868)
23. Farris, J. S. (1973). A probability model for inferring evolutionary trees. Systematic Zoology, 22(3), 250-256.
24. Felsenstein, J. (2003). Inferring phylogenies (2 edition). Sinauer Associates.
25. Friedman, N., Ninio, M., Pe'er, I., & Pupko, T. (2002). A structural EM algorithm for phylogenetic inference. Journal of Computational Biology, 9(2), 331-353. (Pubitemid 34548268)
26. Friedman, N., Geiger, D., & Goldszmidt, M. (1997). Bayesian network classifiers. Machine Learning, 29(2-3), 131-163. (Pubitemid 127510036)
27. Gascuel, O., & Steel, M. (2006). Neighbor-joining revealed. Molecular Biology and Evolu-tion, 23(11), 1997-2000. (Pubitemid 44536808)
28. Geiger, D., Heckerman, D., & Meek, C. (1996). Asymptotic model selection for directed networks with hidden variables. In Proceedings of Twelfth Conference on Uncertainty in Artificial Intelligence (UAI-96), pp. 283-290. Morgan Kaufmann.
29. Hair, J. F., Black, W. C., Babin, B. J., & Anderson, R. E. (2009). Multivariate data analysis (7 edition). Prentice Hall.
30. Harmeling, S., & Williams, C. K. I. (2011). Greedy learning of binary latent trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(6), 1087-1097.
31. Hsu, D., Kakade, S., & Zhang, T. (2009). A spectral algorithm for learning hidden Markov models. In The 22nd Annual Conference on Learning Theory (COLT 2009).
32. Hwang, K.-B., Kim, B.-H., & Zhang, B.-T. (2006). Learning hierarchical Bayesian networks for large-scale data analysis. In International Conference on Neural Information Processing (ICONIP-06), pp. 670-679. (Pubitemid 44681558)
33. Kim, J. H., & Pearl, J. (1983). A computation model for causal and diagnostic reasoning in inference systems. In Proceedings of the 8th International Joint Conference on Artificial Intelligence.
34. Kimmel, G., & Shamir, R. (2005). GERBIL: Genotype resolution and block identification using likelihood. Proceedings of the National Academy of Sciences of the United States of America, 102(1), 158-162. (Pubitemid 40094445)
35. Kirshner, S. (2012). Latent tree copulas. In Proceedings of the Sixth European Workshop on Probabilistic Graphical Models (PGM-12).
36. Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques (adaptive computation and machine learning). The MIT Press.
37. Kraskov, A., & Grassberger, P. (2009). Information theory and statistical learning, chap. MIC: Mutual information based hierarchical clustering, pp. 101-123. Springer.
38. Kwoh, C.-K., & Gillies, D. F. (1996). Using hidden nodes in Bayesian networks. Artificial Intelligence, 88(1-2), 1-38. (Pubitemid 126371536)
39. Lake, J. A. (1994). Reconstructing evolutionary trees from DNA and protein sequences: Paralinear distances. Proceedings of the National Academy of Sciences of the United States of America, 91(4), 1455-1459.
40. Langseth, H., & Nielsen, T. D. (2009). Latent classification models for binary data. Pattern Recognition, 42(11), 2724-2736.
41. Lauritzen, S. L. (1995). The EM algorithm for graphical association models with missing data. Computational Statistics & Data Analysis, 19(2), 191-201.
42. Lauritzen, S. L., & Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society. Series B (Methodological), 50(2), 157-224.
43. Liu, H., Xu, M., Gu, H., Gupta, A., Lafferty, J., & Wasserman, L. (2011). Forest density estimation. Journal of Machine Learning Research, 12, 907-951.
44. Liu, T. F., Zhang, N. L., Liu, A. H., & Poon, L. K. M. (2012). A novel LTM-based method for multidimensional clustering. In Proceedings of the Sixth European Workshop on Probabilistic Graphical Models (PGM-12).
45. Martin, J., & Vanlehn, K. (1995). Discrete factor analysis: Learning hidden variables in Bayesian network. Tech. rep., Department of Computer Science, University of Pittsburgh.
46. McKendrick, I. J., Gettinbya, G., Gua, Y., Reidb, S. W. J., & Revie, C. W. (2000). Using a Bayesian belief network to aid differential diagnosis of tropical bovine diseases. Preventive Veterinary Medicine, 47(3), 141-156.
47. Mossel, E., & Roch, S. (2006). Learning nonsingular phylogenies and hiddenMarkov models. The Annals of Applied Probability, 16(2), 583-614. (Pubitemid 44196526)
48. Mossel, E., Roch, S., & Sly, A. (2011). Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters. Submitted.
49. Mourad, R., Sinoquet, C., Dina, C., & Leray, P. (2011). Visualization of pairwise and multilocus linkage disequilibrium structure using latent forests. PLoS ONE, 6(12), e27320.
50. Mourad, R., Sinoquet, C., & Leray, P. (2011). A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genomewide association studies. BMC Bioinformatics, 12, 16.
51. Parikh, A. P., Song, L., & Xing, E. P. (2011). A spectral algorithm for latent tree graphical models. In Proceedings of the 28th International Conference on Machine Learning (ICML-2011).
52. Park, S., & Aggarwal, J. K. (2003). Recognition of two-person interactions using a hierarchical Bayesian network. In The first ACM International Workshop on Video Surveillance (IWVS'03), pp. 65-75.
53. Parzen, E. (1962). On estimation of a probability density function and mode. Annals of Mathematical Statistics, 33, 1065-1076.
54. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, Santa Mateo, CA, USA.
55. Poon, L. K. M., Zhang, N. L., Chen, T., & Wang, Y. (2010). Variable selection in modelbased clustering: To do or to facilitate. In Proceedings of the 27th International Conference on Machine Learning (ICML-2010).
56. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36, 1389-1401.
57. Raftery, A. E. (1986). Choosing models for cross-classifications. American Sociological Review, 51(1), 145-146.
58. Rosenblatt, M. (1956). Remarks on some nonparametric estimates of a density function. Annals of Mathematical Statistics, 27, 832-837.
59. Saitou, N., & Nei, M. (1987). The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4), 406-425.
60. Schwartz, G. (1978). Estimating the dimension of a model. The Annals of Statistics, 6(2), 461-464.
61. Song, L., Parikh, A., & Xing, E. (2011). Kernel embeddings of latent tree graphical models. In Twenty-Fifth Conference in Neural Information Processing Systems (NIPS-11).
62. Spencer, C. C., Su, Z., Donnelly, P., & Marchini, J. (2009). Designing genome-wide association studies: sample size, power, imputation, and the choice of genotyping chip. PLoS Genetics, 5(5), e1000477.
63. Steel, M. (2001). My favourite conjecture. http://www.math.canterbury.ac. nz/-m.steel/files/misc/conjecture.pdf.
64. Steel, M. (1992). The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9(1), 91-116.
65. Tan, V. Y. F., Anandkumar, A., & Willsky, A. (2011). Learning high-dimensional Markov forest distributions: Analysis of error rates. Journal of Machine Learning Research, 12, 1617-1653.
66. The International HapMap Consortium (2007). A second generation human haplotype map of over 3.1 million SNPs. Nature, 449(7164), 851-861.
67. Wang, Y., Zhang, N. L., Chen, T., & Poon, L. K. M. (2011). Latent tree classifier. In European Conferences on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'2011), pp. 410-421.
68. Wang, Y., & Zhang, N. L. (2006). Severity of local maxima for the EM algorithm: Experiences with hierarchical latent class models. In Proceedings of the Third European Workshop on Probabilistic Graphical Models (PGM-06).
69. Wang, Y., Zhang, N. L., & Chen, T. (2008). Latent tree models and approximate inference in Bayesian networks. Journal of Articial Intelligence Research, 32, 879-900.
70. Webb, G. I., Boughton, J. R., & Wang, Z. (2005). Not so naive Bayes: Aggregating onedependence estimators. Machine Learning, 58(1), 5 -24. (Pubitemid 40356736)
71. Wheeler, T. J. (2009). Large-scale neighbor-joining with NINJA. In Proceedings of the 9th Workshop on Algorithms in Bioinformatics.
72. Xu, L., & Jordan, M. I. (1996). On convergence properties of the EM algorithm for Gaussian mixtures. Neural Computation, 8(1), 129-151. (Pubitemid 126449919)
73. Xu, R., & Wunsch, D. (2005). Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16(3), 645-678. (Pubitemid 40718010)
74. Xu, R., & Wunsch, D. C. (2008). Clustering (illustrated edition). Wiley-IEEE Press.
75. Zhang, N. L. (2004). Hierarchical latent class models for cluster analysis. The Journal of Machine Learning Research, 5, 697-723.
76. Zhang, N. L., & Kocka, T. (2004a). Effective dimensions of hierarchical latent class models. Journal of Articial Intelligence Research, 21, 1-17. (Pubitemid 41525895)
77. Zhang, N. L., & Kocka, T. (2004b). Efficient learning of hierarchical latent class models. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 585-593.
78. Zhang, N. L., Nielsen, T. D., & Jensen, F. V. (2004). Latent variable discovery in classification models. Artificial Intelligence in Medicine, 30(3), 283-299. (Pubitemid 38471897)
79. Zhang, N. L., Wang, Y., & Chen, T. (2008). Discovery of latent structures: Experience with the CoIL Challenge 2000 data set&z.ast;. Journal of Systems Science and Complexity, 21(2), 172-183. (Pubitemid 351768543)
80. Zhang, N. L., Yuan, S., Chen, T., & Wang, Y. (2008). Latent tree models and diagnosis in traditional Chinese medicine. Artificial Intelligence in Medicine, 42(3), 229-245.