I want to implement algorithm from this article
http://arxiv.org/abs/1403.3948
I intend to upgrade from this sourcecode http://www.codeproject.com/script/Articles/ArticleVersion.aspx?aid=70371&av=119374
this sourcecode use structure Dictinary<string,double> contains itemset(items,their support count)
Is it necessary to change structure Dictinary<string,double> to ?<string,double,string> contains itemset(items,their support count,Transaction ID wherethe items are found) or other methods to implement algorithm with excution time better apriori algorithm in article

Thanks

Hi Toan,

I don't think the improvement in this article is significant. I suggest that you should take a look the algorithm AprioriTID (Link) or Eclat (Link) instead. They are much more better.

You can also refer to the implementation by Prof. Philippe (Link).

Best,
Dang Nguyen