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

AODV, DSDV Performance Analysis with TCP Reno, TCP NewReno, TCP Vegas And TCP Tahoe on Mobile Ad-hoc Networksusing NS2

A mobile ad-hoc network (MANET) is a network that doesn’t need any infrastructure which is capable of communicating between nodes without any centralized administration. MANET is the best choice which is of less cost...

Content Based Image Retrieval based on Dual Tree Discrete Wavelet Transform

Today in various fields like space research, medicine, cartography and oncology large number of images are available. Searching a relevant image from these database is becoming a tedious process. Content Based Image...

The Feasibility of Content Sharing With (Dtn) On Commercial Smart Phones

The increase in the number of smart phone users has lead to the increase in the peer-topeer adhoc content sharing. Traditional data delivery schemes are not suitable for such networks due to intermittent connectivity...

Robust Image Watermarking using Three Domains of SVD

In this paper robust watermarking scheme is proposed using SVD. Initially singular value decomposition is applied to the host image. After SVD, watermark is embedded in three domains i.e., in D, U and V. Watermark is...

Cloud Computing Services to Business perspective

Cloud Computing Services shows to offer significant cost advantages. Particularly start-up companies benefit from these advantages, since frequently they do not operate an internal IT infrastructure. But those costs...

Download PDF file
  • EP ID EP27435
  • DOI -
  • Views 485
  • 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