#!/usr/bin/env?python
#?-*-?coding:utf-8?-*-
#
#???Author??:???waikeungshen
#???Date????:???14/10/30?16:35:44
#???Desc????:???
#

#?關(guān)聯(lián)規(guī)則挖掘：Apriori算法
#?按照Apriori算法的基本思想來(lái)實(shí)現(xiàn)
#?Apriori?性質(zhì)：任一頻繁項(xiàng)集的所有非空子集也必須是頻繁的。

class?FrequentPattern:
????def?__init__（self?Itemset?sup）:
????????self.Itemset?=?Itemset
????????self.sup?=?sup

class?Apriori:
????def?__init__（self?ItemsBorght?min_sup）:
????????self.ItemsBorght?=?ItemsBorght
????????self.min_sup?=?min_sup

????def?get_1dim_frequent_item（self）:
????????‘‘‘
????????????得到1維頻繁項(xiàng)集
????????‘‘‘
????????FrequentItem?=?[]??#?頻繁項(xiàng)集
????????for?Items?in?ItemsBorght:
????????????for?item?in?Items:
????????????????if?list（item）?not?in?（i.Itemset?for?i?in?FrequentItem）:?#?如果不在，就添加一個(gè)
????????????????????FrequentItem.append（FrequentPattern（list（item）?1））
??????