Distributed Probabilistic Inferencing in Sensor Networks using Variational Approximation

This paper considers the problem of distributed inferencing in a sensor network. It particularly explores the probabilistic inferencing problem in the context of a distributed Boltzmann machine-based framework for monitoring the network. The paper offers a variational mean-field approach to develop communication-efficient local algorithm for Variational Inferencing in Distributed Environments (VIDE). It compares the performance of the proposed approximate variational technique with respect to the exact and centralized techniques. It shows that the VIDE offers a much more communication-efficient solution at very little cost in terms of the accuracy. It also offers experimental results in order to substantiate the scalability of the proposed algorithm.
Date: January 18, 2008
Book Title: Journal of Parallel and Distributed Computing (JPDC)
Type: InProceedings
Edition: 1
Volume: 68
Pages: 78-92
Downloads: 398

Has 1 soft copy


remote link

Bibtex


@InProceedings{Distributed_Probabilistic_Inferencing_in,
  author = "Sourav Mukherjee and Hillol Kargupta",
  title = "{Distributed Probabilistic Inferencing in Sensor Networks using Variational Approximation}",
  month = "January",
  year = "2008",
  edition = "1",
  pages = "78-92",
  volume = "68",
  booktitle = "Journal of Parallel and Distributed Computing (JPDC)",
}