python关联规则算法源代码_Python实现关联规则分析Apriori算法.pdfVIP

python关联规则算法源代码_Python实现关联规则分析Apriori 算法 #-*- coding:utf-8 -*- importsys reload(sys) sys.setdefaultencoding(utf8)defload_data_set(): data_set=[ [‘beer‘, ‘baby diapers‘, ‘shorts‘] , [‘baby diapers‘, ‘shorts‘] , [‘baby diapers‘, ‘milk‘] , [‘beer‘, ‘baby diapers‘, ‘shorts‘] , [‘beer‘, ‘milk‘] , [‘baby diapers‘, ‘milk‘] , [‘beer‘, ‘milk‘] , [‘beer‘, ‘baby diapers‘, ‘milk‘, ‘shorts‘] , [‘beer‘, ‘baby diapers‘, ‘milk‘] ]returndata_setdefcreate_C1(data_set): C1=set()for t indata_set:for item int: item_set=frozenset([item]) C1.add(item_set)returnC1defis_apriori(Ck_item, Lksub1):for item inCk_item: sub_Ck= Ck_item -frozenset([item])if sub_Ck not inLksub1:returnFalsereturnTruedefcreate_Ck(Lksub1, k): Ck=set() len_Lksub1=len(Lksub1) list_Lksub1=list(Lksub1)for i inrange(len_Lksub1):for j in range(1, len_Lksub1): l1=list(list_Lksub1[i]) l2=list(list_Lksub1[j]) l1.sort() l2.sort()if l1[0:k-2] l2[0:k-2]: Ck_item= list_Lksub1[i] |list_Lksub1[j]ifis_apriori(Ck_item, Lksub1): Ck.add(Ck_item)returnCkdefgenerate_Lk_by_Ck(data_set, Ck, min_support, support_data): Lk=set() item_count={}for t indata_set:for item inCk:ifitem.issubset(t):if item not initem_count: item_count[item]= 1 else: item_count[item]+= 1t_num=float(len(data_set))for item initem_count:if (item_count[item] / t_num) =min_support: Lk.add(item) support_data[item]= item_count[item] /t_numreturnLkdefgenerate_L(data_set, k, min_support): support_data={} C1=create_C1(data_set) L1=generate_Lk_by_Ck(data_set, C1, min_support, support_data) Lksub1=L1.copy() L=[] L.append(Lksub1)for i in range(2, k+1): Ci=create_Ck(Lksub1, i) Li=generate_Lk_by_Ck(data_set, Ci, min_support, support_data) Lksub1=Li.copy() L.append(Lksub1)returnL, support_datadefgenerate_big_rules(L, support_data, min_conf): big_rule_list=[] sub_set_list=[]for i inrange(0, len(L)):for freq_set inL[i]:for sub_set insub_set_list:ifsub_set.issubset(freq_set): conf= support_data[freq_set] / support_data[freq_set -sub_