Hi, Estevam,
We've implemented K2 in Java last year. We used log[g(i,Pai)] instead of
g(i,Pai) in order to save running time. We tested it on Alarm 3000~10,000
cases datasets and it worked pretty well. It only missed one arc from 12
to 32 and added one wrong link from 15 to 34 due to the greedy nature of
K2. Hope that helps.
cheers,
- -hpguo
On Mon, 21 May 2001, Estevam Rafael Hruschka Junior wrote:
> Hi all,
>
> I'm using the K2 algorithm (Cooper & Herskovitz, 1992) to learn a bayesian
> model from data. The point is that in this algorithm I need to compute the
> fatorial of Nijk (the number of cases in which a variable xi has the value
> vik, and the parent of x is instantiated as wij). When the number of cases
> (in the database) is big, I can't compute this fatorial.
> I was wondering if anybody have already faced this problem and have any
> sugestion.
>
> Thank you in advance,
>
> Estevam.
>
> - -_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
> Estevam Rafael Hruschka Junior
> Curitiba - PR - Brazil
> e-mail: estevamr@terra.com.br
>
>
This archive was generated by hypermail 2b29 : Tue May 22 2001 - 14:57:00 PDT