forked from asaini/Apriori
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathapriori.py
142 lines (107 loc) · 4.42 KB
/
apriori.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
"""
Description : Simple Python implementation of the Apriori Algorithm
Author : Abhinav Saini([email protected])
Credits : Cesare Zavattari([email protected]) for making suggestions and refactoring code
Usage:
$python apriori.py DATASET.csv minSupport minConfidence
Eg.
$ python apriori.py DATASET.csv 0.15 0.6
"""
import sys
import re
from itertools import chain, combinations
from collections import defaultdict
def subsets(arr):
""" Returns non empty subsets of arr"""
return chain(*[combinations(arr,i + 1) for i,a in enumerate(arr)])
def returnItemsWithMinSupport(itemSet, transactionList, minSupport, freqSet):
"""calculates the support for items in the itemSet and returns a subset of the itemSet
each of whose elements satisfies the minimum support"""
_itemSet = set()
localSet = defaultdict(int)
for item in itemSet:
for transaction in transactionList:
if item.issubset(transaction):
freqSet[item] += 1
localSet[item] += 1
for item,count in localSet.items():
support = float(count)/len(transactionList)
if support >= minSupport:
_itemSet.add(item)
return _itemSet
def joinSet(itemSet,length):
"""Join a set with itself and returns the n-element itemsets"""
return set([i.union(j) for i in itemSet for j in itemSet if len(i.union(j)) == length])
def getItemSetTransactionList(data_iterator):
transactionList = list()
itemSet = set()
for record in data_iterator:
transaction = frozenset(record)
transactionList.append(transaction)
for item in transaction:
itemSet.add(frozenset([item])) # Generate 1-itemSets
return itemSet, transactionList
def runApriori(data_iter, minSupport, minConfidence):
"""
run the apriori algorithm. data_iter is a record iterator
Return both:
- items (tuple, support)
- rules ((pretuple, posttuple), confidence)
"""
itemSet, transactionList = getItemSetTransactionList(data_iter)
freqSet = defaultdict(int)
largeSet = dict() # Global dictionary which stores (key=n-itemSets,value=support) which satisfy minSupport
assocRules = dict() # Dictionary which stores Association Rules
oneCSet = returnItemsWithMinSupport(itemSet, transactionList, minSupport, freqSet)
currentLSet = oneCSet
k = 2
while(currentLSet != set([])):
largeSet[k-1] = currentLSet
currentLSet = joinSet(currentLSet,k)
currentCSet = returnItemsWithMinSupport(currentLSet, transactionList, minSupport, freqSet)
currentLSet = currentCSet
k = k + 1
def getSupport(item):
"""local function which Returns the support of an item"""
return float(freqSet[item])/len(transactionList)
toRetItems=[]
for key,value in largeSet.items():
toRetItems.extend([(tuple(item), getSupport(item))
for item in value])
toRetRules=[]
for key,value in largeSet.items()[1:]:
for item in value:
_subsets = map(frozenset,[x for x in subsets(item)])
for element in _subsets:
remain = item.difference(element)
if len(remain)>0:
confidence = getSupport(item)/getSupport(element)
if confidence >= minConfidence:
toRetRules.append(((tuple(element),tuple(remain)),
confidence))
return toRetItems, toRetRules
def printResults(items, rules):
"""prints the generated itemsets and the confidence rules"""
for item, support in items:
print "item: %s , %.3f" % (str(item), support)
print "\n------------------------ rules:"
for rule, confidence in rules:
pre, post = rule
print "rule: %s ==> %s , %.3f" % (str(pre), str(post), confidence)
def dataFromFile(fname):
"""Function which reads from the file and yields a generator"""
file_iter = open(fname, 'rU')
for line in file_iter:
line = line.strip().rstrip(',') # Remove trailing comma
record = frozenset(line.split(','))
yield record
if __name__ == "__main__":
if len(sys.argv) < 4:
print """Insufficient Arguments\n
Usage :\n
\tpython apriori.py DATASET.csv minSupport minConfidence"""
sys.exit('System will exit')
minSupport = float(sys.argv[2])
minConfidence = float(sys.argv[3])
items, rules = runApriori(dataFromFile(sys.argv[1]), minSupport, minConfidence)
printResults(items,rules)