Hi,
I have a relatively large dataset with 2500 features. I use SMILE and GENIE to perform greedy thick thinning structure learning. SMILE (in C++) seems going to run infinitely long without a response. GENIE, when using max num of parents=3, runs for 7 minutes and pop an error. If instead, of using max num of parents=1, GENIE runs fine. So my question is how can I perform gtt algorithm (or Bayesian search) for this dataset by using max parent num>=2? Is this a memory limitation problem? Thanks
snowave
SMILE and GENIE structure learning
-
- Site Admin
- Posts: 1417
- Joined: Mon Nov 26, 2007 5:51 pm
Re: SMILE and GENIE structure learning
What's your compiler?SMILE (in C++) seems going to run infinitely long without a response. GENIE, when using max num of parents=3, runs for 7 minutes and pop an error.
Re: SMILE and GENIE structure learning
I'm using VS2015
Re: SMILE and GENIE structure learning
It just runs for a long time. Thanks. I changed from debug mode to release mode.