摘要
In this article, we propose a novel temporal pattern mining problem, named high-utility temporal pattern mining, to fulfill the needs of various applications. Different from classical temporal pattern mining aimed at discovering frequent temporal patterns, high-utility temporal pattern mining is to find each temporal pattern whose utility is greater than or equal to the minimum-utility threshold. To facilitate efficient high-utility temporal pattern mining, several extension and pruning strategies are proposed to reduce the search space. Algorithm HUTPMiner is then proposed to efficiently mine high-utility temporal patterns with the aid of the proposed extension and pruning strategies. Experimental results show that HUTPMiner is able to prune a large number of candidates, thereby achieving high mining efficiency.
原文 | American English |
---|---|
文章編號 | 3391230 |
頁(從 - 到) | 1-31 |
頁數 | 31 |
期刊 | ACM Transactions on Intelligent Systems and Technology |
卷 | 11 |
發行號 | 4 |
DOIs | |
出版狀態 | Published - 8月 2020 |