Skip to main content
SpringerLink
Log in

Genetic Selection of Subgraphs for Automatic Reasoning in Design Systems

  • Conference paper
Hybrid Artificial Intelligent Systems (HAIS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6678))

Included in the following conference series:

Abstract

In this paper a hybrid artificial intelligence approach consisting of a genetic algorithm combined with frequent subgraphs mining and its use in a design system is presented. The design system uses hypergraphs as the internal representation. The frequent graphs mining approach is then used to find common elements in designs while genetic search is performed to reduce the size of the found set of frequent patterns. The application of this method to automatic evaluation of designs with some experimental results 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. Abraham, A., Corchado, E., Corchado, J.M.: Hybrid learning machines. Neurocomputing 72(13-15), 2729–2730 (2009)

    Article  Google Scholar 

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

    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 ISEC Conf., Rome, pp. 475–480 (2003)

    Google Scholar 

  4. Corchado, E., Abraham, A., de Carvalho, A.C.P.L.F.: Hybrid intelligent algorithms and applications. Information Science 180(14), 2633–2634 (2010)

    Article  MathSciNet  Google Scholar 

  5. Csuhaj-Varjú, E., Dassow, J., Kelemen, J.: Grammar systems. A grammatical approach to distribution and cooperation. Topics in Computer Mathematics 8 (1994)

    Google Scholar 

  6. De Jong, K., Arciszewski, T., Vyas, H.: An Overview of Evolutionary Computation and its Applications. In: AIE 1999, Warsaw, pp. 9–22 (1999)

    Google Scholar 

  7. Derrac, J., García, S., Herrera, F.: A first study on the use of coevolutionary algorithms for instance and feature selection. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds.) HAIS 2009. LNCS, vol. 5572, pp. 557–564. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  9. Grabska, E., Nikodem, P., Strug, B.: Evolutionary Methods and Graph Grammars in Design and Optimization of Skeletal Structures Weimar. In: 11th ICE 2004, Weimar (2004)

    Google Scholar 

  10. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  11. Habel, A., Kreowski, H.J.: Some structural aspects of hypergraph l anguages generated by hyperedge replacement. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 207–219. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Holland, J.H.: Adaptation in Natural and Artificial Systems, Ann. Arbor. Univ. of Michigan Press (1975)

    Google Scholar 

  14. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolutionary Programs. Springer, New York (1996)

    Book  MATH  Google Scholar 

  15. Nikodem, P., Strug, B.: Graph Transformations in Evolutionary Design. 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 

  16. Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph. Transformations 99, 1–3 (1997)

    Google Scholar 

  17. Simeoni, M., Staniszkis, M.: Cooperating graph grammar systems. In: Grammatical Models of Multi-Agent Systems, pp. 193–217. Gordon and Breach, Amsterdam (1999)

    Google Scholar 

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

    Article  Google Scholar 

  19. Strug, B., Ślusarczyk, G.: Frequent Pattern Mining in a Design Supporting System, Key Engineering Materials. Trans. Tech. Pub. 450, 1–4 (2011)

    Google Scholar 

  20. Tomanek, M.: Searching for graph patterns and applications, MSc thesis, Jagiellonian University, (2009) in polish

    Google Scholar 

  21. Wozniak, M., Zmyslony, M.: Designing Fusers on the Basis of Discriminants – Evolutionary and Neural Methods of Training. In: Graña Romay, M., Corchado, E., Garcia Sebastian, M.T. (eds.) HAIS 2010. LNCS, vol. 6076, pp. 590–597. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: SIGMOD 2005, pp. 766–777 (2005)

    Google Scholar 

  23. Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD 2004, pp. 335–346 (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. GICAP Research Group, University of Burgos, 09006, Burgos, Spain

    Emilio Corchado

  2. Wroclaw University of Technology, 50-370, Wroclaw, Poland

    Marek Kurzyński  & Michał Woźniak  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Strug, B. (2011). Genetic Selection of Subgraphs for Automatic Reasoning in Design Systems. In: Corchado, E., Kurzyński, M., Woźniak, M. (eds) Hybrid Artificial Intelligent Systems. HAIS 2011. Lecture Notes in Computer Science(), vol 6678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21219-2_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21219-2_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21218-5

  • Online ISBN: 978-3-642-21219-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation