数据挖掘之apriori

本人python小白。学习数据挖掘中。。现在贴出python实现apriori算法
#创建c1
def createC1(data):
    c1 = set()
    for item in data:
        temp = frozenset(item);
        for tempitem in temp:
            tempitem = (int)(tempitem)
            c1.add(tempitem)
    return c1

#计算支持度
def countSupport(item,data):
    s = 0.0
    count = 0;
    countSum = 0;
    a = []
    if isinstance(item,int):
        a.append(item)
    else: a.extend(item)
    item1 = frozenset(a)
    for temp in data:
        temp = frozenset(temp)
        if item1.issubset(temp):
            count = count+1
        countSum = countSum+1
    s = count/countSum
    return s

#根据ck求lk
def createLkByCk(Ck,data,minsupport):
    LK = []
    support = []
    for item in Ck:
        temp = countSupport(item,data)
        if temp>minsupport:
           LK.append(item)#重后面增加保持一致
           support.append(temp)
    return LK,support
#判断先验
def judge(item,Lk):
    #c = set(it