Skip to main content
SpringerLink
Log in

Using Kernels on Hierarchical Graphs in Automatic Classification of Designs

  • Conference paper
Graph-Based Representations in Pattern Recognition (GbRPR 2011)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6658))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1993), Washington, DC, pp. 207–216 (1993)

    Google Scholar 

  2. Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: ICDM 2005, pp. 74–81 (2005)

    Google Scholar 

  3. Borkowski, A., Grabska, E., Nikodem, P., Strug, B.: Searching for Innovative Structural Layouts by Means of Graph Grammars and Esvolutionary Optimization. In: Proc. 2nd Int. Structural Eng. And Constr. Conf., Rome (2003)

    Google Scholar 

  4. Collins, M., Duffy, N.: New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In: Proceedings of ACL 2002 (2002)

    Google Scholar 

  5. Csuhaj-Varj, E., Dassow, J., Kelemen, J., Paun, G.: Grammar systems. A grammatical approach to distribution and cooperation. In: Topics in Computer Mathematics, vol. 8. Gordon and Breach Science Publishers, Yverdon (1994)

    Google Scholar 

  6. Csuhaj-Varj, E., Dassow, J., Paun, G.: Dynamically controlled cooperating/distributed grammar systems. Information Sciences 69(1-2), 1–25 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Csuhaj-Varj, E., Vaszil, G.: On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms. Theoretical Computer Science 255(1-2), 511–538 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Csuhaj-Varj, E.: Grammar systems: A short survey. In: Proceedings of Grammar Systems Week 2004, Budapest, Hungary, July 5-9, pp. 141–157 (2004)

    Google Scholar 

  9. Dassow, J., Paun, G., Rozenberg, G.: Grammar systems. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 2, ch. 4, pp. 155–213. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Gartner, T.: A survey of kernels for structured data. SIGKDD Explorations 5(1), 49–58 (2003)

    Article  Google Scholar 

  11. Gartner, T.: Kernels for structured data. Series in Machine Perception and Artificial Intelligence. World Scientific, Singapore (2009)

    MATH  Google Scholar 

  12. Grabska, E.: Theoretical Concepts of Graphical Modelling. Part one: Realization of CP-graphs. Machine GRAPHICS and VISION 2(1), 3–38 (1993)

    Google Scholar 

  13. Grabska, E.: Theoretical Concepts of Graphical Modelling. Part two: CP-graph Grammars and Languages. Machine GRAPHICS and VISION 2(2), 149–178 (1993)

    MathSciNet  Google Scholar 

  14. Grabska, E., Palacz, W.: Hierarchical graphs in creative design. MG&V 9(1/2), 115–123 (2000)

    Google Scholar 

  15. Grabska, E.: Graphs and designing. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  16. Grabska, E., Nikodem, P., Strug, B.: Evolutionary Methods and Graph Grammars in Design and Optimization of Skeletal Structures Weimar. In: 11th International Workshop on Intelligent Computing in Engineering, Weimar (2004)

    Google Scholar 

  17. Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Mining and Knowledge Discovery: An International Journal 8(1), 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  18. Hoffman, C.M.: Geometric and Solid Modeling: An Introduction. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  19. Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13–23. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  20. Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized Kernels Between Labeled Graphs. In: ICML 2003, pp. 321–328 (2003)

    Google Scholar 

  21. Kelemen, J.: Syntactical models of cooperating/distributed problem solving. Journal of Experimental and Theoretical AI 3(1), 1–10 (1991)

    Article  Google Scholar 

  22. Mantyla, M.: An Introduction To Solid Modeling, vol. 87. Computer Science Press, Rockville (1988)

    Google Scholar 

  23. Martin, R.R., Stephenson, P.C.: Sweeping of Three-dimensional Objects. Computer Aided Design 22(4), 223–234 (1990)

    Article  MATH  Google Scholar 

  24. Martn-Vide, C., Mitrana, V.: Cooperation in contextual grammars. In: Kelemenov, A. (ed.) Proceedings of the MFCS 1998 Satellite Workshop on Grammar Systems, pp. 289–302. Silesian University, Opava (1998)

    Google Scholar 

  25. Moschitti, A., Pighin, D., Basili, R.: Tree kernels for Semantic Role Labeling, Special Issue on Semantic Role Labeling, Computational Linguistics Journal (2008)

    Google Scholar 

  26. Nikodem, P., Strug, B.: Graph Transformations in Evolutionary Design, Lecture Notes in Computer Science,vol 3070. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 456–461. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  27. Pighin, D., Moschitti, A.: On Reverse Feature Engineering of Syntactic Tree Kernels. In: Proceedings of the 2010 Conference on Natural Language Learning, Upsala, Sweden, July 2010. Association for Computational Linguistics (2010)

    Google Scholar 

  28. Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph. In: Transformations. Fundations, vol. 1. World Scientific, London (1997)

    Google Scholar 

  29. Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph. In: Transformations. Applications, Languages and Tools, vol. 2. World Scientific, London (1999)

    Google Scholar 

  30. Simeoni, M., Staniszkis, M.: Cooperating graph grammar systems. In: Paun, G., Salomaa, A. (eds.) Grammatical models of multi-agent systems, pp. 193–217. Gordon and Breach, Amsterdam (1999)

    Google Scholar 

  31. Strug, B., Slusarczyk, G.: Reasoning about designs through frequent patterns mining. Advanced Engineering Informatics 23, 361–369 (2009)

    Article  Google Scholar 

  32. Strug, B., Slusarczyk, G.: Frequent Pattern Mining in a Design Supporting System. Key Engineering Materials 450, 1–4 (2011)

    Article  Google Scholar 

  33. Vishwanathan, S.V.N., Borgwardt, K.M., Schraudolph, N.N.: Fast Computation of Graph Kernels. In: NIPS 2006, pp. 1449–1456 (2006)

    Google Scholar 

  34. Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: SIGMOD 2005 (Proc. of 2005 Int. Conf. on Management of Data) (2005)

    Google Scholar 

  35. Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD 2004 (Proc. of 2004 Int. Conf. on Management of Data) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Physics, Astronomy and Applied Computer Science, Jagiellonian University, Reymonta 4, Krakow, Poland

    Barbara Strug

Authors
  1. Barbara Strug
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Münster, Einsteinstraße 62, 48149, Münster, Germany

    Xiaoyi Jiang

  2. Institut de Robòtica i Informàtica Industrial, Universitat Politècnica de Catalunya, C. Llorens i Artigas 4-6, 08028, Barcelona, Spain

    Miquel Ferrer

  3. Dipartimento di Scienze Ambientali, Informatica, Statistica, Università Ca’ Foscari di Venezia, Via Torino 155, 30172, Venezia Mestre, Italy

    Andrea Torsello

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Strug, B. (2011). Using Kernels on Hierarchical Graphs in Automatic Classification of Designs. In: Jiang, X., Ferrer, M., Torsello, A. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2011. Lecture Notes in Computer Science, vol 6658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20844-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20844-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20843-0

  • Online ISBN: 978-3-642-20844-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation