Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Topics - Anders L Madsen

Pages: 1 ... 4 5 [6]
As of Hugin 6.0, the default type for saving a model is "Class" (denoted by a class identifier in the net file, as opposed to the net identifier in the old net files). These Classes cannot be loaded into a Domain. Instead, they need to be loaded into a Class. This is done, indirectly, by loading a .net file through a ClassCollection. If you want to load the new model into your program, you have to save it as a 5.7 net file (by choosing "Save as" in the file menu).

FAQ / How much data do I need to learn a network ?
« on: January 27, 2007, 10:48:52  »
It is difficult to give an exact measure, as this depends on the domain that the data represents. The more complex the model is, the more data is required to learn the model from the data.

A rule of thumb says that you should have at least 5 cases for each cell in the largest table in the network. That is, to learn the distribution for any given parent configuration, you should have (5 * number of states) cases.

FAQ / Hugin ran out of memory. What can I do ?
« on: January 26, 2007, 13:49:10  »
The size of Bayesian networks can grow exponentially in the number of nodes. In particular, the size of the CPTs grow exponentially in the number of parents. So if you have, e.g., a node C, with parents P1, P2, P3, P4, P5, P6, P7 and each node has 10 states, the size of Cs CPT will be 10^8 numbers = 100.000.000 number. So the CPTs can grow very big. Furthermore, each number takes up 8 bytes of memory, thus the CPT will need 800Mb of memory for a network with only 8 nodes. Another cause for memory usage is the creation of the junction trees (which occurs during compilation). Depending on the structure of the network, the cliques in the junction tree can grow very large as well, if either a lot of nodes, or the nodes with the largest CPTs, end up in the same clique.
  • Install more memory.
  • Examine the CPTs and reduce the largest ones, either by removing parents, or by removing states from either the parents or the node itself.
  • Change the structure of the network, if the error occurs during compilation, to change the constructed cliques. An alternative to this, is to change the triangulation method, as this will often result in a different junction tree (Network properties -> compilation -> triangulation method).

Pages: 1 ... 4 5 [6]