Model Selection in Undirected Graphical Models with the Elastic Net

Details Model Selection in Undirected Graphical Models with the Elastic Net Model Selection in Undirected Graphical Models with the Elastic Net

2011-11-02

arxiv.org/abs/1111.0559v1

Statistics

Other Statistics

15 pages

Scientific paper

Structure learning in random fields has attracted considerable attention due to its difficulty and importance in areas such as remote sensing, computational biology, natural language processing, protein networks, and social network analysis. We consider the problem of estimating the probabilistic graph structure associated with a Gaussian Markov Random Field (GMRF), the Ising model and the Potts model, by extending previous work on $l_1$ regularized neighborhood estimation to include the elastic net $l_1+l_2$ penalty. Additionally, we show numerical evidence that the edge density plays a role in the graph recovery process. Finally, we introduce a novel method for augmenting neighborhood estimation by leveraging pair-wise neighborhood union estimates.

Affiliated with

Also associated with

No associations

Rating

Model Selection in Undirected Graphical Models with the Elastic Net 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 Model Selection in Undirected Graphical Models with the Elastic Net, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model Selection in Undirected Graphical Models with the Elastic Net will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329597