Using Similarity of Graphs in Evaluation of Designs

• Autorzy: Strug B.
• Języki publikacji: EN

Abstrakty

EN

This paper deals with evaluating design on the basis of their internal structures in the form of graphs. A set containing graphs representing solutions of similar design tasks is used to search for frequently occurring subgraphs. On the basis of the results of the search the quality of new solutions is evaluated. Moreover the common subgraphs found are considered to be design patterns characterizing a given design task solutions. The paper presents the generic concept of such an approach as well as illustratesit by the small example of floor layout design.

Słowa kluczowe

EN

design evaluation; frequent subgraph mining; Design Similarity

• Wydawca: Oficyna Wydawnicza Politechniki Warszawskiej
• Czasopismo: Machine Dynamics Research
• Rocznik: 2015
• Tom: Vol. 39, No. 1
• Strony: 103--113
• Opis fizyczny: Bibliogr. 18 poz., tab., wykr.

Twórcy

autor

Strug B.

• Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University

Bibliografia

• 1. Agrawal R., Imielinski T., Swami A. (1993) Mining association, rules between sets of items in large databases. In: Proc. 1993, ACM-SIGMOD, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993. pp 207-216, ACM Press 1993.
• 2. Alexander Ch., A Pattern language, Towns, buildings, constructions, Oxford University Press, ISBN 0-19-501919-9, 1977.
• 3. Borkowski A., Grabska E., Nikodem P., Strug B. Searching for Innovative Structural Layouts by Means of Graph Grammars and Esvolutionary Optimization, Proc. 2nd ISEC Conf, 2nd International Conference on Structural and Construction Engineering, Rome, Italy, Sep. 23-26, System-based Vision for strategic and Creative Design, vols 1-3, pp. 475-480. Rome 2003.
• 4. Csuhaj-Varjú E. Grammar systems: A short survey, Proceedings of Grammar Systems Week 2004: 141-157, Budapest, Hungary, 2004.
• 5. Grabska E., Nikodem P., Strug B. Evolutionary Methods and Graph Grammars in Design and Optimization of Skeletal Structures 11th ICE -, Proceeding of the 11th Workshop of the European Group of I Intelligent Commputing in Engineering, EG-ICE11, pp 145-155 Weimar Germany, 2004.
• 6. Habel A., H. J. Kreowski H. J., Some structural aspects of hypergraph languages generated by hyperedge replacement, Lecture Notes in Computer Science 247, pp. 207-219, Springer, 1987.
• 7. 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), pp 53-87, Kluver, 2004.
• 8. Hoffman C. M., Geometric and Solid Modeling: An Introduction, Morgan Kaufmann, San Francisco, CA, 1989.
• 9. Inokuchi A., Washio T. Motoda H. A., An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Proc. of PKDD 2000, Proceedings of the 4th European Conference on Principles and Practice in Knowledge Discovery in databases, Lyon, France, Sep. 13-16, 2000, pp. 87–92, 2000.
• 10. Mantyla M., An Introduction To Solid Modeling, Computer Science Press, Rockville, MD, vol.87, 1988.
• 11. Nikodem P., Strug B. Graph Transformations in Evolutionary Design, ICAISC 2004, Lecture Notes in Computer Science 3070, pp. 456-461, Springer, 2004.
• 12. Rozenberg G. Handbook of Graph Grammars and Computing by Graph. Transformations, vol.1-3, World Scientific London, 1997-99.
• 13. Strug B., Ślusarczyk G., Reasoning about designs through frequent patterns mining, Advanced Engineering Informatics 23, pp. 361-369, 2009.
• 14. Strug B., Using graph mining approach to automatic reasoning in design support systems, Advances in Intelligent and Soft Computing, vol. 95, pp. 489-498, 2011.
• 15. Strug B., Genetic Selection of Subgraphs for Automatic Reasoning in Design Systems, Lecture Notes in Computer Science 6678, pp. 280-287, Springer, 2011.
• 16. Strug B., Graph Similarity Measure in Automatic Evaluation of Designs, Advances in Intelligent and Soft Computing, vol. 103, pp. 267-275, 2011.
• 17. Tomanek M. Searching for graph patterns and applications. MSc Thesis, Jagiellonian University (in Polish), 2009.
• 18. Yan X., Yu P. S., Han J., Substructure Similarity Search in Graph Databases, SIGMOD'05, Proceedings of the 2005 ACM SIGMOD Iinternational Conference on Management of Data, Baltimore, MD, USA , June 13-17, 2005 pp 766-777, 2005. doi; 10.1145/1066157.1066244.

Uwagi

PL

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.