此代码是《Web日志挖掘技术的研究与应用》陈文臣论文里的算法,求详细讲解
count the NCLR of all distinet pages appeared:
initialize FG1 as the top requested single page groups with Support>=T;
for(i=2;i<=k;i++)
{
Sort the pages of groups in FGi-1 in lexicographical order:
for each group{x1,....,xi-1} in FGi-1
{
for each group{y1,...,yi-1} in FGi-1
{
if(x2=y1 and ....andxi-1=yi-2)
{
construct a new group G={x1,.....,xi-1,yi-1};
if (G not already in FGi)
{
test all other combinations of subgroups of G with size(i-1);
if (all such subgroups are in FGi-1)
if(Support(G)>=T)
add G into FGi;
}
}
}
}
}