Frequent Items Mining in Data Streams

Abstract

The main goal of this research is to mine frequent items in data streams using ECLAT and Dynamic Itemset Mining algorithms and finding the performance and drawbacks of these two algorithms. Most commonly used traditional association rule mining algorithms are APRIORI algorithms, Partitioning algorithms, Pincer-Search algorithms, FPGrowth Algorithms and Dynamic Item Set Mining Algorithms, Eclat algorithms and so on. The performance factors used are number of frequent items generated using different thresholds and execution time. From the experimental results we come know that the performance of Éclat algorithm is better than the Dynamic Item Set Counting Algorithm.

Authors and Affiliations

Dr. S. Vijayarani, Ms. R. Prasannalakshmi

Keywords

Related Articles

A Surveillance of Clustering Multi Represented Objects

Recent technological advances have tremendously increased the amount of collected data. Besides the total amount of collected information, the complexity of data objects increases as well. With the growing amount of dat...

Suspension System of Electric Go-Kart

The main objective of the project is to analyze the entire double wishbone suspension system for go-kart car, as it allows the engineer to carefully control the motion of the wheel throughout suspension travel. A 3d cad...

Design High Speed Doubles Precision Floating Point Unit Using Verilog

To represent very large or small values, large range is required as the integer representation is no longer appropriate. These values can be represented using the IEEE-754 standard based floating point representation. T...

LPG Gas Weight and Leakage Detection System Using GSM

In this paper, we proposed an LPG Gas Weight and Leakage Detection System Using GSM .This is useful in various applications in homes and hotels. Many times it happens that because of the rush or due to the shortage of c...

slugAn Approach towards Link Positions Routing In Wireless Network

Here, we account for the fact that MAC protocols incorporate a finite number of transmission attempts per packet. The performance of a path depends not only on the number of the links on the path and the quality of its l...

Download PDF file
  • EP ID EP20126
  • DOI -
  • Views 263
  • Downloads 4

How To Cite

Dr. S. Vijayarani, Ms. R. Prasannalakshmi (2015). Frequent Items Mining in Data Streams. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 3(4), -. https://europub.co.uk./articles/-A-20126