BayesFusion Support Forum

That's certainly gets too slow. You can get somewhat better perf using shorter prefix for node identifiers ("n" instead of "node").


Yes, now it is faster... I guess that in a real case network where each node will have a "significantly" different name this would be even faster.


Such internal ...

I was able to get past 15000 without significant slowdowns. However, the Network.addNode method (or rather the wrapped C++ method) performs the check for the uniqueness of the node identifier by linearly comparing the new id with all existing ids, so you can expect addNode taking more time as you ...

There's no artificial limit on the node count. Is there a chance that one of child nodes has parents with very large number of outcomes?

No. Each node represents a discrete variable with two possible outcomes (e.g. true or false) and the MAX number of children or parents for a node is 3.

The ...

I have created a Java package that uses JSmile wrapper in order to create a randomised BBN in which every node has not more than 3 parents.

I did that in order to test SMILE's performance when there is a large number of nodes.

The problem I face is kind of 'strange'; I think I am missing something ...