A Parallel Mining Algorithm for Maximum Erasable Itemset Based on Multi-core Processor
Mining the erasable itemset is an interesting research domain, which has been applied to solve the problem of how to efficiently use limited funds to optimise production in economic crisis. After the problem of mining the erasable itemset was posed, researchers have proposed many algorithms to solve...
Main Authors: | Qunli Zhao, Hesheng Cheng, Chen Shen |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
2024-01-01
|
Series: | Tehnički Vjesnik |
Subjects: | |
Online Access: | https://hrcak.srce.hr/file/455009 |
Similar Items
-
Damped weighted erasable itemset mining with time sensitive dynamic environments
by: Hanju Kim, et al.
Published: (2025-01-01) -
A Robust Technique for Closed Frequent and High Utility Itemsets Mining: Closed-FHUIM
by: Muhammad Waheed Ashraf, et al.
Published: (2024-01-01) -
AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY ITEMSETS
by: Nguyen Thi Thanh Thuy*, Nguyen Van Le, Manh Thien Ly
Published: (2024-06-01) -
Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-11-01) -
Multi-Objective Optimization for High-Dimensional Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-09-01)