In all algorithms, the encoded symbols are extracted from program expression trees. The algorithms differ on the granularity of the encoded symbol, which are selected from whole trees, parts of trees, ...

Several experimental conditions are investigated. Firstly, two forms of initialisation of the membership values of unlabelled patterns are used; 1/c and 0. Secondly, the algorithms are run with ...