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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, Washington, D.C., USA, vol. 22, pp. 207–216 (1993)
Alexander, C.: A Pattern Language: Towns, Buildings, Construction. Oxford University Press, New York (1977)
Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: ICDM 2005, Washington, DC, USA, pp. 74–81 (2005)
Bunke, H., Riesen, K.: Recent advances in graph-based pattern recognition with applications in document analysis. Pattern Recogn. 44(5), 1057–1067 (2011)
Gärtner, T.: A survey of kernels for structured data. ACM SIGKDD Explor. Newslett. 5(1), 49–58 (2003)
Gärtner, T.: Kernels for Structured Data, Series in Machine Perception and Artificial Intelligence, vol. 72. World Scientific, Singapore (2008)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining Knowl. Discov. 8(1), 53–87 (2004)
Haussler, D.: Convolution kernels on discrete structures. Technical report, Department of Computer Science, University of California at Santa Cruz (1999)
Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Principles of Data Mining and Knowledge Discovery, pp. 13–23 (2000)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML 2003, pp. 321–328 (2003)
Schölkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. Adaptive computation and machine learning series. MIT Press, Cambridge (2002)
Shin, K., Kuboyama, T.: A generalization of Haussler’s convolution kernel: mapping kernel. In: Cohen, W.W., McCallum, A., Roweis, S.T. (eds.) ICML 2008, vol. 307, pp. 944–951 (2008)
Strug, B., Ślusarczyk, G.: Reasoning about designs through frequent patterns mining. Adv. Eng. Inform. 23(4), 361–369 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Strug, B., Ślusarczyk, G., Grabska, E. (2018). Design Classification Based on Matching Graph Kernels. In: Gruca, A., Czachórski, T., Harezlak, K., Kozielski, S., Piotrowska, A. (eds) Man-Machine Interactions 5. ICMMI 2017. Advances in Intelligent Systems and Computing, vol 659. Springer, Cham. https://doi.org/10.1007/978-3-319-67792-7_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-67792-7_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67791-0
Online ISBN: 978-3-319-67792-7
eBook Packages: EngineeringEngineering (R0)