Learning Bayesian Network Structure over Distributed Databases Using Majority-based Method
نویسندگان
چکیده
In this paper we present a majority-based method to learn Bayesian network structure from databases distributed over a peer-to-peer network. The method consists of a majority learning algorithm and a majority consensus protocol. The majority learning algorithm discovers the local Bayesian network structure based on the local database and updates the structure once new edges are learnt from neighboring nodes. The majority consensus protocol is responsible for the exchange of the local Bayesian networks between neighboring nodes. The protocol and algorithm are executed in tandem on each node. They perform their operations asynchronously and exhibit local communications. Simulation results verify that all new edges, except for edges with confidence levels close to the confidence threshold, can be discovered by exchange of messages with a small number of neighboring nodes.
منابع مشابه
Learning distributed bayesian network structure using majority-based method
In this paper we present a majority-based method to learn Bayesian network structure from databases distributed over a peer-to-peer network. The method consists of a majority learning algorithm and a majority consensus protocol. The majority learning algorithm discovers the local Bayesian network structure based on the local database and updates the structure once new edges are learnt from neig...
متن کاملLearning Bayesian Network Structure using Markov Blanket in K2 Algorithm
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
متن کاملLearning Bayesian Network Structure Using Genetic Algorithm with Consideration of the Node Ordering via Principal Component Analysis
‎The most challenging task in dealing with Bayesian networks is learning their structure‎. ‎Two classical approaches are often used for learning Bayesian network structure;‎ ‎Constraint-Based method and Score-and-Search-Based one‎. ‎But neither the first nor the second one are completely satisfactory‎. ‎Therefore the heuristic search such as Genetic Alg...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کامل