OpenAlex
PricingAboutJobs
Log inGet started
Work

Learning Factor Graphs in Polynomial Time and Sample Complexity

HTML

Year: 2006
Type: article
Source: Journal of Machine Learning Research
DOI: 10.5555/1248547.1248611
Authors: Pieter Abbeel, Daphne Koller, Andrew Y. Ng
Institution: Stanford University
Language: English

Topic: Bayesian Modeling and Causal Inference
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: factor graphs, graphical model learning, structure learning, parameter estimation, sample complexity, computational complexity, Bayesian networks, Markov random fields, bounded degree, model misspecification

Open Access status: closed
OpenAlex ID: W2147071755
FWCI: 10.51
Cites: 38
Cited by: 172
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security