1997
DOI: 10.1023/a:1007417612269
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Abstract: We consider the problem of PAC learning probabilistic networks in the case where the structure of the net is specified beforehand. We allow the conditional probabilities to be represented in any manner (as tables or specialized functions) and obtain sample complexity bounds for learning nets with and without hidden nodes.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2004
2004
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 29 publications
references
References 10 publications
0
0
0
Order By: Relevance