Fourth IEEE International Conference on Data Mining (ICDM'04) Privacy-Sensitive Bayesian Network Parameter Learning Brighton, United Kingdom November 01-November 04 ISBN: 0-7695-2142-8
This paper considers the problem of learning the parameters of a Bayesian Network, assuming the structure of the network is given, from a privacy-sensitive dataset that is distributed between multiple parties. For a binary-valued dataset, we show that the count information required to estimate the conditional probabilities in a Bayesian network can be obtained as a solution to a set of linear equations involving some inner product between the relevant different feature vectors. We consider a random projection-based method that was proposed elsewhere to securely compute the inner product (with a modified implementation of that method).
Citation:
D. Meng, K. Sivakumar, H. Kargupta, "Privacy-Sensitive Bayesian Network Parameter Learning," icdm, pp.487-490, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||