Help required in implementing the algorithm

Question

Actually I am brand new to the java programming, and i need some help to implement the algorithm below in java.
I have the dataset required for the execution,
Can any body please help me?
Input: (1) a source database D,
(2) a min support,
(3) a min confidence,
(4) a set of recommended items Y
Output: a transformed database D, where rules containing
Y on RHS will be hidden
1. Find large 1-item sets from D;
2. For each hidden item y �� Y
3. If y is not a large 1-itemset, then Y := Y − {y};
4. If Y is empty, then EXIT;// no AR contains Y in RHS
5. Find large 2-itemsets containing items in Y from D;
6. For each y �� Y {
7. For each large 2-itemset containing y {
8. Compute confidence of rule U, where U is a rule likex �� y;
9. If confidence(U) �� min conf, then { //Calculate # of transactions required to lower the confidence of U
10. Calculate iterNumConf = _|D|∗(supp(xy) − minconf ∗supp(x))_;
//Calculate # of transactions required to lower the support of U
11. Calcualte iterNumSupp = _|D|∗(supp(xy)− min supp)_;
12. Calculate k = minimum (iterNumConf, iterNumSupp);
13. Calculate |TR| = |xy|; //|TR|: # of transactions inTR
14. if k > |TR|
15. Can not hide U;
16. else {
17. Find T kR = first k transactions that contain xy;
18. Sort T kR in ascending order by the number of items;
19. for i = 1 to iterNum do { 20. Choose the first transaction t from T kR ;
21. Modify t so that y is not supported, the RHS(U);
22. |xy| = |xy| − 1; // update support count of xy
23. confidence(U) = |xy|/|x|; // update confidence
24. Remove and save the first transaction t from T kR ;
25. }; // end for iterNum
26. }; // end if confidence(U)
27. }; // end of each large 2-itemset
28. Remove y from Y;
29. } // end of for each y
30. Output updated D, as the transformed D;

Answer 1

The way you post that, it looks very much like "Do my work for me". Nobody around here likes that kind of post, they consider it lazy and selfish. But perhaps you didn't mean it that way? Why don't you explain what you have done and what parts of it you are having problems with. Explain those problems in detail.