MaRFI: Maximal Regular Frequent Itemset Mining using a pair of Transaction-ids

Abstract

Frequent pattern mining is the fundamental and most dominant research area in data mining. Maximal frequent patterns are one of the compact representations of frequent itemsets. There is more number of algorithms to find maximal frequent patterns that are suitable for mining transactional databases. Users not only interested in occurrence frequency but may be interested on frequent patterns that occur at regular intervals. A frequent pattern is regular-frequent, if it occurs at less than or equal to user given maximum regularity threshold. Occurrence behaviour (regularity) of a pattern may be considered as important criteria along with occurrence frequency. There is no suitable algorithm to mine maximal regular-frequent patterns retrieving at once in transactional databases also satisfies downward closure property. Thus we are introducing a new single-pass algorithm called MaRFI (Maximal Regular Frequent Itemset) which mines maximal regular-frequent patterns in transactional databases using pair of transaction-ids instead of using item-ids. Our experimental results show that our algorithm is efficient in finding maximal regular-frequent patterns.

Authors and Affiliations

G. Vijay Kumar , Dr. V. Valli Kumari

Keywords

Related Articles

A Novel Approach for Web Document Classification

The web is a huge repository of information and there is a need for categorizing web documents to facilitate the search and retrieval of documents. Web document classification plays an important role in information organ...

CHEQUE CLEARANCE SYSTEM USING VARIOUS VALIDATION TECHNIQUES

Processing cheques manually is been done for decades and more efficient systems are still under research. In this entire processing system, providing a secured transaction with efficient verification is what more importa...

A LITERATURE SURVEY ON MULTITHREADING TECHNIQUES TO AVOID DATA LOSS IN CLOUD STORAGE

“Security” is a one of the important issues in cloud computing environment. Cloud computing is used to deliver software, storage and processing for millions of users across the world. In the user environment, it is the c...

Temporary centralized network Using On-Demand Routing Protocol 

Applications such as conferences, meetings, lectures, crowd control, search and rescue, disaster recovery, and Army battlefields typically do not have central administration or central infrastructure available.In these s...

Semiconductor Optical Amplifiers (SOA) Performance Optimization in Optical Communication System

The work has been focused on the XOR, AND, OR logic gate implementation, since it is a very versatile approach for implementing many functions in optical networks. The development and study of a novel architecture based...

Download PDF file
  • EP ID EP115023
  • DOI -
  • Views 85
  • Downloads 0

How To Cite

G. Vijay Kumar, Dr. V. Valli Kumari (2013). MaRFI: Maximal Regular Frequent Itemset Mining using a pair of Transaction-ids. International Journal of Computer Science & Engineering Technology, 4(7), 1057-1064. https://europub.co.uk/articles/-A-115023