学步园

最近刚学Python，就用Python写了一个算法，由于不熟练的原因，实现得并不好，但结果是对的，代码如下：

# -*- coding: UTF8 -*-
import sys
import copy

def init_pass(T):
    C = {}
    for t in T:
        for i in t:
            if i in C.keys():
                C[i] += 1
            else:
                C[i] = 1
    return C

def candidate_gen(F):
    C = []
    k = len(F[0]) + 1
    for f1 in F:
        for f2 in F:
            if f1[k-2] = minsup:
            F[0].append([f])
    k = 1
    while F[k-1] != []:
        C.append(candidate_gen(F[k-1]))
        F.append([])
        for c in C[k]:
            count = 0;
            for t in T:
                if compare_list(c,t):
                    count += 1
            if count*1.0/n >= minsup:
                F[k].append(c)
        k += 1
    U = []
    for f in F:
        for x in f:
            U.append(x)
    return U
T = [['A','B','C','D'],['B','C','E'],['A','B','C','E'],['B','D','E'],['A','B','C','D']]
F = apriori(T, 0.9)
print F