Article Abstract

Title: Mining frequent patterns without tree generation
  Author: K.V. Shanthi, J. Akilandeswari, G. Jothi   Email author(s)
  Address: Department of Information Technology, Sona College of Technology (Autonomous), Salem, Tamil Nadu, India ' Department of Information Technology, Sona College of Technology (Autonomous), Salem, Tamil Nadu, India ' Department of Information Technology, Sona College of Technology (Autonomous), Salem, Tamil Nadu, India
  Journal: International Journal of Data Mining, Modelling and Management 2016 - Vol. 8, No.3  pp. 265 - 278
  Abstract: Association rule mining is one of the popular data mining techniques used in varied applications. The technique's biggest challenge is to reduce the time taken in finding the frequent patterns. Though there are various works available in literature on pattern mining, improving efficiency and scalability is still an important research issue. This paper presents a methodology using numerical approach to analyse large datasets and minimise the amount of data examined for generating candidate sets. The proposed algorithm uniquely encodes the data and the entire encoded database can be stored in main memory. This leads to the reduction in both space and time complexity. The frequent patterns are generated without any candidate set or tree construction. The performance of the algorithm is better with respect to both time and space compared to FP-growth and PFM algorithms.
  Keywords: association rules mining; frequent pattern mining; database encoding; numerical approach; data mining; tree generation.
  DOI: 10.1504/IJDMMM.2016.10000330
  Submission date: 08 Aug 2014
Date of acceptance: 24 Jan 2015
Available online: 12 Sep 2016
  Access for editors and complimentary subscribers       Access for Subscribers     Purchase this article        We welcome your comments about this article Comment on the article