Bayesian networks are known for providing an intuitive and compact representation of probabilistic information and allowing the creation of models over a large and complex domain. Bayesian learning and reasoning are nontrivial for a large Bayesian network. In parallel, it is a tough job for users (domain experts) to extract accurate information from a large Bayesian network due to dimensional difficulty. We define a formulation of local components and propose a clustering algorithm to learn such local components given complete data. The algorithm groups together most interrelevant attributes in a domain. We evaluate its performance on three benchmark Bayesian networks and provide results in support. We further show that the learned components may represent local knowledge more precisely in comparison to the full Bayesian networks when working with a small amount of data.
|Number of pages||6|
|Publication status||Published - Dec 2009|
|Event||9th IEEE International Conference on Data Mining (ICDM) - Miami Beach, United States|
Duration: 6 Dec 2009 → 9 Dec 2009
Conference number: 9th
|Conference||9th IEEE International Conference on Data Mining (ICDM)|
|Period||6/12/09 → 9/12/09|