Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

On the robustness of Bayesian networks to learning from non-conjugate sampling

Tools
- Tools
+ Tools

Smith, J. Q. and Daneshkhah, Alireza (2010) On the robustness of Bayesian networks to learning from non-conjugate sampling. In: 4th European Workshop on Probabilistic Graphical Models, Hirtshals, Denmark, September 17-19, 2008. Published in: International Journal of Approximate Reasoning, Vol.51 (No.5). pp. 558-572. doi:10.1016/j.ijar.2010.01.013 ISSN 0888-613X.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1016/j.ijar.2010.01.013

Request Changes to record.

Abstract

Recent results concerning the instability of Bayes Factor search over Bayesian Networks (BN's) lead us to ask whether learning the parameters of a selected BN might also depend heavily on the often rather arbitrary choice of prior density. Robustness of inferences to misspecification of the prior density would at least ensure that a selected candidate model would give similar predictions of future data points given somewhat different priors and a given large training data set. In this paper we derive new explicit total variation bounds on the calculated posterior density as the function of the closeness of the genuine prior to the approximating one used and certain summary statistics of the calculated posterior density. We show that the approximating posterior density often converges to the genuine one as the number of sample point increases and our bounds allow us to identify when the posterior approximation might not. To prove our general results we needed to develop a new family of distance measures called local DeRobertis distances. These provide coarse non-parametric neighbourhoods and allowed us to derive elegant explicit posterior bounds in total variation. The bounds can be routinely calculated for BNs even when the sample has systematically missing observations and no conjugate analyses are possible. (C) 2010 Elsevier Inc. All rights reserved.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Engineering > Engineering
Faculty of Science, Engineering and Medicine > Science > Statistics
Journal or Publication Title: International Journal of Approximate Reasoning
Publisher: Elsevier
ISSN: 0888-613X
Official Date: June 2010
Dates:
DateEvent
June 2010Published
Volume: Vol.51
Number: No.5
Number of Pages: 15
Page Range: pp. 558-572
DOI: 10.1016/j.ijar.2010.01.013
Status: Peer Reviewed
Publication Status: Published
Title of Event: 4th European Workshop on Probabilistic Graphical Models
Type of Event: Workshop
Location of Event: Hirtshals, Denmark
Date(s) of Event: September 17-19, 2008

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us