Also, this may be helpful:
D. Haussler, M. Kearns, and R. Schapire, (1991):
"Bounds on the Sample Complexity of Bayesian Learning Using
Information Theory and the VC Dimension." Technical Report
UCSC-CRL-91-44, University of California Computer Research
Laboratory, Santa Cruz, CA.
Jae-Hyuck Lee
On Wed, 27 Sep 2000, Russ Greiner wrote:
> "Dr. Lian Wen Zhang" wrote:
> > Can someone point me to papers on required sample size for
> > parameter and structure learning in Bayesian networks?
>
> Stefano Monti 268-7019 writes:
> > @Article{dasgup97,
> > author = "Sanjoy Dasgupta",
> > title = "The Sample Complexity of Learning Fixed-Structure
> > {B}ayesian Networks",
> > journal = "Machine Learning",
> > year = 1997,
> > volume = 29,
> > number = 2,
> > annote = "Bayesian networks; PAC learning; sample complexity"
> > }
> >
> > @InProceedings{friyak96,
> > author = "Nir Friedman and Zohar Yakhini",
> > title = "On the Sample Complexity of Learning {B}ayesian Networks",
> > booktitle = "Proceedings of the 12th Conference of Uncertainty in AI",
> > year = 1996
> > }
>
>
>
> See also
>
> @InProceedings{Hoeffgen-COLT93,
> author = "Klaus-U. H{\"o}ffgen",
> title = "Learning and Robust Learning of Product Distributions",
> pages = "77--83",
> booktitle = "Proceedings of the 6th Annual Conference on
> Computational Learning Theory",
> address = "Santa Cruz, CA, USA",
> month = jul,
> year = "1993",
> publisher = "ACM Press",
> }
>
> @InProceedings{LearnBN-UAI97,
> Author = "R. Greiner and A. Grove and D. Schuurmans",
> title = "Learning {Bayesian} Nets that Perform Well",
> booktitle = "Proceedings of the 13th Conference of Uncertainty in AI",
> Year = 1997,
> }
>
> (Proofs, etc, for the results in the LearnBN-UAI97 (will) appear in
> http://www.cs.ualberta.ca/~greiner/BN-results.html#AccurateBN
> )
>
>
> | R Greiner Phone: (780) 492-5461 |
> | Dep't of Computing Science FAX: (780) 492-1071 |
> | University of Alberta Email: [EMAIL PROTECTED] |
> | Edmonton, AB T6G 2H1 Canada http://www.cs.ualberta.ca/~greiner/ |
>
>
