Reduce Scanning Process for Efficient Mining Tree in Association Rule Mining

Abstract

The essential aspect of mining association rules is to mine the frequent patterns. Due to native difficulty it is impossible to mine complete frequent patterns from a dense database. FP-growth algorithm has been implemented using a Array-based structure, known as a FP-tree, for storing compressed frequency information. Numerous experimental results have demonstrated that the algorithm performs extremely well. But In FP-growth algorithm, two traversals of FP-tree are needed for constructing the new conditional FP-tree. In this paper we present a novel ABFP tree technique that greatly reduces the need to traverse FP-trees and array based FP tree, thus obtaining significantly improved performance for FP-tree based algorithms. The technique works especially well for sparse datasets. We then present a new algorithm which use the FP-tree data structure in combination with the FP- Experimental results show that the new algorithm outperform other algorithm in not only the speed of algorithms, but also their CPU consumption and their scalability.

Authors and Affiliations

Richa Sharma| S.A.T.I., Vidisha, India, Mr. Premnarayan Arya| S.A.T.I., Vidisha, India

Keywords

Related Articles

Human Activity Detection and Recognition Algorithm from Video Surveillances.

This paper presents a novel approach for automatic recognition of human activities from video sequences. Visual study of human motion is currently one of the most active research topics in computer vision. This strong...

Integer Wavelet Transform and Predictive Coding Technique for Lossless Medical Image Compression

Lossless image compression has one of its important application in the field of medical images. Enormous amount of data is created by the information present in the medical images either in multidimensional or multire...

Mobile Rescue Robot for Human Detection in Case of Disaster

Many areas of world are getting affected due to natural calamity. Disasters are exceptional & unstoppable events that are either man made or natural, such as terrorist attacks, earthquakes, wildfires and floods etc. [...

An Overview and Analysis of Private and Public Key DNA Cryptography

with the growth of technological advancements, the threats dealt by a user grow exponentially. Hence security has become a critical issue in data storage and transmission. As traditional cryptographic systems are now...

Cluster Tree Power Aware Routing Protocol for WSN (CTPA)

Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical...

Download PDF file
  • EP ID EP8466
  • DOI -
  • Views 408
  • Downloads 24

How To Cite

Richa Sharma, Mr. Premnarayan Arya (2012). Reduce Scanning Process for Efficient Mining Tree in Association Rule Mining. The International Journal of Technological Exploration and Learning, 1(3), 74-77. https://europub.co.uk./articles/-A-8466