Filter your results
- 6
- 5
- 1
- 6
- 2
- 3
- 1
- 6
- 6
- 5
- 4
- 1
- 1
- 6
- 6
- 6
- 3
- 1
- 1
- 1
6 Results
|
|
sorted by
|
On minimal and maximal high utility itemsets mining using propositional satisfiabilityBIGDATA 2021: IEEE International Conference on Big Data, Dec 2021, Orlando (online), United States. pp.622-628, ⟨10.1109/BigData52589.2021.9671422⟩
Conference papers
hal-03466377v1
|
|||
On the enumeration of frequent high utility itemsets: a symbolic AI approachCP 2022: 28th international conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. ⟨10.4230/LIPIcs.CP.2022.27⟩
Conference papers
hal-03721039v1
|
|||
A SAT-Based Approach for Mining High Utility Itemsets from Transaction DatabasesInternational Conference on Big Data Analytics and Knowledge Discovery, Sep 2020, Bratislava, Slovakia
Conference papers
hal-03092027v1
|
|||
A constraint-based approach for enumerating gradual itemsetsICTAI 2021: 33rd IEEE International Conference on Tools with Artificial Intelligence, Nov 2021, Washington D.C (virtual), United States. pp.582-589, ⟨10.1109/ICTAI52525.2021.00093⟩
Conference papers
hal-03466372v1
|
|||
A parallel declarative framework for mining high utility itemsetsIPMU 2022: 19th international conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Jul 2022, Milan, Italy. pp.624-637, ⟨10.1007/978-3-031-08974-9_50⟩
Conference papers
hal-03721020v1
|
|||
Mining closed high utility itemsets based on propositional satisfiabilityData and Knowledge Engineering, 2021, 136 (101927:1-101927:15), ⟨10.1016/j.datak.2021.101927⟩
Journal articles
hal-03466365v1
|