Frequent Pattern Mining in a Design Supporting System


Article Preview

This paper deals with reasoning about designs using frequent pattern mining methods. It also describes a prototype system supporting design and reasoning, where graph theory is applied to the computational process. Searching a large database of solutions for frequently occurring patterns allows us both to retrieve solutions of similar design tasks and to evaluate newly created innovative solutions.



Edited by:

Daizhong Su, Qingbin Zhang and Shifan Zhu




L. Kotulski and G. Ślusarczyk, "Frequent Pattern Mining in a Design Supporting System ", Key Engineering Materials, Vol. 450, pp. 1-4, 2011

Online since:

November 2010




[1] E. Grabska, K. Grzesiak-Kopeć, J. Lembas, A. Łachwa, G. Ślusarczyk, Hypergraphs in Diagrammatic Design. Computer Vision and Graphics, Proceedings of the International Conference, ICCVG 2004, Springer, pp.111-117, (2006).


[2] R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases. In: Proc. 1993 ACM-SIGMOD int. conf. management of data (SIGMOD'93), Washington, DC, pp.207-216, (1993).


[3] X. Yan, P. S. Yu, J. Han, Substructure Similarity Search in Graph Databases, SIGMOD'05 (Proc. of 2005 Int. Conf. on Management of Data), pp.766-777, (2005).


[4] X. Yan, P. S. Yu, J. Han, Graph Indexing: A Frequent Structure-based Approach, SIGMOD'04 (Proc. of 2004 Int. Conf. On Management of Data), pp.335-346, (2004).


[5] D. Cook, L. Holder, (eds. ) Mining Graph Data, Wiley (2006).

[6] M. Tomanek, Searching for graph patterns and applications, MSc thesis, Jagiellonian University, 2009 (in Polish).

[7] B. Strug, G. Ślusarczyk, Reasoning about designs through frequent patterns mining, Advanced Engineering Informatics 23, 2009, pp.361-369.


Fetching data from Crossref.
This may take some time to load.