Efficient Algorithms for Mining Top-K High Utility Itemsets - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Vincent S. Tseng, Cheng-Wei Wu, Philippe Fournier-Viger, Philip S. Yu. Efficient Algorithms for Mining Top-K High Utility Itemsets. IEEE Trans. Knowl. Data Eng., 28(1):54-67, 2016. [doi]

The following publications are possibly variants of this publication:

An efficient algorithm for mining top-k on-shelf high utility itemsetsThu-Lan Dam, Kenli Li, Philippe Fournier-Viger, Quang Huy Duong. kais, 52(3):621-655, 2017. [doi]

An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategiesQuang Huy Duong, Bo Liao, Philippe Fournier-Viger, Thu-Lan Dam. kbs, 104:106-122, 2016. [doi]

Mining top-K high utility itemsetsCheng-Wei Wu, Bai-En Shie, Vincent S. Tseng, Philip S. Yu. kdd 2012: 78-86 [doi]

Targeted mining of top-k high utility itemsetsShan Huang, Wensheng Gan, Jinbao Miao, Xuming Han, Philippe Fournier-Viger. eaai, 126(Part D):107047, November 2023. [doi]

An Efficient Algorithm for Mining High Utility Quantitative ItemsetsChia Hua Li, Cheng-Wei Wu, Jiantao Huang, Vincent S. Tseng. icdm 2019: 1005-1012 [doi]

runs on WebDSL