Abstract
Hierarchical Markov networks (HMNs) were recently proposed as a faithful representation of Bayesian networks. In this paper, we propose a query processing algorithm for HMNs. This method takes one query processing algorithm for a traditional Markov network and extends it to a hierarchy of Markov networks. Experimental results explicitly demonstrate the effectiveness of our approach. The work here will then be useful to any problem utilizing Bayesian networks, such as traditional information retrieval, web search, user profiling, multi-agents and e-commerce.