Learning Sparse Markov Network Structure via Ensemble-of-Trees Models

Simple item page
dc.contributor.authorTaskar, Ben
dc.contributor.authorLin, Yuanqing
dc.contributor.authorZhu, Shenghuo
dc.contributor.authorLee, Daniel
dc.date2023-05-17T07:12:54.000
dc.date.accessioned2023-05-22T19:31:46Z
dc.date.available2023-05-22T19:31:46Z
dc.date.issued2009-04-01
dc.date.submitted2012-07-09T11:52:34-07:00
dc.description.abstractLearning the sparse structure of a general Markov network is a hard computational problem. One of the main difficulties is the computation of the generally intractable partition function. To circumvent this difficulty, we propose to learn the network structure using an ensemble-of- trees (ET) model. The ET model was first introduced by MeilĖ˜a and Jaakkola (2006), and it represents a multivariate distribution using a mixture of all possible spanning trees. The advantage of the ET model is that, although it needs to sum over super-exponentially many trees, its partition function as well as data likelihood can be computed in a closed form. Furthermore, because the ET model tends to represent a Markov network using as small number of trees as possible, it provides a natural regularization for finding a sparse network structure. Our simulation results show that the proposed ET approach is able to accurately recover the true Markov network connectivity and outperform the state-of-art approaches for both discrete and continuous random variable network swhen a small number of data samples is available. Furthermore, we also demonstrate the usage of the ET model for discovering the network of words from blog posts.
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/36397
dc.legacy.articleid1131
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1131&context=hms&unstamped=1
dc.legacy.withdrawnstatus2012-07-16
dc.source.issue125
dc.source.journalCenter for Human Modeling and Simulation
dc.source.statuswithdrawn
dc.subject.otherComputer Sciences
dc.titleLearning Sparse Markov Network Structure via Ensemble-of-Trees Models
dc.typeArticle
digcom.identifierhms/125
digcom.identifier.contextkey3066658
digcom.identifier.submissionpathhms/125
digcom.typearticle
dspace.entity.typePublication
relation.isAuthorOfPublication48084f74-55a3-43da-96d7-8a01c512b3b9
relation.isAuthorOfPublication.latestForDiscovery48084f74-55a3-43da-96d7-8a01c512b3b9
upenn.schoolDepartmentCenterCenter for Human Modeling and Simulation
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
aistats09.pdf
Size:
454.72 KB
Format:
Adobe Portable Document Format
Download
Collection
Articles