Mining frequent patterns without tree generation
by K.V. Shanthi; J. Akilandeswari; G. Jothi
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 8, No. 3, 2016

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.

Online publication date: Mon, 12-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com