Skip to content
/ BMM Public

This is an implementation for Bayesian Moment Matching algorithm for learning the parameters for Sum Product Networks (SPNs) with Discrete or Continuous variables.

Notifications You must be signed in to change notification settings

arashwan/BMM

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

BMM

This is an implementation for Bayesian Moment Matching algorithm for learning the parameters for Sum Product Networks (SPNs) with Discrete or Continuous variables.

To build this project, you need to install Eigen library. You can run the code using one of the following commands depending on the type of data.

Discrete data: The depth of the spn, and the max number of children need to be tuned to optimize the likelihood scores.

RandomStructureAndMM

Continuous data using SPN model that is equivalent to GMMs: The number of mixtures needs to be tuned to optimize the likelihood scores. BMM Multivariate_GMM <number_of_variables> <num_of_mixtures> <path_to_train> <path_to_test>

Continuous data using SPN model with random strucature: The depth of the spn, and the max number of children need to be tuned to optimize the likelihood scores. BMM Multivariate_SPN <number_of_variables> <depth_of_spn> <max_number_of_children_for_sum_nodes> <number_of_variables_at_leaf_nodes> <path_to_train> <path_to_test>

About

This is an implementation for Bayesian Moment Matching algorithm for learning the parameters for Sum Product Networks (SPNs) with Discrete or Continuous variables.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published