Approaches to parallelise Eclat algorithm and analysing its performance for K length prefix-based equivalence classes Online publication date: Wed, 30-Nov-2022
by C.G. Anupama; C. Lakshmi
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 22, No. 1/2, 2023
Abstract: Frequent item set mining (FIM), is one of the prevalent, well-known methods of data mining and is a topic of interest for researchers in the field of decision making. With the establishment of the period of big data where the data is continuously generated from multidimensional sources with enormous volume, and variety in an almost unrevealed way, transforming this data into valuable knowledge discovery which can add value to the organisations to make an efficient decision making poses a challenge in the present research. This leads to the problem of discovery of the maximum frequent patterns in vast datasets and to create a more generalised and interpretable representation of veracity. Targeting the problems stated above, this paper suggests a parallelisation method suitable for any type of parallel environment. The implemented algorithm can be run on a single computer with multi-core processor as well as on a cluster of such machines.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook