Using Kernels on Hierarchical Graphs in Automatic Classification of Designs

摘要

In this paper the use of kernel methods in automatic classification of hierarchical graphs is presented. The classification is used as a basis for evaluation of designs in a computer aided design system. A kernel for hierarchical graphs based on a combination of tree and graph kernels is proposed. Hierarchical graphs-based representation used in design problems is briefly presented. The proposed approach is tested in experiment on a flat layout design task and preliminary result are also presented.