Revised ECLAT algorithm for frequent itemset mining

Abstract

Data mining is now a day becoming very important due to availability of large amount of data. Extracting important information from warehouse has become very tedious in some cases. One of the most important application of data mining is customer segmentation in marketing, demand analyzes, campaign management, Web usage mining, text mining, customer relationship and so on. Association rule mining is one of the important techniques of data mining used for discovering meaningful patterns from huge collection of data. Frequent item set mining play an important role in mining association rules in finding interesting patterns among complex data. Frequent Pattern Itemset Mining from “Big Data” is used to mine important patterns of item occurrence from large unstructured database. When compared with traditional data warehousing techniques, MapReduce methodology provides distributed data mining process. Dataset can be found in two pattern one is horizontal data set and another one is vertical data set. Tree based frequent pattern MapReduce algorithm is considered more efficient among other horizontal frequent itemset mining methods in terms of memory as well as time complexity. Another algorithm is ECLAT that is implemented on vertical data set and is compared with my proposed revised ECLAT Algorithm. As a result the performance of ECLAT Algorithm is improved in proposed algorithm revised ECLAT. In this paper will discuss improved results and reasons for improved results.