Inter Transactional Association Rule Mining using Boolean Matrix

Abstract

One of the extensions of the data mining is Temporal data mining, which mines or discovers knowledge and patterns from temporal information which includes time attribute analysis. From the various types of temporal association rule mining, much of the literature focuses on intra transaction association rules, which deal with relations within transactions. Only a few algorithms exist to mine inter transaction association rules, where relations across transactions are analyzed. With the help of inter transactional association rules, one can achieve the benefits to know that the item B follows the item A, but also get an indication on when this is supposed to happen. This paper is presenting preliminary framework to find interesting temporal inter transactional associated patterns with the help of modification in data preparation step and with the help of Boolean matrix to process the data. During the data preparation step, the transaction data are converted to Mega transactions. We apply this step after the generation of 1-frequent items, so that it helps to reduce the number of items in the Mega transactions. And then, completing remaining part of frequent item analysis to discover the temporal relationships from data. As the Boolean matrix is generated from the Mega transactions no more dataset scanning is required and thus minimizes the overall execution time.

Authors and Affiliations

Dipti Rana, N. J. Mistry, M. M. Raghuwanshi

Keywords

Related Articles

Design of Dadda Algorithm based Floating Point Multiplier

In this paper area efficient floating point multiplier is developed using Dadda Algorithm . For improving the speed of mantissa multiplication Dadda multiplier is used by replacing Carry Save Multiplier. The use of pr...

(NCECD) A Novel Data Distribution Scheme for VoD Services in P2P Networks

Anonymizing networks such as Tor allow users to access internet services privately by using a series of routers to hide the client’s IP address from the server. The success of such networks However has been limited b...

Representing Competent Revocable Data Access Influence for Multi-Authority Cloud Storage

Cloud computing is rising immensely because of its points of interest and the adaptable storage administrations provided by it. Because of this the quantity of clients has come to at the top. Clearly the clients will...

Design and Implementation of FPGA Based MIMO Decoder in Wireless Receiver

This paper address the implementation of Multi-Input-Multi-Output (MIMO) Decoder using FPGAs embedded in a prototype of Wireless Communication receiver. The task of the MIMO decoder is to appropriately combine the s...

Performance Analysis Of Vedic Multiplier Using Reversible Logic In Spartan 6

A system's performance is generally determined by the performance of the multiplier, because the multiplier is generally the slowest element in the system. Multipliers are key components of many high performance syst...

Download PDF file
  • EP ID EP27435
  • DOI -
  • Views 494
  • Downloads 8

How To Cite

Dipti Rana, N. J. Mistry, M. M. Raghuwanshi (2012). Inter Transactional Association Rule Mining using Boolean Matrix. International Journal of Research in Computer and Communication Technology, 1(2), -. https://europub.co.uk/articles/-A-27435