Sparse Nonparametric Graphical Models
arXiv:1201.0794 · doi:10.1214/12-STS391
Abstract
We present some nonparametric methods for graphical modeling. In the discrete case, where the data are binary or drawn from a finite alphabet, Markov random fields are already essentially nonparametric, since the cliques can take only a finite number of values. Continuous data are different. The Gaussian graphical model is the standard parametric model for continuous data, but it makes distributional assumptions that are often unrealistic. We discuss two approaches to building more flexible graphical models. One allows arbitrary graphs and a nonparametric extension of the Gaussian; the other uses kernel density estimation and restricts the graphs to trees and forests. Examples of both methods are presented. We also discuss possible future research directions for nonparametric graphical modeling.
arXiv commentPublished in at http://dx.doi.org/10.1214/12-STS391 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (6)
- High-dimensional graphs and variable selection with the Lasso
- Sparse permutation invariant covariance estimation
- High-dimensional Ising model selection using -regularized logistic regression
- Estimating time-varying networks
- Rodeo: Sparse, greedy nonparametric regression
- Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures