Using Co-occurring Graph Patterns in Computer Aided Design Evaluation

Different types of graphs can be used to represent designs. Such graphs can be generated by different methods, both automatic and interactive, as a result producing a large number of possible designs that have to be evaluated in some way. As in many real world design problems good designs share similar elements in this paper a method for design evaluation based on patterns’ co-occurrence is presented. It allows for the designs to be evaluated at the level of its representation, and thus do not require visualisation of designs. As a hypergraph-based representation is used for designs, patterns are selected by frequent graph mining algorithm. An application of the proposed evaluation method is also presented. A floor layout design example is used to illustrate the approach.

[1]  Ewa Grabska.  Graphs and Designing , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[2]  Erzsébet Csuhaj-Varjú,et al.  On context-free parallel communicating grammar systems: synchronization, communication, and normal forms , 2001, Theor. Comput. Sci..

[3]  Grazyna Slusarczyk,et al.  Reasoning about designs through frequent patterns mining , 2009, Adv. Eng. Informatics.

[4]  Erzsébet Csuhaj-Varjú,et al.  Dynamically controlled cooperating/distributed grammar systems , 1993, Inf. Sci..

[5]  Barbara Strug,et al.  Genetic Selection of Subgraphs for Automatic Reasoning in Design Systems , 2011, HAIS.

[6]  Annegret Habel,et al.  Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement , 1987, STACS.

[7]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[8]  Leszek Kotulski,et al.  Frequent Pattern Mining in a Design Supporting System , 2010 .

[9]  Barbara Strug,et al.  Graph Similarity Measure in Automatic Evaluation of Designs , 2011, ICMMI.

[10]  Marta Simeoni,et al.  Cooperating Graph Grammar Systems , 1999, Grammatical Models of Multi-Agent Systems.

[11]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[12]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[13]  Philip S. Yu,et al.  Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.

[14]  Barbara Strug,et al.  Graph Transformations in Evolutionary Design , 2004, ICAISC.

[15]  Barbara Strug,et al.  Using Graph Mining Approach to Automatic Reasoning in Design Support Systems , 2011, Computer Recognition Systems 4.

[16]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[17]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[18]  Philip S. Yu,et al.  Substructure similarity search in graph databases , 2005, SIGMOD '05.

[19]  Gheorghe Paun,et al.  Grammar Systems , 1997, Handbook of Formal Languages.

[20]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[21]  Takashi Washio,et al.  Applying the Apriori-based Graph Mining Method to Mutagenesis Data Analysis , 2001 .

[22]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).