Concept Trees: Building Dynamic Concepts from Semi-structured Data Using Nature-Inspired Methods - Complex System Modelling and Control Through Intelligent Soft Computations - page 237

(a) If it matches exactly from the base of another tree up any branch, then it

can be added to that tree.

(b) If its base matches to a different node of another tree, then a link between

the two trees can be created.

'

2. If a smaller independent entity is added as a branch to a larger one, then it will
not be possible to access it without going through the larger entity first. This

means that the normal process of reconstruction will be to break at a tree branch
and move to a tree base, with the other direction being used less often.
3. Re-structuring will therefore also prefer to link between trees than to re-join
them permanently. This is because a link provides the appropriate navigation,
while the base nodes still remain for each tree, allowing them to be accessed
directly.
4. While linking is more practical, coherence would prefer permanent joins to
create larger trees and so under the correct conditions, a join should be preferred,
where any doubt would lead to a dynamic link instead. The re-joining process
requires more intelligence, which may be why it would be a more dif cult

automatic process.

5.4 Linking or Joining

1. Any reinforcement of an existing tree, based on adding a new group of concepts,
should always start from the base node.

(a) If it would start part of the way up a tree, then the process should form a
new tree instead.
(b) Similarly, when a new path is added to an existing tree, it must start from
the base only and traverse through any sub-path up to any leaf node. It can
then extend that leaf node if required.

2. For a linking example, if we have two trees — tree 1 and tree 2, then:

(a) The tree 2 is simply added as is, with a possible node link to tree 1 and
subsequent events can try to change or combine the structures further.
(b) This would be more in line with the general theory, but the idea of entropy
or concept coherence would prefer the next scenario if possible.

3. For a permanent join example, if we have two trees — tree 1 and tree 2, then:

(a) The tree 1 can be split at the node related to tree 2 ' s base node and that

branch combined with tree 2 for the new structure.
(b) Less likely is a permanent join the other way, but it is still possible. For
example, if tree 2 has a path from the base up that matches to a branch in tree
1. Then if the counts are OK, the path can be moved from tree 2 to tree 1.