Design classification based on matching graph kernels

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper deals with the problem of classification of designs according to their styles. The designs are represented by means of labelled, attributed graphs. The similarity between designs is calculated with the use of a new graph kernel and then used to predict if a given design belongs to a certain style of designs. The prediction process is performed by a classification algorithm. Examples of garden designs are used to present experimental results obtained by means of the presented method.

Cite

CITATION STYLE

APA

Strug, B., Ślusarczyk, G., & Grabska, E. (2018). Design classification based on matching graph kernels. In Advances in Intelligent Systems and Computing (Vol. 659, pp. 449–458). Springer Verlag. https://doi.org/10.1007/978-3-319-67792-7_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free