Hybrid algorithm for learning structure of Bayesian network from incomplete databases
Scoring-based and constraint-based algorithms are two approaches for learning BN structure from data. Hybrid algorithm combines these two approaches in order being more efficient. Experimental result shows its superior. The algorithm, then, is modified to overcome incomplete databases. It is expecte...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Scoring-based and constraint-based algorithms are two approaches for learning BN structure from data. Hybrid algorithm combines these two approaches in order being more efficient. Experimental result shows its superior. The algorithm, then, is modified to overcome incomplete databases. It is expected that the proposed algorithm can also show its superiority. |
---|---|
DOI: | 10.1109/ISCIT.2005.1566960 |