%0 Journal Article
	%A Kittisak Kerdprasop and  Nittaya Kerdprasop
	%D 2007
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 11, 2007
	%T Approximate Frequent Pattern Discovery Over Data Stream
	%U https://publications.waset.org/pdf/9297
	%V 11
	%X Frequent pattern discovery over data stream is a hard
problem because a continuously generated nature of stream does not
allow a revisit on each data element. Furthermore, pattern discovery
process must be fast to produce timely results. Based on these
requirements, we propose an approximate approach to tackle the
problem of discovering frequent patterns over continuous stream.
Our approximation algorithm is intended to be applied to process a
stream prior to the pattern discovery process. The results of
approximate frequent pattern discovery have been reported in the
	%P 3439 - 3443