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 Review on Recent Computer Crimes

With the evolution of technology, crimes happening with the help of computer and internet are increasing day by day and have become curse for the modern era. Cybercrime globally affects IT environment very much be it gov...

Stepping Towards Component-Based Software Testing Through A Contemporary Layout 

Component- based software development is aimed for developing new software speedily by using minimum resources but outcome the maximum worth. Various components are integrated all together to form the successful software...

A NON-LINEAR SCHEME FOR PMEPR REDUCTION IN MC-CDMA SYSTEM

The main feature of the next-generation wireless systems will be the convergence of multimedia services such as speech, audio, video, image, and data. This implies that a future wireless terminal, by guaranteeing high sp...

Survey on Improving Frequent Pattern mining in Spatial Database

spatial database system as a database system that offers spatial data types in its data model and query language and supports spatial data types in its implementation, providing at least spatial indexing and spatial join...

Optimum Design of Composite Plates under Thermal Buckling Loads using Imperialist Competitive Algorithm

Thermal buckling loads of laminated composite plates are maximized for a given total thickness. Fiber directions and relative thickness of layers are considered as design variables. Analysis of buckling temperature is ca...

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