I am quite new in RapidMiner and to practice on my own I decided to work on 7 .txt files containing 42,000 lines (or approximatively 70,000 characters) in total. My first intention was to make an association analysis based on these texts.
The steps that I followed were: 1-Process the data (tokenize, filter...) 2-Numerical to binomial 3-FP-Growth 4-Create Association rules
However it gets stuck during FP-Growth where the process continues for almost an hour and then shows a memory insufficiency problem. I have no idea why that might me caused.
I spent some time on RM Association Rules, and have posted on this subject before, so you can search for posts on that subject.
Being practical I would...
1. Put a break on before the FP-Growth operator runs, just to check that all your examples are Binominal, and in good order, no missings and so on.
2. Start with a frequency threshold that is so high that it produces no itemsets, and then lower that threshold. If you go too low you will fill up the memory with loads of itemsets.
3. Check the source code of the Association Rules operator. If it still uses iterates over the powerset of each itemset then give up on this approach unless your itemsets are short! I posted about this a while ago, and Ingo acknowledged the weakness.
That's certainly true; it's also worth noting that, for English at least, just 100 connective words, which carry little significance, constitute about half of normal text. In my current work, which mines association rules from newsfeeds ( http://datamonkees.wpengine.com ) this tip really helped. It also appears to work in Spanish and French, so it's worth paying attention to your stopword list in the pre-processing phase.