TY - JFULL AU - Renáta Iváncsy and István Vajk PY - 2007/9/ TI - Automata Theory Approach for Solving Frequent Pattern Discovery Problems T2 - International Journal of Computer and Information Engineering SP - 2561 EP - 2567 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/15387 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 8, 2007 N2 - The various types of frequent pattern discovery problem, namely, the frequent itemset, sequence and graph mining problems are solved in different ways which are, however, in certain aspects similar. The main approach of discovering such patterns can be classified into two main classes, namely, in the class of the levelwise methods and in that of the database projection-based methods. The level-wise algorithms use in general clever indexing structures for discovering the patterns. In this paper a new approach is proposed for discovering frequent sequences and tree-like patterns efficiently that is based on the level-wise issue. Because the level-wise algorithms spend a lot of time for the subpattern testing problem, the new approach introduces the idea of using automaton theory to solve this problem. ER -