forked from censix/data-mining-project-aalto
/
test.py
218 lines (171 loc) · 6.51 KB
/
test.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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
#!/usr/bin/env python
# encoding: utf-8
"""
Testing code for the FP-growth implementation.
"""
import unittest
import fp_growth
from itertools import izip
from pprint import pprint
class NodeTester(object):
def __init__(self, case, node):
self.case = case
self.node = node
def child(self, item, count=None):
c = self.node.search(item)
self.case.failIf(c is None, 'no child with item %s' % item)
tester = NodeTester(self.case, c)
if count is not None:
tester.count(count)
return tester
def count(self, count):
self.case.assertEqual(self.node.count, count,
'expected count to be %d; instead it was %d' %
(count, self.node.count))
return self
def leaf(self):
self.case.assertTrue(self.node.leaf, 'node must be a leaf')
return self
class TreeTestCase(unittest.TestCase):
def setUp(self):
self.tree = fp_growth.FPTree()
self.root = NodeTester(self, self.tree.root)
def nodes(self, item):
return list(self.tree.nodes(item))
def assertPathsEqual(self, expected, actual):
actual = list(actual)
self.assertEqual(len(expected), len(actual))
for items, path in izip(expected, actual):
self.assertEqual(len(items), len(path))
for item, node in izip(items, path):
self.assertEqual(item, node.item)
class InsertionTests(TreeTestCase):
def testOneBranch(self):
self.tree.add('abc')
self.root.child('a', 1).child('b', 1).child('c', 1)
def testIndependentBranches(self):
self.tree.add('abc')
self.tree.add('def')
self.root.child('a', 1).child('b', 1).child('c', 1)
self.root.child('d', 1).child('e', 1).child('f', 1)
def testCommonPrefix(self):
self.tree.add('abcd')
self.tree.add('abde')
b = self.root.child('a', 2).child('b', 2)
b.child('c', 1).child('d', 1)
b.child('d', 1).child('e', 1)
class RouteTests(TreeTestCase):
def testRoutes(self):
self.tree.add('abc')
self.tree.add('bcd')
self.tree.add('cde')
self.assertEqual(1, len(self.nodes('a')))
self.assertEqual(2, len(self.nodes('b')))
self.assertEqual(3, len(self.nodes('c')))
self.assertEqual(2, len(self.nodes('d')))
self.assertEqual(1, len(self.nodes('e')))
def testRemoveOnly(self):
self.tree.add('ab')
self.assertEqual(1, len(self.nodes('b')))
b = self.root.child('a').child('b').node
self.assertTrue(self.root.child('a').node is b.parent)
b.parent.remove(b)
self.assertTrue(b.parent is None)
self.assertEqual(0, len(self.nodes('b')))
def testNeighbors(self):
self.tree.add('abc')
self.tree.add('bcd')
self.tree.add('cde')
left_c = self.root.child('a').child('b').child('c').node
middle_c = self.root.child('b').child('c').node
right_c = self.root.child('c').node
self.assertTrue(left_c.neighbor is middle_c)
self.assertTrue(middle_c.neighbor is right_c)
def testRemoveMiddle(self):
self.tree.add('abc')
self.tree.add('bcd')
self.tree.add('cde')
left_c = self.root.child('a').child('b').child('c').node
middle_c = self.root.child('b').child('c').node
right_c = self.root.child('c').node
self.assertEqual(3, len(self.nodes('c')))
middle_c.parent.remove(middle_c)
self.assertEqual(2, len(self.nodes('c')))
self.assertTrue(left_c.neighbor is right_c)
def testRemoveEnd(self):
self.tree.add('abc')
self.tree.add('bcd')
self.tree.add('cde')
left_c = self.root.child('a').child('b').child('c').node
middle_c = self.root.child('b').child('c').node
right_c = self.root.child('c').node
self.assertEqual(3, len(self.nodes('c')))
right_c.parent.remove(right_c)
self.assertEqual(2, len(self.nodes('c')))
self.assertTrue(left_c.neighbor is middle_c)
self.assertTrue(middle_c.neighbor is None)
class PrefixPathTests(TreeTestCase):
def testPaths(self):
self.tree.add('abc')
self.tree.add('bcd')
self.tree.add('cde')
self.assertPathsEqual(['abc', 'bc', 'c'], self.tree.prefix_paths('c'))
class RemovalTests(TreeTestCase):
def testLeafRemoval(self):
self.tree.add('abc')
c = self.root.child('a').child('b').child('c').node
b = c.parent
b.remove(c)
self.assertTrue(c.leaf)
def testMiddleRemoval(self):
self.tree.add('abc')
c = self.root.child('a').child('b').child('c').node
b = c.parent
a = b.parent
a.remove(b)
self.failIf(a.leaf, "the 'a' node should not be a leaf")
self.assertTrue(c.parent is a,
"the 'c' node should now be a child of 'a'")
def testMerging(self):
self.tree.add('abc')
self.tree.add('ac')
b = self.root.child('a').child('b').node
a = b.parent
a.remove(b)
self.root.child('a').child('c', 2)
class ConditionalTreeTests(TreeTestCase):
def testGeneration(self):
self.tree.add('abc')
self.tree.add('abd')
self.tree.add('ade')
# Test the tree's structure, just because I'm paranoid.
b = self.root.child('a', 3).child('b', 2)
b.child('c', 1)
b.child('d', 1)
self.root.child('a').child('d', 1).child('e', 1)
paths = list(self.tree.prefix_paths('d'))
ct = fp_growth.conditional_tree_from_paths(paths, 1)
root = NodeTester(self, ct.root)
a = root.child('a', 2)
a.child('b', 1).leaf()
self.assertEqual(1, len(a.node.children))
def testPruning(self):
self.tree.add('abc')
self.tree.add('abd')
self.tree.add('ac')
self.tree.add('abe')
self.tree.add('dc')
paths = list(self.tree.prefix_paths('c'))
ct = fp_growth.conditional_tree_from_paths(paths, 2)
root = NodeTester(self, ct.root)
root.child('a', 2).leaf()
self.assertEqual(1, len(root.node.children))
class FrequentSetTests(unittest.TestCase):
def testDuplicate(self):
raw = '25,52,274;71;71,274;52;25,52;274,71'
transactions = [line.split(',') for line in raw.split(';')]
itemsets = list(fp_growth.find_frequent_itemsets(transactions, 2))
self.assertEqual([['25'], ['52', '25'], ['274'], ['71'], ['52']],
itemsets)
if __name__ == '__main__':
unittest.main()