Opportunistic mining of top-n high utility patterns
Files
(Published version)
Date
2018
Authors
Liu, J.
Zhang, X.
Fung, B.C.M.
Li, J.
Iqbal, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Information Sciences, 2018; 441:171-186
Statement of Responsibility
Junqiang Liu, Xingxing Zhang, Benjamin C.M. Fung, Jiuyong Li, Farkhund Iqbal
Conference Name
Abstract
Mining high utility patterns is an important data mining problem that is formulated as finding patterns whose utilities are no less than a threshold. As the mining results are very sensitive to such a threshold, it is difficult for users to specify an appropriate one. An alternative formulation of the problem is to find the top-n high utility patterns. However, the second formulation is more challenging because the corresponding threshold is unknown in advance and the solution search space becomes even larger. When there are very long patterns prior algorithms simply cannot work to mine top-n high utility patterns even for very small n. This paper proposes a novel algorithm for mining top-n high utility patterns that are long. The proposed algorithm adopts an opportunistic pattern growth approach and proposes five opportunistic strategies for scalably maintaining shortlisted patterns, for efficiently computing utilities, and for estimating tight upper bounds to prune search space. Extensive experiments show that the proposed algorithm is 1 to 3 orders of magnitude more efficient than the state-of-the-art top-n high utility pattern mining algorithms, and it is even up to 2 orders of magnitude faster than high utility pattern mining algorithms that are tuned with an optimal threshold.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2018 Elsevier Inc. All rights reserved.