Robo Home | Toad | Changes | Preferences | AllPages

Segmentation Tree

This is my implementation of what Vic described in WikiTargeting/DynamicSegmentation.

The tree is binary, each internal node represent a segmentation choice. For exemple a DistanceNode? would discriminate data according to a distance threshold. At the moment the internal node types used are

The leaves of the tree contains the observations that fit in the segmentation obtained by following the path from the root to the leaf. When a leaf contains enough observations it is split. The factors used for splitting a leaf are

The tree is rebuild at the beginning of each round. When there is too much data to rebuild the tree completely it is just partially rebuild.

Two threads are used for the tree, one for inserting new observations and splitting leaves on the fly, another one is used for rebuilding the tree.

The tree can be saved at the end of a game, in fact just a symbolic representation of the internal nodes, at the moment this is disabled I haven't tested if it is valuable.

Comments & Questions

Robo Home | Toad | Changes | Preferences | AllPages
Edit text of this page | View other revisions
Last edited October 21, 2005 0:57 EST by Florent (diff)