BayesFusion Support Forum

Hello,

I interested in adding reference to the "Greedy Thick Thinning" algorithm in my work.
Is there an option to get some place where i can find an article that explains the "Greedy Thick Thinning" algorithm ?

Thanks,
Boris

Suppose the column contains only integers : 1,2,3,4,5,...,50,.....1000 this column esteemed as Continuous or Discrete ?


If you're asking about the type of the column as inferred by DSL_dataset::ReadFile, then the answer is 'discrete'.

What is the "Discrete threshold" feature in GeNIe ?
Is this ...

shooltz wrote:The parser used by DSL_dataset::ReadFile treats the column as continouos when at least one value is non-integer.

Suppose the column contains only integers : 1,2,3,4,5,...,50,.....1000 this column esteemed as Continuous or Discrete ?

Thanks,
Boris

Hello,

How the SMILE's algorithm recognize if the column type continuous or discrete ?

Thanks,
Boris

mark wrote:Just to clarify, are you asking for the actual running time or the computational complexity?

I am asking about the computational complexity (time complexity).

Thanks,
Boris

Do you mean to ask if there is a difference? In general, the runtime depends strongly on the connectivity of the graph you are trying to learn (i.e., the number of conditional dependencies in the data).

I actually intended to ask the run time for the greedy algorithm as function of nodes ...

mark wrote: K2 and BDeu are prior distributions over parameters used in the score metric.

Can you please indicate the run time for the greedy algorithm when using the K2 and BDeu ?

Thanks,
Boris

If the arc can be reversed it means there is a direct correlation between the variables, but the causal relationship cannot be determined

Are these kind of arcs presented ?


K2 and BDeu are prior distributions over parameters used in the score metric

What the BDeu's weights meaning ...

In a nutshell, the arcs are causal, unless an arc can be reversed without changing the set of conditional independencies that hold for a given graph. The learning is unsupervised.

If the arc can be reversed without any changing it will be deleted or appear as correlated?

Another question:
The K2 ...

Please refer to Heckerman's "A Tutorial on Learning With Bayesian Networks" for an explanation of GreedyThickThinning. Essential graph search starts from a graph obtained by applying PC and then continues with a GreedyThickThinning search (and it also does multiple restarts). The learning ...

Hello,

I trieds to execute => Parse(filename) function but without success.
How i can use the "TextParser" class ?

comment: my code contain the "using Smile.Learning" row.

When i using the :
myDataSet.ReadFile(filename)
Is the parser executed automaticaly?

Thanks in advance,
Boris

Hello,

Is there an option after loading the Data set , activate discretization operation (Using c#)?

Thanks,
Boris

Is there an option to copy all the Items from C# Dataset to Smile Dataset ?
Another question if i can read specific table from access Db (Like GeNIe allows).

No, there's no .Net-specific functionality in Smile.Learning.DataSet. You'll need to iterate over the contents of your ADO.NET (or whatever ...

Hello,

When i open the file (that attached) and try to learn the network with Greedy algorithm i get network without connections at all.

The result appears immediately in other words , seems that GeNIe not try to run the learning at all.

What can be the problem?

Thanks,
Boris

Hello,

Is there an option to copy all the Items from C# Dataset to Smile Dataset ?

Another question if i can read specific table from access Db (Like GeNIe allows).

Thanks,
Boris