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.


Messages - pibar

Pages: [1]
1
C# / Expression for Noisy Or
« on: September 06, 2016, 17:55:31  »
Hi,
We are trying to construct a model using Noisy-Or expression in the Hugin API for C#. There exist a class called NoisyOrDistribution but we have trouble constructing an expression for NoisyOr. The documentation includes expressions for AddExpression but not for NoisyOr.

Can someone give us a hint?

Regards
Pibar


2
Research & Development / Learning algorithm
« on: September 01, 2011, 16:07:45  »
Hola,

I just discover the new learning algorithm "Greedy-search and score". It provides better results in my application. My question is: What is the reference of this algorithm? How can I read about it? who is the author?

I notice that chapter 11 of the reference manual is not actualized with this new algorithms.

Congratulations for these new learning algorithms

Pablo I.

3
C# / obtaining data with method "getState_Value"
« on: August 15, 2011, 20:29:38  »
Hi,

I need to obtain all the possible information about my interval chance nodes including the highest value of the highest interval. This method returns only the lowest value of all intervals.

In short, how can I obtain the highest values?

I appreciate


4
HUGIN GUI Discussion / sensitivity analysis
« on: May 18, 2011, 21:20:55  »
Hi,

I need to perform evidence sensitivity analysis but the on-manual is very superficial. Where can I read about many topics covered in this sensitivity analysys? For example, entropy of hypothesis H(hypothesis). What should I deduce from these values? The same with all the topics covered inthis evidence sensitivity analysis documentation.

I appreciate your help

5
General Discussion / learning
« on: August 16, 2010, 21:23:13  »
I have historical data that produces a very interconnected network that uses terabytes of memory. My data corresponds to 15 continuous value variables, discretized in 10 intervals (minimum).

How can I get only the arcs more representatives, keeping the number of parents of a node limited?

Pages: [1]