def test_generate_eq_function(self):
# create terminal nodes
term_node = Node(NodeType.CONSTANT, value=100.0)
input_node = Node(NodeType.INPUT, name="x")
# create function nodes
mul_func = Node(NodeType.FUNCTION,
name="MUL",
arity=2,
branches=[input_node, term_node])
rad_func = Node(NodeType.FUNCTION,
name="RAD",
arity=1,
branches=[mul_func])
sin_func = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[rad_func])
# create tree
tree = Tree()
tree.root = sin_func
tree.update()
# generate equation function
eq_func = evaluator.generate_eq_function(tree, self.functions,
self.config)
# assert
self.assertIsNotNone(eq_func)
self.assertEquals(round(eq_func(1), 4), 0.9848)
def generate_func_node(self, random=True):
node = None
if random:
node = sample(self.config["function_nodes"], 1)[0]
tree_type = self.gen_config.get("tree_type", "SYMBOLIC_REGRESSION")
if tree_type == "SYMBOLIC_REGRESSION":
func_node = Node(
NodeType.FUNCTION,
name=node["name"],
arity=node["arity"],
branches=[]
)
elif tree_type == "CLASSIFICATION_TREE":
node = self.resolve_class_function(node)
class_attribute = sample(self.config["class_attributes"], 1)[0]
func_node = Node(
NodeType.CLASS_FUNCTION,
name=node["name"],
class_attribute=class_attribute,
arity=node["arity"],
branches=[],
value=node.get("value", None)
)
else:
err = "Unrecognised tree generation type"
raise RuntimeError(err)
return func_node
def test_eval_tree(self):
# create terminal nodes
term_node = Node(NodeType.CONSTANT, value=100.0)
input_node = Node(NodeType.INPUT, name="x")
# create function nodes
mul_func = Node(NodeType.FUNCTION,
name="MUL",
arity=2,
branches=[input_node, term_node])
rad_func = Node(NodeType.FUNCTION,
name="RAD",
arity=1,
branches=[mul_func])
sin_func = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[rad_func])
# create tree
tree = Tree()
tree.root = sin_func
tree.update()
# evaluate tree
score, output = evaluator.eval_tree(tree, self.functions, self.config)
self.assertEquals(round(score, 7), 0.5000001)
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 generate_new_node(self, details):
if details is None:
return None
elif details["type"] == NodeType.FUNCTION:
return Node(NodeType.FUNCTION,
name=details["name"],
arity=details["arity"],
branches=[])
elif details["type"] == NodeType.CLASS_FUNCTION:
return Node(NodeType.CLASS_FUNCTION,
name=details["name"],
arity=details["arity"],
branches=[])
elif details["type"] == NodeType.INPUT:
return Node(NodeType.INPUT, name=details["name"])
elif details["type"] == NodeType.CONSTANT:
return Node(NodeType.CONSTANT,
name=details.get("name", None),
value=details["value"])
elif details["type"] == NodeType.RANDOM_CONSTANT:
resolved_details = self.generator.resolve_random_constant(details)
return Node(NodeType.CONSTANT,
name=resolved_details.get("name", None),
value=resolved_details["value"])
def evaluate_node(node, stack, functions, config):
try:
if node.is_terminal():
# obtain terminal node data and add to stack
value = node.value
node.value = [value for i in range(config["data"]["rows"])]
stack.append(node)
elif node.is_input():
# convert input node to terminal node
node_data = config["data"][node.name]
term_node = Node(NodeType.CONSTANT, value=node_data)
stack.append(term_node)
elif node.is_function():
# get input data to function from stack
input_data = [stack.pop().value for i in xrange(node.arity)]
# execute function
function = functions.get_function(node.name)
func_output = []
for data_row in zip(*input_data):
func_output.append(function(*data_row))
# push result back to stack
result_node = Node(NodeType.CONSTANT, value=func_output)
stack.append(result_node)
except:
raise
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_analyze_children_inputs_only(self):
term_node_1 = Node(NodeType.INPUT, name="x")
term_node_2 = Node(NodeType.INPUT, name="y")
func_node = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[term_node_1, term_node_2])
result = editor.analyze_children(func_node)
self.assertEquals(result, (False, False, True, False))
def test_analyze_children_contains_zero(self):
term_node_1 = Node(NodeType.CONSTANT, value=0.0)
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
func_node = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[term_node_1, term_node_2])
result = editor.analyze_children(func_node)
self.assertEquals(result, (True, False, False, True))
class NodeTests(unittest.TestCase):
def setUp(self):
self.left_node = Node(NodeType.CONSTANT, value=1.0)
self.left_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.right_node = Node(NodeType.CONSTANT, value=2.0)
self.right_node_2 = Node(NodeType.CONSTANT, value=2.0)
self.binary_node = Node(
NodeType.FUNCTION,
arity=2,
branches=[self.left_node, self.right_node]
)
def test_has_value_node(self):
# assert left branch
res = self.binary_node.has_value_node(self.left_node)
self.assertEquals(res, 0)
# assert right branch
res = self.binary_node.has_value_node(self.right_node)
self.assertEqual(res, 1)
# assert fail left branch
res = self.binary_node.has_value_node(self.left_node_2)
self.assertFalse(res)
# assert fail right branch
res = self.binary_node.has_value_node(self.right_node_2)
self.assertFalse(res)
def test_equal(self):
term_node = Node(NodeType.CONSTANT, value=2)
# assert UNARY_OP node
unary_node = Node(NodeType.FUNCTION, name="SIN")
self.assertTrue(unary_node.equals(unary_node))
self.assertFalse(unary_node.equals(term_node))
# assert BINARY_OP node
binary_node = Node(NodeType.FUNCTION, name="ADD")
self.assertTrue(binary_node.equals(binary_node))
self.assertFalse(binary_node.equals(term_node))
# assert TERM node
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.assertTrue(term_node_2.equals(term_node_2))
self.assertFalse(term_node_2.equals(term_node))
# assert INPUT node
input_node = Node(NodeType.INPUT, name="x")
self.assertTrue(input_node.equals(input_node))
self.assertFalse(input_node.equals(term_node))
class NodeTests(unittest.TestCase):
def setUp(self):
self.left_node = Node(NodeType.CONSTANT, value=1.0)
self.left_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.right_node = Node(NodeType.CONSTANT, value=2.0)
self.right_node_2 = Node(NodeType.CONSTANT, value=2.0)
self.binary_node = Node(NodeType.FUNCTION,
arity=2,
branches=[self.left_node, self.right_node])
def test_has_value_node(self):
# assert left branch
res = self.binary_node.has_value_node(self.left_node)
self.assertEquals(res, 0)
# assert right branch
res = self.binary_node.has_value_node(self.right_node)
self.assertEqual(res, 1)
# assert fail left branch
res = self.binary_node.has_value_node(self.left_node_2)
self.assertFalse(res)
# assert fail right branch
res = self.binary_node.has_value_node(self.right_node_2)
self.assertFalse(res)
def test_equal(self):
term_node = Node(NodeType.CONSTANT, value=2)
# assert UNARY_OP node
unary_node = Node(NodeType.FUNCTION, name="SIN")
self.assertTrue(unary_node.equals(unary_node))
self.assertFalse(unary_node.equals(term_node))
# assert BINARY_OP node
binary_node = Node(NodeType.FUNCTION, name="ADD")
self.assertTrue(binary_node.equals(binary_node))
self.assertFalse(binary_node.equals(term_node))
# assert TERM node
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.assertTrue(term_node_2.equals(term_node_2))
self.assertFalse(term_node_2.equals(term_node))
# assert INPUT node
input_node = Node(NodeType.INPUT, name="x")
self.assertTrue(input_node.equals(input_node))
self.assertFalse(input_node.equals(term_node))
def test_str(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node])
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# assert
self.assertEquals(str(self.tree), "(x ADD y)")
def test_equal(self):
# create nodes
left_node_1 = Node(NodeType.CONSTANT, value=1.0)
right_node_1 = Node(NodeType.CONSTANT, value=2.0)
left_node_2 = Node(NodeType.CONSTANT, value=3.0)
right_node_2 = Node(NodeType.CONSTANT, value=4.0)
cos_func_1 = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_1])
sin_func_1 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_1])
cos_func_2 = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_2])
sin_func_2 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_2])
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func_1, sin_func_1])
sub_func = Node(NodeType.FUNCTION,
name="SUB",
arity=2,
branches=[sin_func_2, cos_func_2])
# create tree_1
tree_1 = Tree()
tree_1.root = add_func
tree_1.update()
# create tree_2
tree_2 = Tree()
tree_2.root = sub_func
tree_2.update()
self.assertTrue(tree_1.equals(tree_1))
self.assertFalse(tree_1.equals(tree_2))
self.assertTrue(tree_2.equals(tree_2))
self.assertFalse(tree_2.equals(tree_1))
def test_edit_tree_inputs_and_terminals(self):
# TEST INPUTS AND TERMINALS
term_node_1 = Node(NodeType.CONSTANT, value=2.0)
term_node_2 = Node(NodeType.INPUT, name="x")
func_node = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[term_node_1, term_node_2])
print "BEFORE:", func_node
tree = Tree()
tree.root = func_node
tree.depth = 3
editor.edit_tree(tree, tree.root, self.functions)
print "AFTER:", func_node
print
def generate_tree_from_dict(self, tree_dict):
tree = Tree()
stack = []
tree.tree_id = tree_dict["id"]
for node_dict in tree_dict["program"]:
node_type = node_dict["type"]
node = None
if node_type == NodeType.INPUT:
node = Node(
NodeType.INPUT,
name=node_dict.get("name", None)
)
tree.program.append(node)
stack.append(node)
elif node_type == NodeType.CONSTANT:
node = Node(
NodeType.CONSTANT,
name=node_dict.get("name", None),
value=node_dict.get("value", None)
)
tree.program.append(node)
stack.append(node)
elif node_type == NodeType.FUNCTION:
value_nodes = []
for i in xrange(node_dict["arity"]):
value_nodes.append(stack.pop())
node = Node(
NodeType.FUNCTION,
name=node_dict["name"],
arity=node_dict["arity"],
branches=value_nodes
)
tree.program.append(node)
stack.append(node)
if node_dict.get("root", False):
tree.root = node
return tree
def test_edit_tree_zero_only(self):
# TEST CONTAINS ZERO
term_node_1 = Node(NodeType.CONSTANT, value=0.0)
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
func_node = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[term_node_1, term_node_2])
print "BEFORE:", func_node
tree = Tree()
tree.root = func_node
tree.depth = 3
editor.edit_tree(tree, tree.root, self.functions)
print "AFTER:", func_node
print
self.assertEquals(func_node.value, 1.0)
def test_generate_eq_function_multivars(self):
# create terminal nodes
term_node = Node(NodeType.INPUT, name="var2")
input_node = Node(NodeType.INPUT, name="var1")
# create function nodes
div_func = Node(NodeType.FUNCTION,
name="DIV",
arity=2,
branches=[input_node, term_node])
# create tree
tree = Tree()
tree.root = div_func
tree.update()
# generate equation function
config = {
"input_variables": [{
"type": "INPUT",
"name": "var1"
}, {
"type": "INPUT",
"name": "var2"
}],
"functions": {
"ADD": "+",
"SUB": "-",
"MUL": "*",
"DIV": "/",
"POW": "**",
"SIN": "math.sin",
"COS": "math.cos",
"RAD": "math.radians",
"LN": "math.ln",
"LOG": "math.log"
}
}
eq_func = evaluator.generate_eq_function(tree, self.functions, config)
# assert
self.assertIsNotNone(eq_func)
self.assertEquals(eq_func(1.0, 2.0), 0.5)
def test_edit_tree_prune(self):
# TEST PRUNE
term_node_1 = Node(NodeType.CONSTANT, value=0.0)
term_node_2 = Node(NodeType.INPUT, name="x")
func_node = Node(NodeType.FUNCTION,
name="MUL",
arity=2,
branches=[term_node_1, term_node_2])
print "BEFORE:", func_node
tree = Tree()
tree.root = func_node
tree.depth = 3
editor.edit_tree(tree, tree.root, self.functions)
print "AFTER:", func_node
print
self.assertEquals(func_node.node_type, NodeType.CONSTANT)
self.assertIsNone(func_node.name)
self.assertEquals(func_node.value, 0)
def setUp(self):
self.left_node = Node(NodeType.CONSTANT, value=1.0)
self.left_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.right_node = Node(NodeType.CONSTANT, value=2.0)
self.right_node_2 = Node(NodeType.CONSTANT, value=2.0)
self.binary_node = Node(
NodeType.FUNCTION,
arity=2,
branches=[self.left_node, self.right_node]
)
def test_get_linked_node(self):
# setup
del self.tree.input_nodes[:]
left_node = Node(NodeType.INPUT, name="x")
right_node = Node(NodeType.INPUT, name="y")
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node, right_node])
self.tree.root = add_func
self.tree.program = self.t_parser.post_order_traverse(self.tree.root)
# pass test
linked_node = self.tree.get_linked_node(left_node)
self.assertTrue(linked_node is add_func)
linked_node = self.tree.get_linked_node(right_node)
self.assertTrue(linked_node is add_func)
# fail test
random_node = Node(NodeType.INPUT, name="z")
linked_node = self.tree.get_linked_node(random_node)
self.assertFalse(linked_node is add_func)
def setUp(self):
self.left_node = Node(NodeType.CONSTANT, value=1.0)
self.left_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.right_node = Node(NodeType.CONSTANT, value=2.0)
self.right_node_2 = Node(NodeType.CONSTANT, value=2.0)
self.binary_node = Node(NodeType.FUNCTION,
arity=2,
branches=[self.left_node, self.right_node])
def generate_term_node(self, random=True, index=None):
node_details = None
# get random terminal node details
if random:
node_details = sample(self.config["terminal_nodes"], 1)[0]
else:
node_details = self.config["terminal_nodes"][index]
# resolve if random constant
if node_details["type"] == NodeType.RANDOM_CONSTANT:
node_details = self.resolve_random_constant(node_details)
term_node = Node(
node_details["type"],
name=node_details.get("name", None),
value=node_details.get("value", None)
)
return term_node
def setUp(self):
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
term_node_1 = Node(NodeType.CONSTANT, value=0.0)
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
func_node_1 = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[term_node_1, term_node_2])
term_node_3 = Node(NodeType.CONSTANT, value=2.0)
term_node_4 = Node(NodeType.INPUT, name="x")
func_node_2 = Node(NodeType.FUNCTION,
name="MUL",
arity=2,
branches=[term_node_3, term_node_4])
self.tree = Node(NodeType.FUNCTION,
name="DIV",
arity=2,
branches=[func_node_1, func_node_2])
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 setUp(self):
self.config = {
"tree_generation": {
"initial_max_depth": 4
},
"crossover": {
"method": "POINT_CROSSOVER",
"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": "CONSTANT",
"value": 2.0
}, {
"type": "CONSTANT",
"value": 3.0
}, {
"type": "CONSTANT",
"value": 4.0
}, {
"type": "CONSTANT",
"value": 5.0
}, {
"type": "CONSTANT",
"value": 6.0
}, {
"type": "CONSTANT",
"value": 7.0
}, {
"type": "CONSTANT",
"value": 8.0
}, {
"type": "CONSTANT",
"value": 9.0
}, {
"type": "CONSTANT",
"value": 10.0
}],
"input_variables": [{
"type": "INPUT",
"name": "x"
}]
}
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
self.generator = TreeGenerator(self.config)
self.crossover = TreeCrossover(self.config)
self.parser = TreeParser()
# create nodes
left_node_1 = Node(NodeType.INPUT, name="x")
right_node_1 = Node(NodeType.CONSTANT, value=2.0)
node = Node(NodeType.CONSTANT, value=2.0)
left_node_2 = Node(NodeType.CONSTANT, value=3.0)
right_node_2 = Node(NodeType.CONSTANT, value=4.0)
cos_func_1 = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[left_node_1, right_node_1])
sin_func_1 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[node])
cos_func_2 = Node(NodeType.FUNCTION,
name="COS",
arity=1,
branches=[left_node_2])
sin_func_2 = Node(NodeType.FUNCTION,
name="SIN",
arity=1,
branches=[right_node_2])
add_func = Node(NodeType.FUNCTION,
name="ADD",
arity=2,
branches=[cos_func_1, sin_func_1])
sub_func = Node(NodeType.FUNCTION,
name="SUB",
arity=2,
branches=[sin_func_2, cos_func_2])
# create tree_1
self.tree_1 = Tree()
self.tree_1.root = add_func
self.tree_1.update()
print self.tree_1
# create tree_2
self.tree_2 = Tree()
self.tree_2.root = sub_func
self.tree_2.update()
def test_equal(self):
term_node = Node(NodeType.CONSTANT, value=2)
# assert UNARY_OP node
unary_node = Node(NodeType.FUNCTION, name="SIN")
self.assertTrue(unary_node.equals(unary_node))
self.assertFalse(unary_node.equals(term_node))
# assert BINARY_OP node
binary_node = Node(NodeType.FUNCTION, name="ADD")
self.assertTrue(binary_node.equals(binary_node))
self.assertFalse(binary_node.equals(term_node))
# assert TERM node
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.assertTrue(term_node_2.equals(term_node_2))
self.assertFalse(term_node_2.equals(term_node))
# assert INPUT node
input_node = Node(NodeType.INPUT, name="x")
self.assertTrue(input_node.equals(input_node))
self.assertFalse(input_node.equals(term_node))
def setUp(self):
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.t_parser = TreeParser()
self.tree = Tree()
node_x = Node(NodeType.INPUT, name="x")
node_y = Node(NodeType.INPUT, name="y")
node_z = Node(NodeType.INPUT, name="z")
self.tree.input_nodes.append(node_x)
self.tree.input_nodes.append(node_y)
self.tree.input_nodes.append(node_z)
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 test_equal(self):
term_node = Node(NodeType.CONSTANT, value=2)
# assert UNARY_OP node
unary_node = Node(NodeType.FUNCTION, name="SIN")
self.assertTrue(unary_node.equals(unary_node))
self.assertFalse(unary_node.equals(term_node))
# assert BINARY_OP node
binary_node = Node(NodeType.FUNCTION, name="ADD")
self.assertTrue(binary_node.equals(binary_node))
self.assertFalse(binary_node.equals(term_node))
# assert TERM node
term_node_2 = Node(NodeType.CONSTANT, value=1.0)
self.assertTrue(term_node_2.equals(term_node_2))
self.assertFalse(term_node_2.equals(term_node))
# assert INPUT node
input_node = Node(NodeType.INPUT, name="x")
self.assertTrue(input_node.equals(input_node))
self.assertFalse(input_node.equals(term_node))