Python實現資料採礦十大演算法之Apriori

最近剛學Python，就用Python寫了一個演算法，由於不熟練的原因，實現得並不好，但結果是對的，代碼如下：

# -*- coding: UTF8 -*-import sysimport copydef 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 Cdef 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 UT = [['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