BayesFusion Support Forum

Why is the search made in 2 stages?
Is it faster than classic Greedy Search?

hello,

I think you well reply to my question.
If i well understood, it is very very similar with Greedy search algorithm?
but adding and deleting edges are made in 2 differents steps.

Thanks

hello,

thank you for your help, but i think this response is insufficient:
i cite " GreedyThickThinning starts with an empty network, then first greedily thickens it and finally thins it. "

Could you give me a precise description of the algorithm? Thank you

Hello,

I would like to know what exactly is greedythickthinning ?
I found on the forum that's this algo is based on heckerman's tutorial.
But when I look at this paper, i don't find any references about greedythickthinning ! No paragraph explicitly talks about greedythickthinning.

So, I would ...