Strong analogies between relational structures involving some composition operators and a certain class of neural networks are described. The problem of learning the connections of the structure is addressed, and relevant learning procedures are proposed. An optimized performance index which has a strong logical flavor is proposed. Some significant implementation details are studied. Numerical examples illustrate various schemes of learning in relational structures of different levels of complexity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Discussion(0)
No comments yet. Be the first to comment.