def test_replace_node(self):
# setup
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[node_x, node_y]
)
# build tree
tree = Tree()
tree.root = add_func
tree.update_program()
# replace input node
new_node = Node(NodeType.INPUT, name="z")
before_replace = list(tree.program)
tree.replace_node(node_x, new_node)
after_replace = list(tree.program)
# assert
self.assertTrue(before_replace == before_replace)
self.assertTrue(after_replace == after_replace)
self.assertFalse(before_replace == after_replace)
self.assertTrue(add_func.branches[0] is new_node)
def test_replace_node(self):
# setup
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[node_x, node_y])
# build tree
tree = Tree()
tree.root = add_func
tree.update_program()
# replace input node
new_node = Node(NodeType.INPUT, name="z")
before_replace = list(tree.program)
tree.replace_node(node_x, new_node)
after_replace = list(tree.program)
# assert
self.assertTrue(before_replace == before_replace)
self.assertTrue(after_replace == after_replace)
self.assertFalse(before_replace == after_replace)
self.assertTrue(add_func.branches[0] is new_node)
class TreeMutatorTests(unittest.TestCase):
def setUp(self):
self.config = {
"tree_generation": {
"method": "GROW_METHOD",
"initial_max_depth": 4
},
"mutation": {
"methods": [
"POINT_MUTATION", "HOIST_MUTATION", "SUBTREE_MUTATION",
"SHRINK_MUTATION", "EXPAND_MUTATION"
],
"probability":
1.0
},
"function_nodes": [{
"type": "FUNCTION",
"name": "ADD",
"arity": 2
}, {
"type": "FUNCTION",
"name": "SUB",
"arity": 2
}, {
"type": "FUNCTION",
"name": "MUL",
"arity": 2
}, {
"type": "FUNCTION",
"name": "DIV",
"arity": 2
}, {
"type": "FUNCTION",
"name": "COS",
"arity": 1
}, {
"type": "FUNCTION",
"name": "SIN",
"arity": 1
}, {
"type": "FUNCTION",
"name": "RAD",
"arity": 1
}],
"terminal_nodes": [{
"type": "CONSTANT",
"value": 1.0
}, {
"type": "CONSTANT",
"value": 2.0
}, {
"type": "INPUT",
"name": "x"
}],
"input_variables": [{
"type": "INPUT",
"name": "x"
}]
}
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
self.generator = TreeGenerator(self.config)
self.parser = TreeParser()
self.mutation = TreeMutation(self.config)
# create nodes
left_node = Node(NodeType.CONSTANT, value=1.0)
right_node = Node(NodeType.INPUT, name="x")
cos_func = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node])
sin_func = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node])
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func, sin_func])
# create tree
self.tree = Tree()
self.tree.root = add_func
self.tree.update_program()
self.tree.update_func_nodes()
self.tree.update_term_nodes()
def tearDown(self):
del self.config
del self.generator
del self.parser
def build_tree_str(self, tree):
tree_str = ""
for node in tree.program:
if hasattr(node, "name") and node.name is not None:
tree_str += "node:{0} addr:{1}\n".format(node.name, id(node))
else:
tree_str += "node:{0} addr:{1}\n".format(node.value, id(node))
return tree_str
def tree_equals(self, tree_1_str, tree_2_str):
if tree_1_str == tree_2_str:
return True
else:
return False
def mutated(self, tree, mutation_func, mutation_index=None):
tree_before = self.build_tree_str(self.tree)
mutation_func(tree, mutation_index)
tree_after = self.build_tree_str(self.tree)
print("Before Mutation")
print(tree_before)
print("\nAfter Mutation")
print(tree_after)
self.assertTrue(self.tree_equals(tree_before, tree_before))
self.assertTrue(self.tree_equals(tree_after, tree_after))
self.assertFalse(self.tree_equals(tree_before, tree_after))
def test_mutate_new_node_details(self):
# MUTATE NEW FUNCTION NODE DETAILS
for i in range(100):
func_node = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[])
node_details = self.mutation.mutate_new_node_details(func_node)
self.assertNotEquals(node_details["name"], func_node.name)
self.assertEquals(node_details["arity"], func_node.arity)
self.assertEquals(node_details["type"], func_node.node_type)
# MUTATE NEW TERMINAL NODE DETAILS
for i in range(100):
term_node = Node(NodeType.CONSTANT, value=1.0)
node_details = self.mutation.mutate_new_node_details(term_node)
if node_details["type"] == NodeType.CONSTANT:
self.assertNotEqual(node_details["value"], term_node.value)
elif node_details["type"] == NodeType.INPUT:
self.assertNotEqual(node_details["name"], term_node.name)
# MUTATE NEW CLASS FUNCTION NODE DETAILS
self.config["function_nodes"] = [{
"type": "CLASS_FUNCTION",
"name": "GREATER_THAN",
"arity": 2,
"data_range": {
"lower_bound": 0.0,
"upper_bound": 10.0,
"decimal_places": 0,
}
}, {
"type": "CLASS_FUNCTION",
"name": "LESS_THAN",
"arity": 2,
"data_range": {
"lower_bound": 0.0,
"upper_bound": 10.0,
"decimal_places": 0,
}
}, {
"type": "CLASS_FUNCTION",
"name": "EQUALS",
"arity": 2,
"decimal_precision": 2
}]
mutation = TreeMutation(self.config)
for i in range(100):
class_func_node = Node(NodeType.CLASS_FUNCTION,
name="GREATER_THAN",
arity=2)
node_details = mutation.mutate_new_node_details(class_func_node)
self.assertNotEquals(node_details["name"], class_func_node.name)
self.assertEquals(node_details["arity"], class_func_node.arity)
self.assertEquals(node_details["type"], class_func_node.node_type)
def test_point_mutation(self):
print "---------- POINT MUATION! ----------"
self.mutated(self.tree, self.mutation.point_mutation)
def test_hoist_mutation(self):
print "---------- HOIST MUATION! ----------"
self.mutated(self.tree, self.mutation.hoist_mutation, 3)
def test_SUBTREE_MUTATION(self):
print "---------- SUBTREE MUATION! ----------"
self.mutated(self.tree, self.mutation.subtree_mutation, 3)
def test_shrink_mutation(self):
print "---------- SHRINK MUATION! ----------"
self.mutated(self.tree, self.mutation.shrink_mutation, 3)
def test_expansion_mutation(self):
print "---------- EXPANSION MUATION! ----------"
self.mutated(self.tree, self.mutation.expansion_mutation, 3)
def test_mutate(self):
print "MUTATE!"
tree_before = self.build_tree_str(self.tree)
self.mutation.mutate(self.tree)
tree_after = self.build_tree_str(self.tree)
print "----->", self.mutation.method
print("Before Mutation")
print(tree_before)
print("\nAfter Mutation")
print(tree_after)
self.assertTrue(self.tree_equals(tree_before, tree_before))
self.assertTrue(self.tree_equals(tree_after, tree_after))
self.assertFalse(self.tree_equals(tree_before, tree_after))
class TreeMutatorTests(unittest.TestCase):
def setUp(self):
self.config = {
"tree_generation": {
"method": "GROW_METHOD",
"initial_max_depth": 4
},
"mutation": {
"methods": [
"POINT_MUTATION",
"HOIST_MUTATION",
"SUBTREE_MUTATION",
"SHRINK_MUTATION",
"EXPAND_MUTATION"
],
"probability": 1.0
},
"function_nodes": [
{"type": "FUNCTION", "name": "ADD", "arity": 2},
{"type": "FUNCTION", "name": "SUB", "arity": 2},
{"type": "FUNCTION", "name": "MUL", "arity": 2},
{"type": "FUNCTION", "name": "DIV", "arity": 2},
{"type": "FUNCTION", "name": "COS", "arity": 1},
{"type": "FUNCTION", "name": "SIN", "arity": 1},
{"type": "FUNCTION", "name": "RAD", "arity": 1}
],
"terminal_nodes": [
{"type": "CONSTANT", "value": 1.0},
{"type": "CONSTANT", "value": 2.0},
{"type": "INPUT", "name": "x"}
],
"input_variables": [
{"type": "INPUT", "name": "x"}
]
}
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
self.generator = TreeGenerator(self.config)
self.parser = TreeParser()
self.mutation = TreeMutation(self.config)
# create nodes
left_node = Node(NodeType.CONSTANT, value=1.0)
right_node = Node(NodeType.INPUT, name="x")
cos_func = Node(
NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node]
)
sin_func = Node(
NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node]
)
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func, sin_func]
)
# create tree
self.tree = Tree()
self.tree.root = add_func
self.tree.update_program()
self.tree.update_func_nodes()
self.tree.update_term_nodes()
def tearDown(self):
del self.config
del self.generator
del self.parser
def build_tree_str(self, tree):
tree_str = ""
for node in tree.program:
if hasattr(node, "name") and node.name is not None:
tree_str += "node:{0} addr:{1}\n".format(node.name, id(node))
else:
tree_str += "node:{0} addr:{1}\n".format(node.value, id(node))
return tree_str
def tree_equals(self, tree_1_str, tree_2_str):
if tree_1_str == tree_2_str:
return True
else:
return False
def mutated(self, tree, mutation_func, mutation_index=None):
tree_before = self.build_tree_str(self.tree)
mutation_func(tree, mutation_index)
tree_after = self.build_tree_str(self.tree)
print("Before Mutation")
print(tree_before)
print("\nAfter Mutation")
print(tree_after)
self.assertTrue(self.tree_equals(tree_before, tree_before))
self.assertTrue(self.tree_equals(tree_after, tree_after))
self.assertFalse(self.tree_equals(tree_before, tree_after))
def test_mutate_new_node_details(self):
# MUTATE NEW FUNCTION NODE DETAILS
for i in range(100):
func_node = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[]
)
node_details = self.mutation.mutate_new_node_details(func_node)
self.assertNotEquals(node_details["name"], func_node.name)
self.assertEquals(node_details["arity"], func_node.arity)
self.assertEquals(node_details["type"], func_node.node_type)
# MUTATE NEW TERMINAL NODE DETAILS
for i in range(100):
term_node = Node(
NodeType.CONSTANT,
value=1.0
)
node_details = self.mutation.mutate_new_node_details(term_node)
if node_details["type"] == NodeType.CONSTANT:
self.assertNotEqual(node_details["value"], term_node.value)
elif node_details["type"] == NodeType.INPUT:
self.assertNotEqual(node_details["name"], term_node.name)
# MUTATE NEW CLASS FUNCTION NODE DETAILS
self.config["function_nodes"] = [
{
"type": "CLASS_FUNCTION",
"name": "GREATER_THAN",
"arity": 2,
"data_range": {
"lower_bound": 0.0,
"upper_bound": 10.0,
"decimal_places": 0,
}
},
{
"type": "CLASS_FUNCTION",
"name": "LESS_THAN",
"arity": 2,
"data_range": {
"lower_bound": 0.0,
"upper_bound": 10.0,
"decimal_places": 0,
}
},
{
"type": "CLASS_FUNCTION",
"name": "EQUALS",
"arity": 2,
"decimal_precision": 2
}
]
mutation = TreeMutation(self.config)
for i in range(100):
class_func_node = Node(
NodeType.CLASS_FUNCTION,
name="GREATER_THAN",
arity=2
)
node_details = mutation.mutate_new_node_details(class_func_node)
self.assertNotEquals(node_details["name"], class_func_node.name)
self.assertEquals(node_details["arity"], class_func_node.arity)
self.assertEquals(node_details["type"], class_func_node.node_type)
def test_point_mutation(self):
print "---------- POINT MUATION! ----------"
self.mutated(self.tree, self.mutation.point_mutation)
def test_hoist_mutation(self):
print "---------- HOIST MUATION! ----------"
self.mutated(self.tree, self.mutation.hoist_mutation, 3)
def test_SUBTREE_MUTATION(self):
print "---------- SUBTREE MUATION! ----------"
self.mutated(self.tree, self.mutation.subtree_mutation, 3)
def test_shrink_mutation(self):
print "---------- SHRINK MUATION! ----------"
self.mutated(self.tree, self.mutation.shrink_mutation, 3)
def test_expansion_mutation(self):
print "---------- EXPANSION MUATION! ----------"
self.mutated(self.tree, self.mutation.expansion_mutation, 3)
def test_mutate(self):
print "MUTATE!"
tree_before = self.build_tree_str(self.tree)
self.mutation.mutate(self.tree)
tree_after = self.build_tree_str(self.tree)
print "----->", self.mutation.method
print("Before Mutation")
print(tree_before)
print("\nAfter Mutation")
print(tree_after)
self.assertTrue(self.tree_equals(tree_before, tree_before))
self.assertTrue(self.tree_equals(tree_after, tree_after))
self.assertFalse(self.tree_equals(tree_before, tree_after))
class TreeParserTests(unittest.TestCase):
def setUp(self):
random.seed(10)
self.config = {
"max_population": 10,
"tree_generation": {
"method": "FULL_METHOD",
"initial_max_depth": 4
},
"function_nodes": [
{"type": "FUNCTION", "name": "ADD", "arity": 2},
{"type": "FUNCTION", "name": "SUB", "arity": 2},
{"type": "FUNCTION", "name": "MUL", "arity": 2},
{"type": "FUNCTION", "name": "DIV", "arity": 2},
{"type": "FUNCTION", "name": "COS", "arity": 1},
{"type": "FUNCTION", "name": "SIN", "arity": 1}
],
"terminal_nodes": [
{"type": "CONSTANT", "value": 1.0},
{"type": "INPUT", "name": "x"},
{"type": "INPUT", "name": "y"},
{"type": "INPUT", "name": "z"}
],
"input_variables": [
{"name": "x"},
{"name": "y"},
{"name": "z"}
]
}
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
self.generator = TreeGenerator(self.config)
self.parser = TreeParser()
# create nodes
left_node = Node(NodeType.CONSTANT, value=1.0)
right_node = Node(NodeType.CONSTANT, value=2.0)
cos_func = Node(
NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node]
)
sin_func = Node(
NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node]
)
add_func = Node(
NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func, sin_func]
)
# create tree
self.tree = Tree()
self.tree.root = add_func
self.tree.update_program()
self.tree.update_func_nodes()
self.tree.update_term_nodes()
def tearDown(self):
del self.config
del self.generator
del self.parser
def test_parse_tree(self):
# self.parser.print_tree(tree.root)
program = self.parser.parse_tree(self.tree, self.tree.root)
for i in program:
if i.name is not None:
print i.name
else:
print i.value
self.assertEquals(self.tree.size, 5)
self.assertEquals(self.tree.depth, 2)
self.assertEquals(len(self.tree.func_nodes), 2)
self.assertEquals(len(self.tree.term_nodes), 2)
self.assertEquals(len(self.tree.input_nodes), 0)
def test_parse_equation(self):
# self.parser.print_tree(tree.root)
equation = self.parser.parse_equation(self.tree.root)
self.assertEquals(equation, "((COS(1.0)) ADD (SIN(2.0)))")
def test_tree_to_dict(self):
solution = {
'program': [
{'type': 'CONSTANT', 'value': 1.0},
{'arity': 1, 'type': 'FUNCTION', 'name': 'COS'},
{'type': 'CONSTANT', 'value': 2.0},
{'arity': 1, 'type': 'FUNCTION', 'name': 'SIN'},
{'arity': 2, 'type': 'FUNCTION', 'root': True, 'name': 'ADD'}
]
}
results = self.parser.tree_to_dict(self.tree, self.tree.root)
self.assertEquals(results["program"], solution["program"])