out.txt

Apriori算法是发现关联规则领域的经典算法。该算法将发现关联规则的过程分为两个步骤：第一步通过迭代

f,l,I,J,p,O, => c, C: 1.0   S: 0.40594059405940597
c,l,I,J,p,O, => f, C: 0.9534883720930233   S: 0.42574257425742573
c,f,I,J,p,O, => l, C: 0.9318181818181818   S: 0.43564356435643564
c,f,l,J,p,O, => I, C: 0.9534883720930233   S: 0.42574257425742573
c,f,l,I,p,O, => J, C: 1.0   S: 0.40594059405940597
c,f,l,I,J,O, => p, C: 0.8541666666666666   S: 0.4752475247524752
c,f,l,I,J,p, => O, C: 0.8913043478260869   S: 0.45544554455445546