Click here to Skip to main content
15,891,136 members
Please Sign up or sign in to vote.
3.00/5 (1 vote)
Algorithm 2 (table FP construction)
Input: a transferred transaction table T 0
Output: a table FP
Procedure:
for items with the rst identical tid in the table T 0
insert into the table FP
for items with the other identical tids in the table T 0
insertFP (items);
insertFP (items)
count := 1;
curpath := null;
if FP has an item f = i1 (the rst item in the items) and f: path = null
for each item ik in the items
insert ik into the table FP;
curpath += ik;
else
for each item ik in the items
if FP has not an item f = ik
insert ik into the table FP;
else
if f: path != ik: path
insert ik into the table FP;
else
curcount = ik: count + 1;
update the table FP;
curpath += ik;
Posted
Comments
Sunasara Imdadhusen 10-Mar-11 23:59pm    
This algorithm is wrong!!
Abhinav S 11-Mar-11 0:04am    
Shoud not be to difficult. Try it out.
If you face a problem with any part, post a question here.
Sandeep Mewara 11-Mar-11 0:20am    
Did you try?
Sunasara Imdadhusen 11-Mar-11 1:18am    
Because you should try to understand!!
Corporal Agarn 11-Mar-11 9:56am    
As already stated. What do you have as a start?

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900