The Data Mining Forum                             open-source data mining software data science journal data mining conferences machine learning in software engineering MLISE 2021 utility mining workshop at ICDM 2021
This forum is about data mining, data science and big data: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger. No registration is required to use this forum!.  
HUIM-HC and HUIM-SA: very efficient algorithms for approximate high utility itemset mining
Date: May 05, 2021 08:31AM

Hi all,

This is to let you know that we have just proposed two new algorithms for approximate high utility itemset mining:
- HUIM-HC : using Hill-Climbing
- HUIM-SA : using Simulated Annealing

If you want to read the paper will appear in the ACM TMIS journal. The PDF is here.

In the paper we show that HUIM-SA is generally faster than previous approximate algorithms (HUIM-GA, HUIM-PSO, HUIF-BA, HUIF-GA, HUIM-BPSO) while finding about the same number of high utility itemsets.

I will add the source code and datasets to SPMF next week so that they can be used in your studies or to compare with them. If you need them earlier, you can also send me a message.

Best regards,

Philippe



Edited 1 time(s). Last edit at 05/05/2021 08:31AM by webmasterphilfv.

Options: ReplyQuote


This forum is powered by Phorum and provided by P. Fournier-Viger (© 2012).
Terms of use.