Graph-Valued Regression

Details Graph-Valued Regression Graph-Valued Regression

2010-06-21

arxiv.org/abs/1006.3972v1

Statistics

Machine Learning

Scientific paper

Undirected graphical models encode in a graph $G$ the dependency structure of a random vector $Y$. In many applications, it is of interest to model $Y$ given another random vector $X$ as input. We refer to the problem of estimating the graph $G(x)$ of $Y$ conditioned on $X=x$ as ``graph-valued regression.'' In this paper, we propose a semiparametric method for estimating $G(x)$ that builds a tree on the $X$ space just as in CART (classification and regression trees), but at each leaf of the tree estimates a graph. We call the method ``Graph-optimized CART,'' or Go-CART. We study the theoretical properties of Go-CART using dyadic partitioning trees, establishing oracle inequalities on risk minimization and tree partition consistency. We also demonstrate the application of Go-CART to a meteorological dataset, showing how graph-valued regression can provide a useful tool for analyzing complex data.

Affiliated with

Also associated with

No associations

Rating

Graph-Valued Regression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph-Valued Regression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph-Valued Regression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599555