activity
20122018
most citedAn Improved Admissible Heuristic for Learning Optimal Bayesian Networks

32 citations · 59 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2018★ 7 cited

Learning Representations of Missing Data for Predicting Patient Outcomes

Brandon Malone, Alberto Garcia-Duran, Mathias Niepert

Extracting actionable insight from Electronic Health Records (EHRs) poses several challenges for traditional machine learning approaches. Patients are often missing data relative t…

cs.DB2018

Knowledge Graph Completion to Predict Polypharmacy Side Effects

Brandon Malone, Alberto García-Durán, Mathias Niepert

The polypharmacy side effect prediction problem considers cases in which two drugs taken individually do not result in a particular side effect; however, when the two drugs are tak…

cs.AI2013★ 11 cited

Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks

Brandon Malone, Changhe Yuan

Exact algorithms for learning Bayesian networks guarantee to find provably optimal networks. However, they may fail in difficult learning tasks due to limited time or memory. In th…

cs.AI2012★ 32 cited

An Improved Admissible Heuristic for Learning Optimal Bayesian Networks

Changhe Yuan, Brandon Malone

Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that o…

cs.AI2012★ 9 cited

Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search

Brandon Malone, Changhe Yuan, Eric A. Hansen +1

Previous work has shown that the problem of learning the optimal structure of a Bayesian network can be formulated as a shortest path finding problem in a graph and solved using A*…