def __init__(self):
self.tree_id = None
self.score = None
self.tree_type = None
self.root = None
self.depth = 0
self.size = 0
self.program = []
self.func_nodes = []
self.term_nodes = []
self.input_nodes = []
self.parser = TreeParser()
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 setUp(self):
self.config = {
"max_population":
10,
"tree_generation": {
"tree_type": "SYMBOLIC_REGRESSION",
"method": "RAMPED_HALF_AND_HALF_METHOD",
"initial_max_depth": 3
},
"function_nodes": [{
"type": "FUNCTION",
"arity": 2,
"name": "ADD"
}, {
"type": "FUNCTION",
"arity": 2,
"name": "SUB"
}, {
"type": "FUNCTION",
"arity": 2,
"name": "MUL"
}, {
"type": "FUNCTION",
"arity": 2,
"name": "DIV"
}, {
"type": "FUNCTION",
"arity": 1,
"name": "COS"
}, {
"type": "FUNCTION",
"arity": 1,
"name": "SIN"
}],
"terminal_nodes": [{
"type": "CONSTANT",
"value": 1.0
}, {
"type": "INPUT",
"name": "x"
}, {
"type": "INPUT",
"name": "y"
}, {
"type": "RANDOM_CONSTANT",
"data_range": {
"upper_bound": 10.0,
"lower_bound": -10.0,
"decimal_places": 1
}
}],
"input_variables": [{
"name": "x"
}, {
"name": "y"
}]
}
self.functions = GPFunctionRegistry("SYMBOLIC_REGRESSION")
self.generator = TreeGenerator(self.config)
self.parser = TreeParser()
def test_evaluate(self):
random.seed(10)
# solution = {
# "results":
# [
# {"score": 15726642.002161335},
# {"score": 359.25843589015597},
# {"score": 92155571.22132382},
# {"score": 26186.46142920347},
# {"score": 15649304.847552022},
# {"score": 188.86069156360125},
# {"score": 23439.33097274221},
# ]
# }
# setup
config = {
"max_population" : 10,
"max_generation" : 5,
"tree_generation" : {
"method" : "GROW_METHOD",
"initial_max_depth" : 3
},
"evaluator": {
"use_cache" : True
},
"selection" : {
"method" : "TOURNAMENT_SELECTION",
"tournament_size": 5
},
"crossover" : {
"method" : "POINT_CROSSOVER",
"probability" : 0.8
},
"mutation" : {
"methods": [
"POINT_MUTATION",
"HOIST_MUTATION",
"SUBTREE_MUTATION",
"SHRINK_MUTATION",
"EXPAND_MUTATION"
],
"probability" : 0.9
},
"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": "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}
],
"data_file" : "tests/data/sine.dat",
"input_variables" : [{"type": "INPUT", "name": "x"}],
"response_variables" : [{"name": "y"}]
}
parser = TreeParser()
population = TreeGenerator(config).init()
# create a dictionary of trees
data = {"config": config, "individuals": []}
for individual in population.individuals:
tree_json = parser.tree_to_dict(individual, individual.root)
data["individuals"].append(tree_json)
# make sure population size is equals to number of trees
population_size = len(population.individuals)
individuals = len(data["individuals"])
self.assertEquals(population_size, individuals)
# evaluating individuals
data = json.dumps(data)
host = "localhost"
port = 8080
req_type = "POST"
path = "evaluate"
response = self.transmit(host, port, req_type, path, data)
response = json.loads(response)
print response
def __init__(self, config):
self.config = config
self.gen_config = config["tree_generation"]
self.max_depth = self.gen_config.get("initial_max_depth", 0)
self.parser = TreeParser()
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 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)
