## Abstract

We propose a constraint-based algorithm for Bayesian network structure learning called recursive autonomy identification (RAI). The RAI algorithm learns the structure by recursive application of conditional independence (CI) tests of increasing orders, edge direction and structure decomposition into autonomous substructures. In comparison to other constraint-based algorithms d-separating structures and then directing the resulted undirected graph, the RAI algorithm combines the two processes from the outset and along the procedure. Learning using the RAI algorithm renders smaller condition sets thus requires a smaller number of high order CI tests. This reduces complexity and run-time as well as increases accuracy since diminishing the curse-of-dimensionality. When evaluated on synthetic and "real-world" databases as well as the ALARM network, the RAI algorithm shows better structural correctness, run-time reduction along with accuracy improvement compared to popular constraint-based structure learning algorithms. Accuracy improvement is also demonstrated when compared to a common search-and-score structure learning algorithm.

Original language | English |
---|---|

Title of host publication | AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics |

Pages | 429-436 |

Number of pages | 8 |

State | Published - 1 Dec 2005 |

Event | 10th International Workshop on Artificial Intelligence and Statistics, AISTATS 2005 - Hastings, Christ Church, Barbados Duration: 6 Jan 2005 → 8 Jan 2005 |

### Conference

Conference | 10th International Workshop on Artificial Intelligence and Statistics, AISTATS 2005 |
---|---|

Country/Territory | Barbados |

City | Hastings, Christ Church |

Period | 6/01/05 → 8/01/05 |

## ASJC Scopus subject areas

- Artificial Intelligence
- Statistics and Probability