SCHEDULE: NOV 10-16, 2012
When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.
Parallel Bayesian Network Structure Learning with Application to Gene Networks
SESSION: Graph Algorithms
EVENT TYPE: Papers
TIME: 4:00PM - 4:30PM
SESSION CHAIR: Esmond G. Ng
AUTHOR(S):Olga Nikolova, Srinivas Aluru
ROOM:355-EF
ABSTRACT:
Bayesian networks (BN) are probabilistic graphical models which are widely utilized in various research areas, including modeling complex biological interactions in the cell. Learning the structure of a BN is an NP-hard problem and exact solutions are limited to a few tens of variables. In this work, we present a parallel BN structure learning algorithm that combines principles of both heuristic and exact approaches and facilitates learning of larger networks. We demonstrate the applicability of our approach by an implementation on a Cray AMD cluster, and present experimental results for the problem of inferring gene networks. Our approach is work-optimal and achieves nearly perfect scaling.
Chair/Author Details:
Esmond G. Ng (Chair) - Lawrence Berkeley National Laboratory
Olga Nikolova - Iowa State University
Srinivas Aluru - Iowa State University
Click here to download .ics calendar file
Click here to download .vcs calendar file
Click here to add event to your Google Calendar
Parallel Bayesian Network Structure Learning with Application to Gene Networks
SESSION: Graph Algorithms
EVENT TYPE:
TIME: 4:00PM - 4:30PM
SESSION CHAIR: Esmond G. Ng
AUTHOR(S):Olga Nikolova, Srinivas Aluru
ROOM:355-EF
ABSTRACT:
Bayesian networks (BN) are probabilistic graphical models which are widely utilized in various research areas, including modeling complex biological interactions in the cell. Learning the structure of a BN is an NP-hard problem and exact solutions are limited to a few tens of variables. In this work, we present a parallel BN structure learning algorithm that combines principles of both heuristic and exact approaches and facilitates learning of larger networks. We demonstrate the applicability of our approach by an implementation on a Cray AMD cluster, and present experimental results for the problem of inferring gene networks. Our approach is work-optimal and achieves nearly perfect scaling.
Chair/Author Details:
Esmond G. Ng (Chair) - Lawrence Berkeley National Laboratory
Olga Nikolova - Iowa State University
Srinivas Aluru - Iowa State University
Click here to download .ics calendar file