( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A SAT-Based Approach for Mining High Utility Itemsets from Transaction Databases.

, , , и . DaWaK, том 12393 из Lecture Notes in Computer Science, стр. 91-106. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Amel Mlaouhi

Amel Belaggoun

Amel Bennaceur

Amel Hamzaoui

Amel Fraisse

 

Другие публикации лиц с тем же именем

Mining Closed High Utility Itemsets based on Propositional Satisfiability., , , и . Data Knowl. Eng., (2021)Corrigendum to "Mining Closed High Utility Itemsets based on Propositional Satisfiability" Data Knowl. Eng. 136C (2021) 101927., , , и . Data Knowl. Eng., (июля 2023)On Minimal and Maximal High Utility Itemsets Mining using Propositional Satisfiability., , , и . IEEE BigData, стр. 622-628. IEEE, (2021)Towards a Unified Symbolic AI Framework for Mining High Utility Itemsets., , и . iiWAS, том 14416 из Lecture Notes in Computer Science, стр. 77-91. Springer, (2023)A SAT-Based Approach for Mining High Utility Itemsets from Transaction Databases., , , и . DaWaK, том 12393 из Lecture Notes in Computer Science, стр. 91-106. Springer, (2020)Targeting Minimal Rare Itemsets from Transaction Databases., , и . IJCAI, стр. 2114-2121. ijcai.org, (2023)A Declarative Framework for Mining Top-k High Utility Itemsets., , , , и . DaWaK, том 12925 из Lecture Notes in Computer Science, стр. 250-256. Springer, (2021)A Parallel Declarative Framework for Mining High Utility Itemsets., , , , и . IPMU (2), том 1602 из Communications in Computer and Information Science, стр. 624-637. Springer, (2022)On the Enumeration of Frequent High Utility Itemsets: A Symbolic AI Approach., , и . CP, том 235 из LIPIcs, стр. 27:1-27:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Constraint-based Approach for Enumerating Gradual Itemsets., , , и . ICTAI, стр. 582-589. IEEE, (2021)