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.

 

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

SAT-based models for overlapping community detection in networks., , , и . Computing, 102 (5): 1275-1299 (2020)On Maximal Frequent Itemsets Mining with Constraints., , , , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 554-569. Springer, (2018)Reasoning Under Conflicts in Smart Environment., , и . ICONIP (3), том 10636 из Lecture Notes in Computer Science, стр. 924-934. Springer, (2017)Un système argumentatif pour le raisonnement sur des ressources limitées., , и . Rev. d'Intelligence Artif., 29 (3-4): 349-368 (2015)Inconsistency-based Ranking of Knowledge Bases., , и . ICAART (2), стр. 414-419. SciTePress, (2015)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)Extracting Frequent Gradual Patterns Using Constraints Modeling., , , , и . CoRR, (2019)Towards Novel Inference Relations based on Logical Argumentation., , и . AI³@AI*IA, том 3546 из CEUR Workshop Proceedings, CEUR-WS.org, (2023)Ranking-based Argumentation Semantics Applied to Logical Argumentation., , и . IJCAI, стр. 3268-3276. ijcai.org, (2023)