Mixed membership sparse gaussian conditional random fields

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Building statistical models to explain the association between responses (output) and predictors (input) is critical in many real applications. In reality, responses may not be independent. A promising direction is to predict related responses together (e.g. Multi-task LASSO). However, not all responses have the same degree of relatedness. Sparse Gaussian conditional random field (SGCRF) was developed to learn the degree of relatedness automatically from the samples without any prior knowledge. In real cases, features (both predictors and responses) are not arbitrary, but are dominated by a (smaller) set of related latent factors, e.g. clusters. SGCRF does not capture these latent relations in the model. Being able to model these relations could result in more accurate association between responses and predictors. In this paper, we propose a novel (mixed membership) hierarchical Bayesian model, namely M2 GCRF, to capture this phenomenon (in terms of clusters). We develop a variational Expectation-Maximization algorithm to infer the latent relations and association matrices. We show that M2 GCRF clearly outperforms existing methods for both synthetic and real datasets, and the association matrices identified by M2 GCRF are more accurate.

Cite

CITATION STYLE

APA

Yang, J., Leung, H. C. M., Yiu, S. M., & Chin, F. Y. L. (2017). Mixed membership sparse gaussian conditional random fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10604 LNAI, pp. 287–302). Springer Verlag. https://doi.org/10.1007/978-3-319-69179-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free