Frequent pattern mining is the process of mining data in a set of items or some patterns from a large database. The resulted frequent set data supports the minimum support threshold. A frequent pattern is a pattern that occurs frequently in a dataset. Association rule mining is defined as to find out association rules that satisfy the predefined minimum support and confidence from a given data base. If an item set is said to be frequent, that item set supports the minimum support and confidence. A Frequent item set should appear in all the transaction of that data base. Discovering frequent item sets play a very important role in mining association rules, sequence rules, web log mining and many other interesting patterns among complex data. Data stream is a real time continuous, ordered sequence of items. It is an uninterrupted flow of a long sequence of data. Some real time examples of data stream data are sensor network data, telecommunication data, transactional data and scientific surveillances systems. These data produced trillions of updates every day. So it is very difficult to store the entire data. In that time some mining process is required. Data mining is the non-trivial process of identifying valid, original, potentially useful and ultimately understandable patterns in data. It is an extraction of the hidden predictive information from large data base. There are lots of algorithms used to find out the frequent item set. In that Apriori algorithm is the very first classical algorithm used to find the frequent item set. Apart from Apriori, lots of algorithms generated but they are similar to Apriori. They are based on prune and candidate generation. It takes more memory and time to find out the frequent item set. In this paper, we have studied about how the éclat algorithm is used in data streams to find out the frequent item sets. Éclat algorithm need not required candidate generation.

1. "Data mining techniques "by Arun k Pujari
2. Aggarwal, C. (2007). In C. Aggarwal (Ed. ), "Data streams: Models and algorithms". Springer.
3. "Data Mining: Introductory and Advanced Topics" Margaret H. Dunham
4. Ian H. Witten and Eibe Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann Publishers Inc. , San Francisco, CA, USA, 2nd edition, 2005.
5. "Mining frequent item sets in data streams using the weighted sliding window model"Pauray S. M. Tsai, 2009, Elsevier publication
6. "Mining frequent item sets over data streams using efficient window sliding technique" Hue-Fu Li, Suh-Li, 2009, Elsevier publication.
7. "Mining frequent item sets with normalized weight in continuous data streams" Yo-unghee Kim, Won Young Kim and Ungmo Kim 2010. Journal of information processing systems.
8. "Efficient mining of high utility patterns over data streams with a sliding window model" Chowdary Farha ahmed, Byeong-Soo Jeong, 2011. Springerlink. com
9. "Mining frequent patterns across multiple data streams" Jing Guo, Peng Zhang, Jianlong Tan and li Guo, 2011
10. www. borgelt. net/slides/fpm. pdf
11. "Compression and privacy preservation of data streams using moments"Anushree Gowtham Ringe, Deeksha Sood and Turga Toshniwal, 2011. Information journal of machine learning and computing.
12. "Data Streams: An Overview and Scientific Applications" Charu C. Aggarwal
13. Han, J. , Kamber, M. : "Data Mining Concepts and Techniques", Morgan Kaufmann Publishers, 2006
14. Agarwal R Srikant,:R:" fast algorithms for mining Association rules" 20th Int Conference.
15. Frequent item set mining data set repository, http:// fimi. cshelsinki. fi/data/

Association Rules Mining Data Mining Data Streams Éclat Algorithm Frequent Pattern Mining