“…The addition of another parent only adds unnecessary complexity and increases the number of network parameters. Consequently, other authors [4,5,6,28,8] have proposed the use of more sophisticated methods to overcome these shortcomings, among which are: the use of the K2 algorithms [6,24,25,26,27,28,10,4], the Genetic Search [7,4], the Greedy Search [11,4], the Annealing Simulated [8,4], the Greedy Hill Climber [7,4] and the Repeated Hill Climber [7,4]. Although these algorithms have actually managed to attain performant classifiers, their application has resulted in the frequently and commonly encountered problem of structure-learning computational complexity owing to the increase in the number of descriptive variables.…”