P-IOC-FPMine: an association rule mining algorithm for item constraints based on the MapReduce framework Online publication date: Tue, 13-Sep-2022
by Zenan Chu; Wei Wang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 23, No. 1, 2022
Abstract: In the application of big data, one of the most challenging problems is how to consider the requirements of users. To avoid this problem, we proposed IOC-FP-growth. This added user-defined pre-term or post-item constraints into the classic FP-growth algorithm. What's more, a parallel data mining algorithm based on MapReduce, namely P-IOC-FPMine was proposed, which was a low-memory fast association rule mining algorithm. Finally, by evaluating the effectiveness of the method in the public data. The results showed that the IOC-FP-growth method can consider the user's needs for association rules easily. Compared with the FP-growth, Recorder and PNARCMC, we only need to meet the requirements of users to extract accurate rules, which will bring huge advantages for data mining. After parallelisation, the performance of the P-IOC-FPMine was better than FP-growth on the data set. The results showed that the P-IOC-FPMine was more appropriate for handling large-scale data sets.
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 Wireless and Mobile Computing (IJWMC):
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