@article{(Open Science Index):https://publications.waset.org/pdf/15387,
	  title     = {Automata Theory Approach for Solving Frequent Pattern Discovery Problems},
	  author    = {Renáta Iváncsy and  István Vajk},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {8},
	  year      = {2007},
	  pages     = {2562 - 2567},
	  ee        = {https://publications.waset.org/pdf/15387},
	  url   	= {https://publications.waset.org/vol/8},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 8, 2007},
	}