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.

[1]  Michael I. Jordan,et al.  Learning in Boltzmann Trees , 1994, Neural Computation.

[2]  J J Hopfield,et al.  Learning algorithms and probability distributions in feed-forward and feed-back networks. , 1987, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Carlos Guestrin,et al.  A robust architecture for distributed inference in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[5]  A. Schuster,et al.  Association rule mining in peer-to-peer systems , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[6]  I. Hamzaoglu H. Kargupta,et al.  Distributed Data Mining Using An Agent Based Architecture , 1997, KDD 1997.

[7]  Yee Whye Teh,et al.  Rate-coded Restricted Boltzmann Machines for Face Recognition , 2000, NIPS.

[8]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[9]  Finn Verner Jensen,et al.  Introduction to Bayesian Networks , 2008, Innovations in Bayesian Networks.

[10]  Carsten Peterson,et al.  A Mean Field Theory Learning Algorithm for Neural Networks , 1987, Complex Syst..

[11]  Yelena Yesha,et al.  Data Mining: Next Generation Challenges and Future Directions , 2004 .

[12]  Martin J. Wainwright,et al.  Data association based on optimization in graphical models with application to sensor networks , 2006, Math. Comput. Model..

[13]  Tommi S. Jaakkola,et al.  Tutorial on variational approximation methods , 2000 .

[14]  Carlos Guestrin,et al.  Robust Probabilistic Inference in Distributed Systems , 2004, UAI.

[15]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[16]  Stefan Rüger,et al.  Decimatable Boltzmann Machines for Diagnosis: Efficient Learning and Inference , 1997 .

[17]  Deborah Estrin,et al.  A Collaborative Approach to In-Place Sensor Calibration , 2003, IPSN.

[18]  Martin Haenggi,et al.  Performance analysis of Rayleigh fading ad hoc networks with regular topology , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[19]  Geoffrey E. Hinton.  Training Products of Experts by Minimizing Contrastive Divergence , 2002, Neural Computation.

[20]  Avi Pfeffer,et al.  Loopy Belief Propagation as a Basis for Communication in Sensor Networks , 2002, UAI.

[21]  Alexander T. Ihler,et al.  Inference in sensor networks: graphical models and particle methods , 2005 .

[22]  Venkatesh Saligrama,et al.  Detection and Localization in Sensor Networks Using Distributed FDR , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[23]  Yu-Chee Tseng,et al.  Efficient in-network moving object tracking in wireless sensor networks , 2006, IEEE Transactions on Mobile Computing.