Mining frequent patterns without tree generation

K.V. Shanthi, J. Akilandeswari and G. Jothi

International Journal of Data Mining, Modelling and Management, 2016, vol. 8, issue 3, 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. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=79062 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:8:y:2016:i:3:p:265-278

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().