Apriori Algorithm - Mining association rules in Java

I need help develop a simple Aprior Algorithm Software using JAVA language, I already have half the code and remains the rest to be continued. The project is: Scan the transactions to find L1 For ( k = 2; Lk-1 !empty; k++) { Generate Ck from Lk-1 Count the occurences of itemsets in Ck Find Lk L1: set of all frequent 1-itemsets with counts no less than the support Ck: set of candidates k-itemsets Lk: subset of Ck with counts no less than the support Transactions ([login to view URL]) A, B, E B, D B, C A, B, D A, C B, C A, C A, B, C, E A, B, C F Support(min) = 20% Our association rule data mining task has multiple parameters and stages: Generate candidates, then scan and count, then check min support Keeps counting until ending. C1, C2, C3, etc.. {A, B, C} {A, B, D} {A, B, E} {A, C, D} {A, C, E} {A, D, E} {B, C, D} {B, C, E} {B, D, E} {C, D, E} Mining Rules from frequent itemsets The code is not supporting Mining Rules example Rule Confidence Support A => B 66% 40% A => C 66% 40% A => E 33% 20% B => C 57% 40% B => D 29% 20% B => E 29% 20% It requires someone who understands Apriori Algorithm