Journal
ARTIFICIAL INTELLIGENCE REVIEW
Volume 34, Issue 4, Pages 291-308Publisher
SPRINGER
DOI: 10.1007/s10462-010-9176-8
Keywords
Object recognition; Bayesian belief network; Context; Computer vision
Categories
Funding
- Universiti Sains Malaysia
- Fundamental Research Grant Scheme (FRGS) [203/PKOMP/671176]
Ask authors/readers for more resources
This paper presents a comparative study of Bayesian belief network structure learning algorithms with a view to identify a suitable algorithm for modeling the contextual relations among objects typically found in natural imagery. Four popular structure learning algorithms are compared: two constraint-based algorithms (PC proposed by Spirtes and Glymour and Fast Incremental Association Markov Blanket proposed by Yaramakala and Margaritis), a score-based algorithm (Hill Climbing as implemented by Daly), and a hybrid algorithm (Max-Min Hill Climbing proposed by Tsamardinos et al.). Contrary to the belief regarding the superiority of constraint-based approaches, our empirical results show that a score-based approach performs better on our context dataset in terms of prediction power and learning time. The hybrid algorithm could achieve similar prediction performance as the score-based approach, but requires longer time to learn the desired network. Another interesting fact the study has revealed is the existence of strong correspondence between the linear correlation pattern within the dataset and the edges found in the learned networks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available