Distributed computing and shared memory-based utility list buffer miner with parallel frameworks for high utility itemset mining
by Eduardus Hardika Sandy Atmaja; Kavita Sonawane
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 23, No. 2, 2023

Abstract: High utility itemset mining (HUIM) is a well-known pattern mining technique. It considers the utility of the items that leads to finding high profit patterns which are more useful for real conditions. Handling large and complex dataset are the major challenges in HUIM. The main problem here is the exponential time complexity. Literature review shows multi-core approaches to solve this problem by parallelising the tasks, but it is limited to single machine resources and also needs a novel strategy. To address this problem, we proposed new strategies namely distributed computing (DC-PLB) and shared memory (SM-PLB)-based utility list buffer miner with parallel frameworks (PLB). It utilises cluster nodes to parallelise and distribute the tasks efficiently. Thorough experiments with results proved that the proposed frameworks achieved better runtime (448 s) in dense datasets compared to the existing PLB (2,237 s). It has effectively addressed the challenges of handing large and complex datasets.

Online publication date: Sun, 30-Jul-2023

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 Business Intelligence and Data Mining (IJBIDM):
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