Skip to Main content Skip to Navigation
Conference papers

Local Skeleton Discovery for Incremental Bayesian Network Structure Learning

Abstract : Nowadays there are a huge number of applications produce the immense amount of data in the form of a data stream, which needs real time analysis. Sensor networks, real-time surveillance and telecommunication systems are the examples of such applications. The real time analysis of the data stream leads to a number of computational and mining challenges. In this scenario new data arrives continuously and an efficient learning algorithm must be able to improve its learning accuracy by incorporating the time and memory constraints. This paper addresses the problem of incremental Bayesian network structure learning for high dimensional domains. The local skeleton discovery methods for Bayesian network structure learning are outperforming to deal with such domains. Here we transformed the local discovery algorithm Max-Min Parents and Childrens (MMPC) into an incremental fashion. We learned a set of candidate-parent-children for each variable by using incremental hill-climbing. The reduced search space saves a lot of computations and reduces the complexity. Our algorithm is then illustrated with a toy example.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Amanullah Yasin Connect in order to contact the contributor
Submitted on : Friday, April 24, 2020 - 12:24:06 PM
Last modification on : Wednesday, April 27, 2022 - 4:17:58 AM


Files produced by the author(s)


  • HAL Id : hal-00595152, version 1


Amanullah Yasin, Philippe Leray. Local Skeleton Discovery for Incremental Bayesian Network Structure Learning. International Conference on Computer Networks and Information Technology (ICCNIT), Jul 2011, Peshawar, Pakistan. ⟨hal-00595152⟩



Record views


Files downloads